Recognizing Level-k-Based Phylogenetic Networks is NP-Complete
Abstract Phylogenetic networks generalize phylogenetic trees by representing reticulate evolution. Tree-based networks and their support trees have been extensively studied, but not all networks are tree-based. To measure how far such networks are from being tree-based, Suzuki and Hayamizu (2025) formulated the problem of finding the support network with minimum level of a given rooted almost-binary phylogenetic network. They conjectured that this problem is NP-hard and provided exponential-time algorithms. In this paper, we prove this conjecture by showing that, for every fixed integer $$k \ge 1$$ k ≥ 1 , it is NP-complete to decide whether the minimum level is at most k .
Authors
- Takatora Suzuki (ORCID: https://orcid.org/0009-0007-3425-7006)
Institutions
- Waseda University (JP)
Publication Details
- Journal
- Bulletin of Mathematical Biology
- Published
- 2026-11-15
- DOI
- https://doi.org/10.1007/s11538-026-01789-y
- Citations
- 1
- Primary Topic
- Genomics and Phylogenetic Studies
- Type
- article
- Field-Weighted Citation Impact
- 1.16