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 *

187 related articles for article (PubMed ID: 32135170)

  • 21. Does random tree puzzle produce Yule-Harding trees in the many-taxon limit?
    Zhu S; Steel M
    Math Biosci; 2013 May; 243(1):109-16. PubMed ID: 23435117
    [TBL] [Abstract][Full Text] [Related]  

  • 22. On Sackin's original proposal: the variance of the leaves' depths as a phylogenetic balance index.
    M Coronado T; Mir A; Rosselló F; Rotger L
    BMC Bioinformatics; 2020 Apr; 21(1):154. PubMed ID: 32326884
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
    Shi F; Li H; Rong G; Zhang Z; Wang J
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3539-3552. PubMed ID: 34506290
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Inferring Optimal Species Trees in the Presence of Gene Duplication and Loss: Beyond Rooted Gene Trees.
    Bayzid MS
    J Comput Biol; 2023 Feb; 30(2):161-175. PubMed ID: 36251762
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Anomalous unrooted gene trees.
    Degnan JH
    Syst Biol; 2013 Jul; 62(4):574-90. PubMed ID: 23576318
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Transforming rooted agreement into unrooted agreement.
    Przytycka TM
    J Comput Biol; 1998; 5(2):335-49. PubMed ID: 9672836
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Refining discordant gene trees.
    Górecki P; Eulenstein O
    BMC Bioinformatics; 2014; 15 Suppl 13(Suppl 13):S3. PubMed ID: 25434729
    [TBL] [Abstract][Full Text] [Related]  

  • 28. On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
    van Iersel L; Kelk S; Stamoulis G; Stougie L; Boes O
    Algorithmica; 2018; 80(11):2993-3022. PubMed ID: 30956378
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Distributions of cherries for two models of trees.
    McKenzie A; Steel M
    Math Biosci; 2000 Mar; 164(1):81-92. PubMed ID: 10704639
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Algorithms for MDC-based multi-locus phylogeny inference: beyond rooted binary gene trees on single alleles.
    Yu Y; Warnow T; Nakhleh L
    J Comput Biol; 2011 Nov; 18(11):1543-59. PubMed ID: 22035329
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Calculating the Unrooted Subtree Prune-and-Regraft Distance.
    Whidden C; Matsen F
    IEEE/ACM Trans Comput Biol Bioinform; 2018 Feb; ():. PubMed ID: 29994585
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Genomic duplication problems for unrooted gene trees.
    Paszek J; Górecki P
    BMC Genomics; 2016 Jan; 17 Suppl 1(Suppl 1):15. PubMed ID: 26818591
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Leaping through Tree Space: Continuous Phylogenetic Inference for Rooted and Unrooted Trees.
    Penn MJ; Scheidwasser N; Penn J; Donnelly CA; Duchêne DA; Bhatt S
    Genome Biol Evol; 2023 Dec; 15(12):. PubMed ID: 38085949
    [TBL] [Abstract][Full Text] [Related]  

  • 35. On the Shapley Value of Unrooted Phylogenetic Trees.
    Wicke K; Fischer M
    Bull Math Biol; 2019 Feb; 81(2):618-638. PubMed ID: 29344760
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Counting phylogenetic networks of level 1 and 2.
    Bouvel M; Gambette P; Mansouri M
    J Math Biol; 2020 Dec; 81(6-7):1357-1395. PubMed ID: 33005997
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Analyzing Phylogenetic Trees with a Tree Lattice Coordinate System and a Graph Polynomial.
    Liu P; Biller P; Gould M; Colijn C
    Syst Biol; 2022 Oct; 71(6):1378-1390. PubMed ID: 35169849
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Topology selection in unrooted molecular phylogenetic tree by minimum model-based complexity method.
    Tanaka H; Ren F; Okayama T; Gojobori T
    Pac Symp Biocomput; 1999; ():326-37. PubMed ID: 10380208
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Inferring phylogeny from whole genomes.
    Górecki P; Tiuryn J
    Bioinformatics; 2007 Jan; 23(2):e116-22. PubMed ID: 17237078
    [TBL] [Abstract][Full Text] [Related]  

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

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