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 *

168 related articles for article (PubMed ID: 27008672)

  • 21. Ancestral Sequence Reconstruction with Maximum Parsimony.
    Herbst L; Fischer M
    Bull Math Biol; 2017 Dec; 79(12):2865-2886. PubMed ID: 28993971
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
    Berry V; Nicolas F
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A penalty of using anonymous dominant markers (AFLPs, ISSRs, and RAPDs) for phylogenetic inference.
    Simmons MP; Zhang LB; Webb CT; Müller K
    Mol Phylogenet Evol; 2007 Feb; 42(2):528-42. PubMed ID: 16997581
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Determining Significant Correlation Between Pairs of Extant Characters in a Small Parsimony Framework.
    Khandai K; Navarro-Martinez C; Smith B; Buonopane R; Byun SA; Patterson M
    J Comput Biol; 2022 Oct; 29(10):1132-1154. PubMed ID: 35723627
    [No Abstract]   [Full Text] [Related]  

  • 26. Distances that perfectly mislead.
    Huson DH; Steel M
    Syst Biol; 2004 Apr; 53(2):327-32. PubMed ID: 15205056
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Better methods for solving parsimony and compatibility.
    Bonet M; Steel M; Warnow T; Yooseph S
    J Comput Biol; 1998; 5(3):391-407. PubMed ID: 9773340
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Parsimony via consensus.
    Bruen TC; Bryant D
    Syst Biol; 2008 Apr; 57(2):251-6. PubMed ID: 18425715
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Perfectly misleading distances from ternary characters.
    Bandelt HJ; Fischer M
    Syst Biol; 2008 Aug; 57(4):540-3. PubMed ID: 18629738
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
    Sridhar S; Dhamdhere K; Blelloch G; Halperin E; Ravi R; Schwartz R
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):561-71. PubMed ID: 17975268
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Radié: visualizing taxon properties and parsimonious mappings using a radial phylogenetic tree.
    Whalley J; Brooks S; Beiko RG
    Bioinformatics; 2009 Mar; 25(5):672-3. PubMed ID: 19193733
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.
    Keijsper J; Oosterwijk T
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):234-47. PubMed ID: 26357092
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Hierarchical clustering of maximum parsimony reconciliations.
    Mawhorter R; Libeskind-Hadas R
    BMC Bioinformatics; 2019 Nov; 20(1):612. PubMed ID: 31775628
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.
    Kannan L; Wheeler WC
    J Comput Biol; 2014 Apr; 21(4):303-19. PubMed ID: 24559134
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Maximum parsimony for tree mixtures.
    Grünewald S; Moulton V
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):97-102. PubMed ID: 19179702
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Finding a most parsimonious or likely tree in a network with respect to an alignment.
    Kelk S; Pardi F; Scornavacca C; van Iersel L
    J Math Biol; 2019 Jan; 78(1-2):527-547. PubMed ID: 30121824
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Time-Dependent-Asymmetric-Linear-Parsimonious Ancestral State Reconstruction.
    Didier G
    Bull Math Biol; 2017 Oct; 79(10):2334-2355. PubMed ID: 28819749
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model.
    Haack J; Zupke E; Ramirez A; Wu YC; Libeskind-Hadas R
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):14-22. PubMed ID: 29994484
    [TBL] [Abstract][Full Text] [Related]  

  • 39. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
    Matsen FA
    J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
    [TBL] [Abstract][Full Text] [Related]  

  • 40. On the quirks of maximum parsimony and likelihood on phylogenetic networks.
    Bryant C; Fischer M; Linz S; Semple C
    J Theor Biol; 2017 Mar; 417():100-108. PubMed ID: 28087420
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 9.