14 citations · 21 across the 4 of their papers we have counts for
4 papers
On a conjecture of compatibility of multi-states characters
Michel Habib, Thu-Hien To
Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete. We propose in this article a conjecture on the necessary and suffic…
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 ,…
Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time
Michel Habib, Thu-Hien To
A graph is a -leaf power of a tree if its vertices are leaves of and two vertices are adjacent in if and only if their distance in is at most . Then is a…
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…