Bounds on the sequence length sufficient to reconstruct binary level-1 phylogenetic networks under the CFN model
Article
Frohn, M., Holtgrefe, N., van Iersel, L., Jones, M. and Kelk, S. 2026. Bounds on the sequence length sufficient to reconstruct binary level-1 phylogenetic networks under the CFN model. Annals of Combinatorics. https://doi.org/10.1007/s00026-026-00830-0
| Type | Article |
|---|---|
| Title | Bounds on the sequence length sufficient to reconstruct binary level-1 phylogenetic networks under the CFN model |
| Authors | Frohn, M., Holtgrefe, N., van Iersel, L., Jones, M. and Kelk, S. |
| Abstract | Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which lineages merge, called reticulation events. While the question of data sufficiency has been studied extensively in the context of trees, it remains largely unexplored for networks. In this work, we take a first step in this direction by establishing bounds on the amount of genomic data required to reconstruct binary level-1 semi-directed phylogenetic networks, which are binary networks in which reticulation events are indicated by directed edges, all other edges are undirected, and cycles are vertex disjoint. For this class, methods have been developed recently that are statistically consistent. Roughly speaking, such methods are guaranteed to reconstruct the correct network assuming infinitely long genomic sequences. Here we consider the question whether networks from this class can be uniquely and correctly reconstructed from finite sequences. Specifically, we present an inference algorithm that takes as input genetic sequence data, and demonstrate that the sequence length sufficient to reconstruct the correct network with high probability, under the CFN model of evolution, scales logarithmically, polynomially, or polylogarithmically with the number of taxa, depending on the parameter regime. As part of our contribution, we also present novel inference rules for quartet data in the semi-directed phylogenetic network setting. |
| Sustainable Development Goals | 9 Industry, innovation and infrastructure |
| Middlesex University Theme | Creativity, Culture & Enterprise |
| Publisher | Springer |
| Journal | Annals of Combinatorics |
| ISSN | 0218-0006 |
| Electronic | 0219-3094 |
| Publication dates | |
| Online | 21 May 2026 |
| Publication process dates | |
| Submitted | 27 Nov 2025 |
| Accepted | 29 Apr 2026 |
| Deposited | 12 Oct 2026 |
| Output status | Published |
| Publisher's version | License File Access Level Open |
| Copyright Statement | This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. |
| Digital Object Identifier (DOI) | https://doi.org/10.1007/s00026-026-00830-0 |
| Language | English |
https://repository.mdx.ac.uk/item/36v3q4
Download files
2
total views0
total downloads2
views this month0
downloads this month