Cargando…
A program to compute the soft Robinson–Foulds distance between phylogenetic networks
BACKGROUND: Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic networks, phylogenetic trees and clusters serve as the basis for reconstruction and comparison of phylogenetic networks. To understand these re...
Autores principales: | Lu, Bingxin, Zhang, Louxin, Leong, Hon Wai |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5374702/ https://www.ncbi.nlm.nih.gov/pubmed/28361712 http://dx.doi.org/10.1186/s12864-017-3500-5 |
Ejemplares similares
-
The Generalized Robinson-Foulds Distance for Phylogenetic Trees
por: Llabrés, Mercè, et al.
Publicado: (2021) -
Robinson-Foulds Supertrees
por: Bansal, Mukul S, et al.
Publicado: (2010) -
Linear-time algorithms for phylogenetic tree completion under Robinson–Foulds distance
por: Bansal, Mukul S.
Publicado: (2020) -
A generalized Robinson-Foulds distance for labeled trees
por: Briand, Samuel, et al.
Publicado: (2020) -
A Linear Time Solution to the Labeled Robinson–Foulds Distance Problem
por: Briand, Samuel, et al.
Publicado: (2022)