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 *

169 related articles for article (PubMed ID: 32313549)

  • 21. Median and small parsimony problems on RNA trees.
    Marchand B; Anselmetti Y; Lafond M; Ouangraoua A
    Bioinformatics; 2024 Jun; 40(Suppl 1):i237-i246. PubMed ID: 38940169
    [TBL] [Abstract][Full Text] [Related]  

  • 22. MASTtreedist: visualization of tree space based on maximum agreement subtree.
    Huang H; Li Y
    J Comput Biol; 2013 Jan; 20(1):42-9. PubMed ID: 23294272
    [TBL] [Abstract][Full Text] [Related]  

  • 23. The Connection of the Generalized Robinson-Foulds Metric with Partial Wiener Indices.
    Vukičević D; Matijević D
    Acta Biotheor; 2023 Jan; 71(1):5. PubMed ID: 36695929
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. Non-parametric correction of estimated gene trees using TRACTION.
    Christensen S; Molloy EK; Vachaspati P; Yammanuru A; Warnow T
    Algorithms Mol Biol; 2020; 15():1. PubMed ID: 31911812
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees.
    Smith MR
    Bioinformatics; 2020 Dec; 36(20):5007-5013. PubMed ID: 32619004
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees.
    Goloboff PA; Szumik CA
    Cladistics; 2016 Feb; 32(1):82-89. PubMed ID: 34732022
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Metrics for phylogenetic networks I: generalizations of the Robinson-Foulds metric.
    Cardona G; Llabrés M; Rosselló F; Valiente G
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):46-61. PubMed ID: 19179698
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Efficiently computing the Robinson-Foulds metric.
    Pattengale ND; Gottlieb EJ; Moret BM
    J Comput Biol; 2007; 14(6):724-35. PubMed ID: 17691890
    [TBL] [Abstract][Full Text] [Related]  

  • 30. MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees.
    Matthews SJ; Williams TL
    BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S15. PubMed ID: 20122186
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Reconstructing (super)trees from data sets with missing distances: not all is lost.
    Kettleborough G; Dicks J; Roberts IN; Huber KT
    Mol Biol Evol; 2015 Jun; 32(6):1628-42. PubMed ID: 25657329
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Computing the distribution of a tree metric.
    Bryant D; Steel M
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):420-6. PubMed ID: 19644170
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Are the duplication cost and Robinson-Foulds distance equivalent?
    Zheng Y; Zhang L
    J Comput Biol; 2014 Aug; 21(8):578-90. PubMed ID: 24988427
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.
    Bogdanowicz D; Giaro K
    J Comput Biol; 2017 May; 24(5):422-435. PubMed ID: 28177699
    [TBL] [Abstract][Full Text] [Related]  

  • 35. An exact algorithm for the geodesic distance between phylogenetic trees.
    Kupczok A; von Haeseler A; Klaere S
    J Comput Biol; 2008; 15(6):577-91. PubMed ID: 18631022
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Using tree diversity to compare phylogenetic heuristics.
    Sul SJ; Matthews S; Williams TL
    BMC Bioinformatics; 2009 Apr; 10 Suppl 4(Suppl 4):S3. PubMed ID: 19426451
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Completing gene trees without species trees in sub-quadratic time.
    Mai U; Mirarab S
    Bioinformatics; 2022 Mar; 38(6):1532-1541. PubMed ID: 34978565
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Computing nearest neighbour interchange distances between ranked phylogenetic trees.
    Collienne L; Gavryushkin A
    J Math Biol; 2021 Jan; 82(1-2):8. PubMed ID: 33492606
    [TBL] [Abstract][Full Text] [Related]  

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

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

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