These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

72 related articles for article (PubMed ID: 21116045)

  • 1. On the distribution of the number of cycles in the breakpoint graph of a random signed permutation.
    Grusea S
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1411-6. PubMed ID: 21116045
    [TBL] [Abstract][Full Text] [Related]  

  • 2. What is the difference between the breakpoint graph and the de Bruijn graph?
    Lin Y; Nurk S; Pevzner PA
    BMC Genomics; 2014; 15 Suppl 6(Suppl 6):S6. PubMed ID: 25572416
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs.
    Alexeev N; Pologova A; Alekseyev MA
    J Comput Biol; 2017 Feb; 24(2):93-105. PubMed ID: 28045556
    [TBL] [Abstract][Full Text] [Related]  

  • 4. On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
    Feijão P; Martinez F; Thévenin A
    BMC Bioinformatics; 2015; 16 Suppl 19(Suppl 19):S1. PubMed ID: 26695008
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Sensitivity analysis for reversal distance and breakpoint reuse in genome rearrangements.
    Sinha AU; Meller J
    Pac Symp Biocomput; 2008; ():37-48. PubMed ID: 18229675
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Moments of genome evolution by Double Cut-and-Join.
    Biller P; Guéguen L; Tannier E
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S7. PubMed ID: 26451469
    [TBL] [Abstract][Full Text] [Related]  

  • 7. DRIMM-Synteny: decomposing genomes into evolutionary conserved segments.
    Pham SK; Pevzner PA
    Bioinformatics; 2010 Oct; 26(20):2509-16. PubMed ID: 20736338
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An O([Formula: see text]) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges.
    Yu S; Hao F; Leong HW
    J Bioinform Comput Biol; 2016 Feb; 14(1):1640002. PubMed ID: 26707923
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Paths and cycles in breakpoint graph of random multichromosomal genomes.
    Xu W; Zheng C; Sankoff D
    J Comput Biol; 2007 May; 14(4):423-35. PubMed ID: 17572021
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Perfect sorting by reversals is not always difficult.
    Bérard S; Bergeron A; Chauve C; Paul C
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):4-16. PubMed ID: 17277409
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Scaffold filling under the breakpoint and related distances.
    Jiang H; Zheng C; Sankoff D; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1220-9. PubMed ID: 22529329
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Techniques for multi-genome synteny analysis to overcome assembly limitations.
    Bhutkar A; Russo S; Smith TF; Gelbart WM
    Genome Inform; 2006; 17(2):152-61. PubMed ID: 17503388
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The SMC' is a highly accurate approximation to the ancestral recombination graph.
    Wilton PR; Carmi S; Hobolth A
    Genetics; 2015 May; 200(1):343-55. PubMed ID: 25786855
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Markovianness and conditional independence in annotated bacterial DNA.
    Hart A; Martínez S
    Stat Appl Genet Mol Biol; 2014 Dec; 13(6):693-716. PubMed ID: 25503673
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Random matrix approach to the distribution of genomic distance.
    Alexeev N; Zograf P
    J Comput Biol; 2014 Aug; 21(8):622-31. PubMed ID: 24650202
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Parallel approach on sorting of genes in search of optimal solution.
    Kumar P; Sahoo G
    Genomics; 2018 May; 110(3):149-153. PubMed ID: 28917636
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Genomic features in the breakpoint regions between syntenic blocks.
    Trinh P; McLysaght A; Sankoff D
    Bioinformatics; 2004 Aug; 20 Suppl 1():i318-25. PubMed ID: 15262815
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Efficient approximations for learning phylogenetic HMM models from data.
    Jojic V; Jojic N; Meek C; Geiger D; Siepel A; Haussler D; Heckerman D
    Bioinformatics; 2004 Aug; 20 Suppl 1():i161-8. PubMed ID: 15262795
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges.
    Hao F; Zhang M; Leong HW
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1702-1711. PubMed ID: 28678711
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Poisson adjacency distributions in genome comparison: multichromosomal, circular, signed and unsigned cases.
    Xu W; Alain B; Sankoff D
    Bioinformatics; 2008 Aug; 24(16):i146-52. PubMed ID: 18689817
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.