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 *

103 related articles for article (PubMed ID: 20671326)

  • 41. Constructing splits graphs.
    Dress AW; Huson DH
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(3):109-15. PubMed ID: 17048386
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Untangling tanglegrams: comparing trees by their drawings.
    Venkatachalam B; Apple J; St John K; Gusfield D
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):588-97. PubMed ID: 20530818
    [TBL] [Abstract][Full Text] [Related]  

  • 43. A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances.
    Adam Z; Sankoff D
    J Comput Biol; 2010 Sep; 17(9):1299-314. PubMed ID: 20874410
    [TBL] [Abstract][Full Text] [Related]  

  • 44. A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees.
    Piovesan T; Kelk SM
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):18-25. PubMed ID: 23702540
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Reconstructing ancestral genomic sequences by co-evolution: formal definitions, computational issues, and biological examples.
    Tuller T; Birin H; Kupiec M; Ruppin E
    J Comput Biol; 2010 Sep; 17(9):1327-44. PubMed ID: 20874411
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Fast recovery of evolutionary trees with thousands of nodes.
    Csurös M
    J Comput Biol; 2002; 9(2):277-97. PubMed ID: 12015882
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Optimizing phylogenetic networks for circular split systems.
    Phipps P; Bereg S
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):535-47. PubMed ID: 21788677
    [TBL] [Abstract][Full Text] [Related]  

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

  • 49. The imperfect ancestral recombination graph reconstruction problem: upper bounds for recombination and homoplasy.
    Lam F; Tarpine R; Istrail S
    J Comput Biol; 2010 Jun; 17(6):767-81. PubMed ID: 20583925
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method.
    Dasarathy G; Nowak R; Roch S
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(2):422-32. PubMed ID: 26357228
    [TBL] [Abstract][Full Text] [Related]  

  • 51. An efficient algorithm for approximating geodesic distances in tree space.
    Battagliero S; Puglia G; Vicario S; Rubino F; Scioscia G; Leo P
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1196-207. PubMed ID: 21116041
    [TBL] [Abstract][Full Text] [Related]  

  • 52. A concise necessary and sufficient condition for the existence of a galled-tree.
    Song YS
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):186-91. PubMed ID: 17048404
    [TBL] [Abstract][Full Text] [Related]  

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

  • 54. Fair-balance paradox, star-tree paradox, and Bayesian phylogenetics.
    Yang Z
    Mol Biol Evol; 2007 Aug; 24(8):1639-55. PubMed ID: 17488737
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Estimating trees from filtered data: identifiability of models for morphological phylogenetics.
    Allman ES; Holder MT; Rhodes JA
    J Theor Biol; 2010 Mar; 263(1):108-19. PubMed ID: 20004210
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Median quartet tree search algorithms using optimal subtree prune and regraft.
    Arasti S; Mirarab S
    Algorithms Mol Biol; 2024 Mar; 19(1):12. PubMed ID: 38481327
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Evaluating the performance of a successive-approximations approach to parameter optimization in maximum-likelihood phylogeny estimation.
    Sullivan J; Abdo Z; Joyce P; Swofford DL
    Mol Biol Evol; 2005 Jun; 22(6):1386-92. PubMed ID: 15758203
    [TBL] [Abstract][Full Text] [Related]  

  • 58. A configuration space of homologous proteins conserving mutual information and allowing a phylogeny inference based on pair-wise Z-score probabilities.
    Bastien O; Ortet P; Roy S; Maréchal E
    BMC Bioinformatics; 2005 Mar; 6():49. PubMed ID: 15757521
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Clearcut: a fast implementation of relaxed neighbor joining.
    Sheneman L; Evans J; Foster JA
    Bioinformatics; 2006 Nov; 22(22):2823-4. PubMed ID: 16982706
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Visual exploration of parameter influence on phylogenetic trees.
    Hess M; Bremm S; Weissgraeber S; Hamacher K; Goesele M; Wiemeyer J; von Landesberger T
    IEEE Comput Graph Appl; 2014; 34(2):48-56. PubMed ID: 24808199
    [TBL] [Abstract][Full Text] [Related]  

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