A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees

Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6 r r!) · poly(n), where n = |X|. The novelty of this approach is its use of terminals, which are maximal elements of a na...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE/ACM transactions on computational biology and bioinformatics Ročník 10; číslo 1; s. 18 - 25
Hlavní autori:	Piovesan, Teresa, Kelk, Steven M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.01.2013 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Bioinformatics Cluster Analysis Clustering algorithms Computational biology Computational Biology - methods fixed parameter tractability Hybridization, Genetic nonbinary Phylogenetic network Phylogeny Polynomials Silicon Vegetation
ISSN:	1545-5963, 1557-9964, 1557-9964
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!