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
TypeArticle
TitleBounds on the sequence length sufficient to reconstruct binary level-1 phylogenetic networks under the CFN model
AuthorsFrohn, 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 Goals9 Industry, innovation and infrastructure
Middlesex University ThemeCreativity, Culture & Enterprise
PublisherSpringer
JournalAnnals of Combinatorics
ISSN0218-0006
Electronic0219-3094
Publication dates
Online21 May 2026
Publication process dates
Submitted27 Nov 2025
Accepted29 Apr 2026
Deposited12 Oct 2026
Output statusPublished
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
LanguageEnglish
Permalink -

https://repository.mdx.ac.uk/item/36v3q4

Download files


Publisher's version
s00026-026-00830-0.pdf
License: CC BY 4.0
File access level: Open

  • 2
    total views
  • 0
    total downloads
  • 2
    views this month
  • 0
    downloads this month

Export as

Related outputs

Exact and heuristic computation of the scanwidth of directed acyclic graphs
Holtgrefe, N., van Iersel, L. and Jones, M. 2026. Exact and heuristic computation of the scanwidth of directed acyclic graphs. Journal of Computer and System Sciences. 106. https://doi.org/10.1016/j.jcss.2026.103802
Squirrel: reconstructing semi-directed phylogenetic level-1 networks from four-leaved networks or sequence alignments
Holtgrefe, N., Huber, K.T., van Iersel, L., Jones, M., Martin, S. and Moulton, V. 2025. Squirrel: reconstructing semi-directed phylogenetic level-1 networks from four-leaved networks or sequence alignments. Molecular Biology and Evolution. 42 (4). https://doi.org/10.1093/molbev/msaf067
A near-linear kernel for bounded-state parsimony distance
Deen, E., van Iersel, L., Janssen, R., Jones, M., Murakami, Y. and Zeh, N. 2024. A near-linear kernel for bounded-state parsimony distance. Journal of Computer and System Sciences. 140. https://doi.org/10.1016/j.jcss.2023.103477
Level-2 networks from shortest and longest distances
Huber, K.T., van Iersel, L., Janssen, R., Jones, M., Moulton, V. and Murakami, Y. 2022. Level-2 networks from shortest and longest distances. Discrete Applied Mathematics. 306, pp. 138-165. https://doi.org/10.1016/j.dam.2021.09.026