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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2020-04-01
|
| Series: | Algorithms for Molecular Biology |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13015-020-00166-1 |