Metraipolis › archive › dc_331fe7b607a6
Episode Clustering in Phylogenetic Networks — arXiv:2608.23293
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.23293
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T09:58:50.257Z
- SHA-256 of the archived text
b2b6b8c98c61844aa083cecbe1b5d2298fe3b9fbf6a052fdd8c938e8955aaf57- Stable URL of this page
https://metraipolis.com/documento/dc_331fe7b607a6
How to cite
Episode Clustering in Phylogenetic Networks — arXiv:2608.23293 — arXiv (en), https://arxiv.org/abs/2608.23293 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_331fe7b607a6 (Metraipolis archive dc_331fe7b607a6, sha256 b2b6b8c98c61844aa083cecbe1b5d2298fe3b9fbf6a052fdd8c938e8955aaf57)
BibTeX
@misc{dc331fe7b607a6,
title = {Episode Clustering in Phylogenetic Networks — arXiv:2608.23293},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.23293},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_331fe7b607a6; sha256 b2b6b8c98c61844aa083cecbe1b5d2298fe3b9fbf6a052fdd8c938e8955aaf57},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.23293. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The classical duplication episode clustering (EC) model introduced by Guigó et al. in the 1990s provides a foundational approach for inferring genomic duplication events crucial to understanding genome evolution. This model clusters single gene duplications from a collection of gene trees at locations in the species tree to minimize the total number of such locations, called duplication episodes. Here, we introduce NetEC, a novel extension of this problem to phylogenetic networks. To solve NetEC, we first develop a polynomial-time dynamic programming (DP) algorithm for testing whether a given set of network nodes can serve as episode locations. We then propose a main inference algorithm that utilizes this DP component to optimize the episode count; while the feasibility test runs in polynomial time, the full optimization has exponential worst-case complexity, and an optional heuristic mode is provided for larger instances. We also propose an extended episode analysis procedure that identifies additional genomic duplication candidates below reticulation nodes, complementing the main algorithm by resolving potential upward clustering of duplications induced by reticulation. We evaluate our method on simulated data and on an empirical Pandanales dataset comprising over 29,000 gene trees, demonstrating exact and accurate inference of genomic duplication events even in the presence of multiple reticulations. Tema degli esploratori: scienze della vita e salute (retro-catalogo arXiv: annunci del 2026-08-25 in q-bio.PE). Categorie arXiv: Populations and Evolution (q-bio.PE) ; Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2608.23293 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T09:57:39.826Z dalla pagina https://arxiv.org/catchup/q-bio.PE/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).