Cargando…
Linear-time algorithms for phylogenetic tree completion under Robinson–Foulds distance
BACKGROUND: We consider two fundamental computational problems that arise when comparing phylogenetic trees, rooted or unrooted, with non-identical leaf sets. The first problem arises when comparing two trees where the leaf set of one tree is a proper subset of the other. The second problem arises w...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7155338/ https://www.ncbi.nlm.nih.gov/pubmed/32313549 http://dx.doi.org/10.1186/s13015-020-00166-1 |