33 citations · 116 across the 28 of their papers we have counts for
Showing q-bio.PEShow all
3 papers · 1 filter
q-bio.PE2011
Constructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time
Michel Habib, Thu-Hien To
For a given set of species and a set of triplets on , one wants to construct a phylogenetic network which is consistent with ,…
q-bio.PE2010
Unique perfect phylogeny is NP-hard
Michel Habib, Juraj Stacho
We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a col…
q-bio.PE2009★ 14 cited
Level-k Phylogenetic Network can be Constructed from a Dense Triplet Set in Polynomial Time
Thu-Hien To, Michel Habib
Given a dense triplet set , there arise two interesting questions: Does there exists any phylogenetic network consistent with ? And if so, can we find an…