Reconstructing semi-directed level-1 networks using few quarnets

Semi-directed networks are partially directed graphs that model evolution where the directed edges represent reticulate evolutionary events. We present an algorithm that reconstructs binary \(n\)-leaf semi-directed level-1 networks in \(O( n^2)\) time from its quarnets (4-leaf subnetworks). Our meth...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-09
Hauptverfasser:	Frohn, Martin, Holtgrefe, Niels, Leo van Iersel, Jones, Mark, Kelk, Steven
Format:	Artikel
Sprache:	eng
Schlagworte:	Evolutionary algorithms Graph theory Networks Nucleotides
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!