Testing the agreement of trees with internal labels
Background: A semi-labeled tree is a tree where all leaves as well as, possibly, some internal nodes are labeled with taxa. Semi-labeled trees encompass ordinary phylogenetic trees and taxonomies. Suppose we are given a collection P= { T1, T2, … , Tk} of semi-labeled trees, called input trees, over...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BioMed Central Ltd
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |