Chargement en cours...
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...
Enregistré dans:
| Publié dans: | Algorithms Mol Biol |
|---|---|
| Auteur principal: | |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
BioMed Central
2020
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7155338/ https://ncbi.nlm.nih.gov/pubmed/32313549 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13015-020-00166-1 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|