Bitte verwenden Sie diesen Link, wenn Sie dieses Dokument zitieren oder verlinken wollen: https://nbn-resolving.org/urn:nbn:de:gbv:9-opus-107938
Defining Binary Phylogenetic Trees Using Parsimony
- Phylogenetic (i.e., leaf-labeled) trees play a fundamental role in evolutionary research. A typical problem is to reconstruct such trees from data like DNA alignments (whose columns are often referred to as characters), and a simple optimization criterion for such reconstructions is maximum parsimony. It is generally assumed that this criterion works well for data in which state changes are rare. In the present manuscript, we prove that each binary phylogenetic tree T with n ≥ 20k leaves is uniquely defined by the set Ak (T), which consists of all characters with parsimony score k on T. This can be considered as a promising first step toward showing that maximum parsimony as a tree reconstruction criterion is justified when the number of changes in the data is relatively small.
Download full text files
Additional Services
Statistics
| Author: | Mareike Fischer |
|---|---|
| URN: | urn:nbn:de:gbv:9-opus-107938 |
| DOI: | https://doi.org/10.1007/s00026-022-00627-x |
| ISSN: | 0219-3094 |
| Parent Title (English): | Annals of Combinatorics |
| Publisher: | Springer Nature |
| Place of publication: | Berlin |
| Document Type: | Article |
| Language: | English |
| Date of Publication (online): | 2022/12/17 |
| Date of first Publication: | 2023/09/01 |
| Release Date: | 2024/03/01 |
| Tag: | Buneman theorem; Phylogenetic tree; X-splits; maximum parsimony |
| Volume: | 27 |
| Issue: | 3 |
| First Page: | 457 |
| Last Page: | 467 |
| Faculties: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Mathematik und Informatik |
| Collections: | weitere DFG-förderfähige Artikel |
| Licence (German): |  Creative Commons - Namensnennung 4.0 International |