163 related articles for article (PubMed ID: 32313549)
1. Linear-time algorithms for phylogenetic tree completion under Robinson-Foulds distance.
Bansal MS
Algorithms Mol Biol; 2020; 15():6. PubMed ID: 32313549
[TBL] [Abstract][Full Text] [Related]
2. The Generalized Robinson-Foulds Distance for Phylogenetic Trees.
Llabrés M; Rosselló F; Valiente G
J Comput Biol; 2021 Dec; 28(12):1181-1195. PubMed ID: 34714118
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network.
Tahiri N; Veriga A; Koshkarov A; Morozov B
J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Fast local search for unrooted Robinson-Foulds supertrees.
Chaudhary R; Burleigh JG; Fernández-Baca D
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Robinson-Foulds supertrees.
Bansal MS; Burleigh JG; Eulenstein O; Fernández-Baca D
Algorithms Mol Biol; 2010 Feb; 5():18. PubMed ID: 20181274
[TBL] [Abstract][Full Text] [Related]
9. Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance.
Chaudhary R; Burleigh JG; Fernández-Baca D
Algorithms Mol Biol; 2013 Nov; 8(1):28. PubMed ID: 24180377
[TBL] [Abstract][Full Text] [Related]
10. OCTAL: Optimal Completion of gene trees in polynomial time.
Christensen S; Molloy EK; Vachaspati P; Warnow T
Algorithms Mol Biol; 2018; 13():6. PubMed ID: 29568323
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. The
Khayatian E; Valiente G; Zhang L
J Comput Biol; 2024 Apr; 31(4):328-344. PubMed ID: 38271573
[No Abstract] [Full Text] [Related]
13. Computing the distribution of the Robinson-Foulds distance.
Hayati M; Chindelevitch L
Comput Biol Chem; 2020 May; 87():107284. PubMed ID: 32599459
[TBL] [Abstract][Full Text] [Related]
14. A program to compute the soft Robinson-Foulds distance between phylogenetic networks.
Lu B; Zhang L; Leong HW
BMC Genomics; 2017 Mar; 18(Suppl 2):111. PubMed ID: 28361712
[TBL] [Abstract][Full Text] [Related]
15. A metric for phylogenetic trees based on matching.
Lin Y; Rajan V; Moret BM
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1014-22. PubMed ID: 22184263
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Asymmetric Cluster-Based Measures for Comparative Phylogenetics.
Wagle S; Markin A; Górecki P; Anderson TK; Eulenstein O
J Comput Biol; 2024 Apr; 31(4):312-327. PubMed ID: 38634854
[No Abstract] [Full Text] [Related]
18. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Baste J; Paul C; Sau I; Scornavacca C
Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
[TBL] [Abstract][Full Text] [Related]
19. Comparison of additive trees using circular orders.
Makarenkov V; Leclerc B
J Comput Biol; 2000; 7(5):731-44. PubMed ID: 11153096
[TBL] [Abstract][Full Text] [Related]
20. Median and small parsimony problems on RNA trees.
Marchand B; Anselmetti Y; Lafond M; Ouangraoua A
Bioinformatics; 2024 Jun; 40(Supplement_1):i237-i246. PubMed ID: 38940169
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
