A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set
Background: The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in mathematical phylogenetics. The special case of a common leaf set L is known to be solvable in linear time. Existing approaches refine one input tree using information o...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BioMed Central Ltd
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |