Cost estimation heuristics for phylogenetic network construction and refinement

As has been long known, searching for phylogenetic graphs generates a myriad of computationally hard problems. These include the familiar tree search, sum-of-pairs sequence alignment and tree-alignment. When network graphs are added as an option, additional complexities present themselves. Given that, then basic operations (e.g. determining single graph optimality values) are NP-hard (or even uncomputable depending on the optimality criterion), heuristics for these procedures are employed. When the problem is to identify a heuristically optimal network, higher-level cost estimation is required to allow for the efficient evaluation of the large number of candidate graphs encountered in a phylogenetic search. Initial estimators for network construction and refinement are presented and their performance illustrated with real data sets as a potential path towards further research analysis.

Authors

Institutions

Publication Details

Journal
Cladistics
Published
2026-11-20
DOI
https://doi.org/10.1111/cla.70079
Primary Topic
Genomics and Phylogenetic Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Cost estimation heuristics for phylogenetic network construction and refinement

Ward C. Wheeler
Cladistics
Genomics and Phylogenetic Studies
article

Cost estimation heuristics for phylogenetic network construction and refinement

Ward C. Wheeler
article en

Abstract

As has been long known, searching for phylogenetic graphs generates a myriad of computationally hard problems. These include the familiar tree search, sum-of-pairs sequence alignment and tree-alignment. When network graphs are added as an option, additional complexities present themselves. Given that, then basic operations (e.g. determining single graph optimality values) are NP-hard (or even uncomputable depending on the optimality criterion), heuristics for these procedures are employed. When the problem is to identify a heuristically optimal network, higher-level cost estimation is required to allow for the efficient evaluation of the large number of candidate graphs encountered in a phylogenetic search. Initial estimators for network construction and refinement are presented and their performance illustrated with real data sets as a potential path towards further research analysis.

Cladistics
American Museum of Natural History (US)
Genomics and Phylogenetic Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Cost estimation heuristics for phylogenetic network construction and refinement — Ward C. Wheeler · Cladistics (2026) | TGRS Research Map | TGRS