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 *

106 related articles for article (PubMed ID: 19208163)

  • 1. Maximum independent sets of commuting and noninterfering inversions.
    Swenson KM; To Y; Tang J; Moret BM
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S6. PubMed ID: 19208163
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Sorting signed permutations by inversions in O(nlogn) time.
    Swenson KM; Rajan V; Lin Y; Moret BM
    J Comput Biol; 2010 Mar; 17(3):489-501. PubMed ID: 20377459
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Heuristics for the inversion median problem.
    Rajan V; Xu AW; Lin Y; Swenson KM; Moret BM
    BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S30. PubMed ID: 20122203
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An algorithm to enumerate sorting reversals for signed permutations.
    Siepel AC
    J Comput Biol; 2003; 10(3-4):575-97. PubMed ID: 12935346
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An algebraic model for inversion and deletion in bacterial genome rearrangement.
    Clark C; JonuĊĦas J; Mitchell JD; Francis A
    J Math Biol; 2023 Jul; 87(2):34. PubMed ID: 37517046
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Improving reversal median computation using commuting reversals and cycle information.
    Arndt W; Tang J
    J Comput Biol; 2008 Oct; 15(8):1079-92. PubMed ID: 18774904
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Sorting by weighted inversions considering length and symmetry.
    Baudet C; Dias U; Dias Z
    BMC Bioinformatics; 2015; 16 Suppl 19(Suppl 19):S3. PubMed ID: 26695591
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Using median sets for inferring phylogenetic trees.
    Bernt M; Merkle D; Middendorf M
    Bioinformatics; 2007 Jan; 23(2):e129-35. PubMed ID: 17237080
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the computational complexity of the reticulate cophylogeny reconstruction problem.
    Libeskind-Hadas R; Charleston MA
    J Comput Biol; 2009 Jan; 16(1):105-17. PubMed ID: 19119995
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Maximum likelihood estimates of pairwise rearrangement distances.
    Serdoz S; Egri-Nagy A; Sumner J; Holland BR; Jarvis PD; Tanaka MM; Francis AR
    J Theor Biol; 2017 Jun; 423():31-40. PubMed ID: 28435014
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Group-theoretic models of the inversion process in bacterial genomes.
    Egri-Nagy A; Gebhardt V; Tanaka MM; Francis AR
    J Math Biol; 2014 Jul; 69(1):243-65. PubMed ID: 23793228
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Co-divergence and tree topology.
    Calamoneri T; Monti A; Sinaimeri B
    J Math Biol; 2019 Aug; 79(3):1149-1167. PubMed ID: 31203388
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
    Wehe A; Burleigh JG; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Triplet supertree heuristics for the tree of life.
    Lin HT; Burleigh JG; Eulenstein O
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S8. PubMed ID: 19208181
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Ancestral maximum likelihood of evolutionary trees is hard.
    Addario-Berry L; Chor B; Hallett M; Lagergren J; Panconesi A; Wareham T
    J Bioinform Comput Biol; 2004 Jun; 2(2):257-71. PubMed ID: 15297981
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Reconstructing ancestral autosomal arrangements in the Anopheles gambiae complex.
    Xia A; Sharakhova MV; Sharakhov IV
    J Comput Biol; 2008 Oct; 15(8):965-80. PubMed ID: 18774905
    [TBL] [Abstract][Full Text] [Related]  

  • 18. DTL reconciliation repair.
    Ma W; Smirnov D; Libeskind-Hadas R
    BMC Bioinformatics; 2017 Mar; 18(Suppl 3):76. PubMed ID: 28361686
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient Local Search for Euclidean Path-Difference Median Trees.
    Markin A; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the repeat-annotated phylogenetic tree reconstruction problem.
    Swidan F; Ziv-Ukelson M; Pinter RY
    J Comput Biol; 2006 Oct; 13(8):1397-418. PubMed ID: 17061918
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.