Testing the agreement of trees with internal labels
Abstract 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 $${\mathcal {P}}= \{{\mathcal {T}}_1, {\mathcal {T}}_2, \ldot...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
BMC
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/c2518d7cc57641d08d89a726ed1ed4ea |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|