Defining a phylogenetic tree with the minimum number of small-state characters
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912547302539264 |
|---|---|
| author | Long, Yangjing Wang, Tong |
| author_facet | Long, Yangjing Wang, Tong |
| contents | Phylogenetic trees represent evolutionary relationships and can be uniquely defined by sets of finite-state biological characteristics. Despite prior work showing that sufficiently large trees can be determined by $r$-state character sets, the minimal leaf thresholds $n_r$ remain largely unknown. In this work, we establish the 3-state case as $n_3 = 8$, providing a concrete base for higher-state analyses. We then resolve the 5-state problem by constructing a counterexample for $n=15$ and proving that for $n \geq 16$, $\lceil (n-3)/4 \rceil$ 5-state characters suffice to uniquely define any tree. Our approach relies on rigorous mathematical induction with complete verification of base cases and logically consistent inductive steps, offering new insights into the minimal conditions for character-based tree identification. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15533 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Defining a phylogenetic tree with the minimum number of small-state characters Long, Yangjing Wang, Tong Populations and Evolution Combinatorics Phylogenetic trees represent evolutionary relationships and can be uniquely defined by sets of finite-state biological characteristics. Despite prior work showing that sufficiently large trees can be determined by $r$-state character sets, the minimal leaf thresholds $n_r$ remain largely unknown. In this work, we establish the 3-state case as $n_3 = 8$, providing a concrete base for higher-state analyses. We then resolve the 5-state problem by constructing a counterexample for $n=15$ and proving that for $n \geq 16$, $\lceil (n-3)/4 \rceil$ 5-state characters suffice to uniquely define any tree. Our approach relies on rigorous mathematical induction with complete verification of base cases and logically consistent inductive steps, offering new insights into the minimal conditions for character-based tree identification. |
| title | Defining a phylogenetic tree with the minimum number of small-state characters |
| topic | Populations and Evolution Combinatorics |
| url | https://arxiv.org/abs/2508.15533 |