Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets

Binets and trinets are phylogenetic networks with two and three leaves, respectively. Here we consider the problem of deciding if there exists a binary level-1 phylogenetic network displaying a given set T of binary binets or trinets over a taxon set X , and constructing such a network whenever it...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 77; číslo 1; s. 173 - 200
Hlavní autori:	Huber, Katharina T., van Iersel, Leo, Moulton, Vincent, Scornavacca, Celine, Wu, Taoyang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2017 Springer Nature B.V Springer Verlag
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Bioinformatics Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Networks Phylogenetics Polynomials Theory of Computation Phylogenetic network NP-hard Supernetwork Phylogenetic tree Exponential-time algorithm Polynomial-time algorithm Trinet Aho algorithm
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!