Squirrel: reconstructing semi-directed phylogenetic level-1 networks from four-leaved networks or sequence alignments

Article


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
TypeArticle
TitleSquirrel: reconstructing semi-directed phylogenetic level-1 networks from four-leaved networks or sequence alignments
AuthorsHoltgrefe, N., Huber, K.T., van Iersel, L., Jones, M., Martin, S. and Moulton, V.
Abstract

With the increasing availability of genomic data, biologists aim to find more accurate descriptions of evolutionary histories influenced by secondary contact, where diverging lineages reconnect before diverging again. Such reticulate evolutionary events can be more accurately represented in phylogenetic networks than in phylogenetic trees. Since the root location of phylogenetic networks cannot be inferred from biological data under several evolutionary models, we consider semi-directed (phylogenetic) networks: partially directed graphs without a root in which the directed edges represent reticulate evolutionary events. By specifying a known outgroup, the rooted topology can be recovered from such networks. We introduce the algorithm Squirrel (Semi-directed Quarnet-based Inference to Reconstruct Level-1 Networks) which constructs a semi-directed level-1 network from a full set of quarnets (four-leaf semi-directed networks). Our method also includes a heuristic to construct such a quarnet set directly from sequence alignments. We demonstrate Squirrel’s performance through simulations and on real sequence data sets, the largest of which contains 29 aligned sequences close to 1.7 Mb long. The resulting networks are obtained on a standard laptop within a few minutes. Lastly, we prove that Squirrel is combinatorially consistent: given a full set of quarnets coming from a triangle-free semi-directed level-1 network, it is guaranteed to reconstruct the original network. Squirrel is implemented in Python, has an easy-to-use graphical user interface that takes sequence alignments or quarnets as input, and is freely available at https://github.com/nholtgrefe/squirrel

Sustainable Development Goals9 Industry, innovation and infrastructure
Middlesex University ThemeCreativity, Culture & Enterprise
PublisherOxford University Press (OUP)
JournalMolecular Biology and Evolution
ISSN0737-4038
Electronic1537-1719
Publication dates
Online27 Mar 2025
Print01 Apr 2025
Publication process dates
Submitted07 Nov 2024
Accepted04 Mar 2025
Deposited12 Oct 2026
Output statusPublished
Publisher's version
License
File Access Level
Open
Copyright Statement

© The Author(s) 2025. Published by Oxford University Press on behalf of Society for Molecular Biology and Evolution.
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.

Digital Object Identifier (DOI)https://doi.org/10.1093/molbev/msaf067
LanguageEnglish
Permalink -

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

Download files


Publisher's version
msaf067.pdf
License: CC BY 4.0
File access level: Open

  • 1
    total views
  • 0
    total downloads
  • 1
    views this month
  • 0
    downloads this month

Export as

Related outputs

Bounds on the sequence length sufficient to reconstruct binary level-1 phylogenetic networks under the CFN model
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
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
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