Evidence map›Paper›PMID 42114082›Full record

ArticleBioinformatics (Oxford, England)2026

SNaQ.jl: Improved scalability for level-1 phylogenetic network inference.

Nathan Kolbow, Sungsik Kong, Tyler Chafin, Joshua Justison, Cécile Ané, Claudia Solís-Lemus

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Nathan KolbowWisconsin Institute for Discovery, University of Wisconsin-Madison, Madison, WI, 53706, United States.ORCID 0000-0003-0577-0218
Sungsik KongWisconsin Institute for Discovery, University of Wisconsin-Madison, Madison, WI, 53706, United States.
Tyler ChafinDepartment of Biological Sciences, University of Arkansas, Fayetteville, AR, 72704, United States.
Joshua JustisonWisconsin Institute for Discovery, University of Wisconsin-Madison, Madison, WI, 53706, United States.
Cécile AnéDepartment of Statistics, University of Wisconsin-Madison, Madison, WI, 53706, United States.ORCID 0000-0002-4702-8217
Claudia Solís-LemusWisconsin Institute for Discovery, University of Wisconsin-Madison, Madison, WI, 53706, United States.ORCID 0000-0002-9789-8915

Funding

National Science Foundation DBI-2010774National Science Foundation DEB-2144367
6 · The paper itself

Abstract

motivationPhylogenetic networks represent complex biological scenarios that are overlooked in trees, such as hybridization and horizontal gene transfer. Although numerous methods have been developed for phylogenetic network inference, their scalability is severely limited by the computational demands of likelihood optimization and the vastness of network space. Composite (or pseudo-) likelihood approaches like SNaQ have improved computational tractability for network inference, but they remain inadequate for datasets of sizes routinely handled by tree inference methods.

resultsHere, we introduce SNaQ.jl, a new standalone Julia package with the composite likelihood inference originally implemented within PhyloNetworks.jl as well as new scalability features that enhance computational efficiency through (i) parallelization of quartet likelihood calculations during composite likelihood computation, (ii) weighted random selection of quartets, and (iii) probabilistic decision-making during network search. Through a simulation study and empirical data analysis, we show that this new version of SNaQ.jl (version 1.1) improves average runtimes by up to 499% on average with no change in function parameters or method accuracy. AVAILABILITY AND IMPLEMENTATION: SNaQ.jl is a new open source Julia package available at https://github.com/JuliaPhylo/SNaQ.jl.

Indexed as

Computational BiologyPhylogenySoftwareAlgorithms

Identifiers

PMID42114082
PMCPMC13224965

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.