Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 26 min ago
PreprintCC BY-NC-NDbioRxiv

DIMPLE: A Tree-Guided Divide-and-Conquer Framework for ILS-Aware Phylogenetic Network Inference on Large-Scale Data

  1. 1Rice Univeristy

Abstract

Inferring evolutionary histories of species provides a foundation for comparative genomics and evolutionary analyses. Extensive evidence of reticulate evolution motivates the inference of phylogenetic networks, which represent relationships that species trees cannot capture. However, accurate reconstruction of large phylogenetic networks remains a major challenge because of the vast space of possible network topologies. Here, we propose DIMPLE, a divide-and-conquer framework for phylogenetic network inference without an explicit restriction on network level. DIMPLE uses a tree-of-blobs (TOB), which represents the tree-like relationships between regions of potential reticulation while leaving relationships within those regions unresolved. Within each unresolved region, DIMPLE partitions the set of taxa into pairwise-disjoint subsets, each containing at most a user-specified number of taxa. Multiple division runs are allowed, and subsets from different runs may overlap. DIMPLE infers a subnetwork on each subset, merges the subnetworks within each region, and uses the TOB to assemble the resulting networks into a network on the full taxon set. Experiments with true inputs demonstrate accurate merging, with improved reticulation recovery over existing methods on higher-level networks. With estimated inputs, DIMPLE achieves competitive topological accuracy and more consistently recovers hybrid ancestry than competing methods across varying levels of network complexity. Its computational requirements support analyses of hundreds of taxa. Applications to fern and gymnosperm datasets recover documented hybridization and previously reported phylogenetic conflict.

Related

  1. Anchored Exploration in Product Evolution: A Phylogenetic Network Framework for Semiconductor Designs
    Huy Nguyen, Dawoon Jeong
    arXivPreprintCC BY 4.0Full textEvolutionary biologyStatistical & nonlinear physicsarXiv
  2. A hybrid approach combining a phylogenetic method and Approximate Bayesian Computation Random Forest for phylogenetic network inference: application to the rice domestication process in Asia
    Charles-Elie Rabier, Vincent Berry, Jean-Christophe Glaszmann
    HALPreprintCC BYFull textGeneral biologyStatisticsHAL
  3. PhyloZoo: a unified framework for phylogenetic network analysis in Python
    N. Holtgrefe
    bioRxivPreprintCC BY-NC-NDFull textBioinformatics & computational biologybioRxiv
  4. CardamomOT: A mechanistic optimal transport-based framework for gene regulatory network inference, trajectory reconstruction and generative modeling
    Yann Maugé, Elias Ventre
    PLOS Computational BiologyPeer-reviewedCC BYFull text1 citedMolecular biology & gene regulationBioinformatics & computational biologyPLOSEurope PMC
  5. How characters recoding, characters rescoring, and matrix combination weaken phylogenetic and taxonomic inference: the case of Scythicorhinus
    LUCA PANDOLFI, Damien Becker, Jérémy Tissier +2
    PaleorXivPreprintCC BY 4.0Full textEvolutionary biologyOSF
BibTeX
@misc{guang2026dimple,
  title = {{DIMPLE: A Tree-Guided Divide-and-Conquer Framework for ILS-Aware Phylogenetic Network Inference on Large-Scale Data}},
  author = {Z. Guang and N. Sapoval and Z. Yan and M. Kessler and L. Nakhleh},
  howpublished = {bioRxiv},
  year = {2026},
  month = oct,
  doi = {10.64898/2026.10.12.758494},
  url = {https://www.biorxiv.org/content/10.64898/2026.10.12.758494v1},
  note = {CC BY-NC-ND},
}
RIS
TY  - UNPB
TI  - DIMPLE: A Tree-Guided Divide-and-Conquer Framework for ILS-Aware Phylogenetic Network Inference on Large-Scale Data
AU  - Z. Guang
AU  - N. Sapoval
AU  - Z. Yan
AU  - M. Kessler
AU  - L. Nakhleh
PY  - 2026
DA  - 2026/10/12
PB  - bioRxiv
DO  - 10.64898/2026.10.12.758494
UR  - https://www.biorxiv.org/content/10.64898/2026.10.12.758494v1
AB  - Inferring evolutionary histories of species provides a foundation for comparative genomics and evolutionary analyses. Extensive evidence of reticulate evolution motivates the inference of phylogenetic networks, which represent relationships that species trees cannot capture. However, accurate reconstruction of large phylogenetic networks remains a major challenge because of the vast space of possible network topologies. Here, we propose DIMPLE, a divide-and-conquer framework for phylogenetic network inference without an explicit restriction on network level. DIMPLE uses a tree-of-blobs (TOB), which represents the tree-like relationships between regions of potential reticulation while leaving relationships within those regions unresolved. Within each unresolved region, DIMPLE partitions the set of taxa into pairwise-disjoint subsets, each containing at most a user-specified number of taxa. Multiple division runs are allowed, and subsets from different runs may overlap. DIMPLE infers a subnetwork on each subset, merges the subnetworks within each region, and uses the TOB to assemble the resulting networks into a network on the full taxon set. Experiments with true inputs demonstrate accurate merging, with improved reticulation recovery over existing methods on higher-level networks. With estimated inputs, DIMPLE achieves competitive topological accuracy and more consistently recovers hybrid ancestry than competing methods across varying levels of network complexity. Its computational requirements support analyses of hundreds of taxa. Applications to fern and gymnosperm datasets recover documented hybridization and previously reported phylogenetic conflict.
ER  -