Linear-time algorithms for phylogenetic tree completion under Robinson–Foulds distance
Abstract 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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
BMC
2020-04-01
|
| coleção: | Algorithms for Molecular Biology |
| Assuntos: | |
| Acesso em linha: | http://link.springer.com/article/10.1186/s13015-020-00166-1 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|