All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees
Abstract Objective In mathematical phylogenetics, a labeled rooted binary tree topology can possess any of a number of labeled histories, each of which represents a possible temporal ordering of its coalescences. Labeled histories appear frequently in calculations that describe the combinatorics of...
| Main Authors: | , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
BMC
2023-02-01
|
| סדרה: | Algorithms for Molecular Biology |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.1186/s13015-023-00224-4 |