Cargando…
A Linear Time Solution to the Labeled Robinson–Foulds Distance Problem
A large variety of pairwise measures of similarity or dissimilarity have been developed for comparing phylogenetic trees, for example, species trees or gene trees. Due to its intuitive definition in terms of tree clades and bipartitions and its computational efficiency, the Robinson–Foulds (RF) dist...
Autores principales: | Briand, Samuel, Dessimoz, Christophe, El-Mabrouk, Nadia, Nevers, Yannis |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9557742/ https://www.ncbi.nlm.nih.gov/pubmed/35426933 http://dx.doi.org/10.1093/sysbio/syac028 |
Ejemplares similares
-
A generalized Robinson-Foulds distance for labeled trees
por: Briand, Samuel, et al.
Publicado: (2020) -
The Generalized Robinson-Foulds Distance for Phylogenetic Trees
por: Llabrés, Mercè, et al.
Publicado: (2021) -
Linear-time algorithms for phylogenetic tree completion under Robinson–Foulds distance
por: Bansal, Mukul S.
Publicado: (2020) -
Robinson-Foulds Supertrees
por: Bansal, Mukul S, et al.
Publicado: (2010) -
A program to compute the soft Robinson–Foulds distance between phylogenetic networks
por: Lu, Bingxin, et al.
Publicado: (2017)