109 related articles for article (PubMed ID: 36197851)
21. The behavior of admixed populations in neighbor-joining inference of population trees.
Kopelman NM; Stone L; Gascuel O; Rosenberg NA
Pac Symp Biocomput; 2013; ():273-84. PubMed ID: 23424132
[TBL] [Abstract][Full Text] [Related]
22. A sub-cubic time algorithm for computing the quartet distance between two general trees.
Nielsen J; Kristensen AK; Mailund T; Pedersen CN
Algorithms Mol Biol; 2011 Jun; 6():15. PubMed ID: 21639882
[TBL] [Abstract][Full Text] [Related]
23. Topological spines: a structure-preserving visual representation of scalar fields.
Correa CD; Lindstrom P; Bremer PT
IEEE Trans Vis Comput Graph; 2011 Dec; 17(12):1842-51. PubMed ID: 22034301
[TBL] [Abstract][Full Text] [Related]
24. Algorithms for computing the triplet and quartet distances for binary and general trees.
Sand A; Holt MK; Johansen J; Fagerberg R; Brodal GS; Pedersen CN; Mailund T
Biology (Basel); 2013 Sep; 2(4):1189-209. PubMed ID: 24833220
[TBL] [Abstract][Full Text] [Related]
25. A Topological Similarity Measure Between Multi-Resolution Reeb Spaces.
Ramamurthi Y; Agarwal T; Chattopadhyay A
IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4360-4374. PubMed ID: 34101594
[TBL] [Abstract][Full Text] [Related]
26. A Linear Time Solution to the Labeled Robinson-Foulds Distance Problem.
Briand S; Dessimoz C; El-Mabrouk N; Nevers Y
Syst Biol; 2022 Oct; 71(6):1391-1403. PubMed ID: 35426933
[TBL] [Abstract][Full Text] [Related]
27. 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]
28. 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]
29. BarcodeTree: Scalable Comparison of Multiple Hierarchies.
Li G; Zhang Y; Dong Y; Liang J; Zhang J; Wang J; Mcguffin MJ; Yuan X
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):1022-1032. PubMed ID: 31545731
[TBL] [Abstract][Full Text] [Related]
30. Toward a theory of statistical tree-shape analysis.
Feragen A; Lo P; de Bruijne M; Nielsen M; Lauze F
IEEE Trans Pattern Anal Mach Intell; 2013 Aug; 35(8):2008-21. PubMed ID: 23267202
[TBL] [Abstract][Full Text] [Related]
31. An image processing approach to computing distances between RNA secondary structures dot plots.
Ivry T; Michal S; Avihoo A; Sapiro G; Barash D
Algorithms Mol Biol; 2009 Feb; 4():4. PubMed ID: 19203377
[TBL] [Abstract][Full Text] [Related]
32. A generalized Robinson-Foulds distance for labeled trees.
Briand S; Dessimoz C; El-Mabrouk N; Lafond M; Lobinska G
BMC Genomics; 2020 Nov; 21(Suppl 10):779. PubMed ID: 33208096
[TBL] [Abstract][Full Text] [Related]
33. On the fixed parameter tractability of agreement-based phylogenetic distances.
Bordewich M; Scornavacca C; Tokac N; Weller M
J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
[TBL] [Abstract][Full Text] [Related]
34. 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]
35. SPR distance computation for unrooted trees.
Hickey G; Dehne F; Rau-Chaplin A; Blouin C
Evol Bioinform Online; 2008 Feb; 4():17-27. PubMed ID: 19204804
[TBL] [Abstract][Full Text] [Related]
36. Calculating SPR distances between trees.
Goloboff PA
Cladistics; 2008 Aug; 24(4):591-597. PubMed ID: 34879631
[TBL] [Abstract][Full Text] [Related]
37. The Bourque distances for mutation trees of cancers.
Jahn K; Beerenwinkel N; Zhang L
Algorithms Mol Biol; 2021 Jun; 16(1):9. PubMed ID: 34112201
[TBL] [Abstract][Full Text] [Related]
38. A strict upper bound for the partition distance and the cluster distance of phylogenetic trees for each fixed pair of topological trees.
Middendorf M; Wieseke N
PLoS One; 2018; 13(9):e0204907. PubMed ID: 30265723
[TBL] [Abstract][Full Text] [Related]
39. Fast calculation of the quartet distance between trees of arbitrary degrees.
Christiansen C; Mailund T; Pedersen CN; Randers M; Stissing MS
Algorithms Mol Biol; 2006 Sep; 1():16. PubMed ID: 16999860
[TBL] [Abstract][Full Text] [Related]
40. LifePrint: a novel k-tuple distance method for construction of phylogenetic trees.
Reyes-Prieto F; García-Chéquer AJ; Jaimes-Díaz H; Casique-Almazán J; Espinosa-Lara JM; Palma-Orozco R; Méndez-Tenorio A; Maldonado-Rodríguez R; Beattie KL
Adv Appl Bioinform Chem; 2011; 4():13-27. PubMed ID: 21918634
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
