Advances in Estimating Level-1 Phylogenetic Networks from Unrooted SNPs
Journal of Computational Biology · 01.01.2025 · 32 (1) · 3-27
DOI: 10.1089/cmb.2024.0710 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computational Biology, online erschienen am 08.01.2025. Verfasst von Tandy Warnow und 2 weiteren Autor:innen. Beteiligte Einrichtung: Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, Illinois, USA. Hauptthemen laut MEDLINE: Phylogeny, Polymorphism, Single Nucleotide, Algorithms, Models, Genetic. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 39 Literaturangaben.
Abstract (Originalsprache)
We address the problem of how to estimate a phylogenetic network when given single-nucleotide polymorphisms (i.e., SNPs, or bi-allelic markers that have evolved under the infinite sites assumption). We focus on level-1 phylogenetic networks (i.e., networks where the cycles are node-disjoint), since more complex networks are unidentifiable. We provide a polynomial time quartet-based method that we prove correct for reconstructing the semi-directed level-1 phylogenetic network N , if we are given a set of SNPs that covers all the bipartitions of N , even if the ancestral state is not known, provided that the cycles are of length at least 5; we also prove that an algorithm developed by Dan Gusfield in the Journal of Computer and System Sciences in 2005 correctly recovers semi-directed level-1 phylogenetic networks in polynomial time in this case. We present a stochastic model for DNA evolution, and we prove that the two methods (our quartet-based method and Gusfield’s method) are statistically consistent estimators of the semi-directed level-1 phylogenetic network. For the case of multi-state homoplasy-free characters, we prove that our quartet-based method correctly constructs semi-directed level-1 networks under the required conditions (all cycles of length at least five), while Gusfield’s algorithm cannot be used in that case. These results assume that we have access to an oracle for indicating which sites in the DNA alignment are homoplasy-free, and we show that the methods are robust, under some conditions, to oracle errors.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, Illinois, USA.
- Department of Statistics, University of California at Berkeley, Berkeley, California, USA.
ORCID-Profile: Tandy Warnow, Yasamin Tabatabaee, Steven N Evans
Zitieren
APA
Warnow, T., Tabatabaee, Y., & Evans, S. N. (2025). Advances in Estimating Level-1 Phylogenetic Networks from Unrooted SNPs. Journal of Computational Biology, 32(1), 3-27. https://doi.org/10.1089/cmb.2024.0710
Vancouver
Warnow T, Tabatabaee Y, Evans SN. Advances in Estimating Level-1 Phylogenetic Networks from Unrooted SNPs. Journal of Computational Biology. 2025;32(1):3-27. doi:10.1089/cmb.2024.0710
BibTeX
@article{Warnow2025,
author = {Warnow, Tandy and Tabatabaee, Yasamin and Evans, Steven N},
title = {Advances in Estimating Level-1 Phylogenetic Networks from Unrooted SNPs},
journal = {Journal of Computational Biology},
year = {2025},
volume = {32},
number = {1},
pages = {3--27},
doi = {10.1089/cmb.2024.0710}
}
EUVIMED