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 *

181 related articles for article (PubMed ID: 19875864)

  • 1. Constructing level-2 phylogenetic networks from triplets.
    van Iersel L; Keijsper J; Kelk S; Stougie L; Hagen F; Boekhout T
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):667-81. PubMed ID: 19875864
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Constructing a minimum phylogenetic network from a dense triplet set.
    Habib M; To TH
    J Bioinform Comput Biol; 2012 Oct; 10(5):1250013. PubMed ID: 22849368
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A practical algorithm for reconstructing level-1 phylogenetic networks.
    Huber KT; van Iersel L; Kelk S; Suchecki R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):635-49. PubMed ID: 21393651
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Bayesian coestimation of phylogeny and sequence alignment.
    Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
    BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks.
    Van Iersel L; Kelk S; Mnich M
    J Bioinform Comput Biol; 2009 Aug; 7(4):597-623. PubMed ID: 19634194
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Vestige: maximum likelihood phylogenetic footprinting.
    Wakefield MJ; Maxwell P; Huttley GA
    BMC Bioinformatics; 2005 May; 6():130. PubMed ID: 15921531
    [TBL] [Abstract][Full Text] [Related]  

  • 7. TripNet: a method for constructing rooted phylogenetic networks from rooted triplets.
    Poormohammadi H; Eslahchi C; Tusserkani R
    PLoS One; 2014; 9(9):e106531. PubMed ID: 25208028
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On the elusiveness of clusters.
    Kelk SM; Scornavacca C; van Iersel L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Bayesian inference of phylogenetic networks from bi-allelic genetic markers.
    Zhu J; Wen D; Yu Y; Meudt HM; Nakhleh L
    PLoS Comput Biol; 2018 Jan; 14(1):e1005932. PubMed ID: 29320496
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
    Guillemot S; Jansson J; Sung WK
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Comparison of tree-child phylogenetic networks.
    Cardona G; Rosselló F; Valiente G
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):552-69. PubMed ID: 19875855
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Refining phylogenetic trees given additional data: an algorithm based on parsimony.
    Wu T; Moulton V; Steel M
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):118-25. PubMed ID: 19179705
    [TBL] [Abstract][Full Text] [Related]  

  • 13. NCHB: A method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization.
    Poormohammadi H; Zarchi MS; Ghaneai H
    J Theor Biol; 2020 Mar; 489():110144. PubMed ID: 31911141
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. Evolutionary triplet models of structured RNA.
    Bradley RK; Holmes I
    PLoS Comput Biol; 2009 Aug; 5(8):e1000483. PubMed ID: 19714212
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Using max cut to enhance rooted trees consistency.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.
    Mirzaei S; Wu Y
    IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(3):565-70. PubMed ID: 27295640
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Inferring phylogenetic relationships avoiding forbidden rooted triplets.
    He YJ; Huynh TN; Jansson J; Sung WK
    J Bioinform Comput Biol; 2006 Feb; 4(1):59-74. PubMed ID: 16568542
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Shortest triplet clustering: reconstructing large phylogenies using representative sets.
    Vinh le S; von Haeseler A
    BMC Bioinformatics; 2005 Apr; 6():92. PubMed ID: 15819989
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Algorithms for reticulate networks of multiple phylogenetic trees.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):372-84. PubMed ID: 22025766
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.