Skip to main content

2 Result(s)

within Thu-Hien To Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    On a Conjecture about Compatibility of Multi-states Characters

    Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete [4,28]. We propose in this article a conjecture on the necessary and sufficient conditions of com...

    Michel Habib, Thu-Hien To in Algorithms in Bioinformatics (2011)

  2. No Access

    Chapter and Conference Paper

    Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time

    For a given dense triplet set \(\mathcal{T}\) , there exist two natural questions [7]: Does there exist any phylogenetic network c...

    Thu-Hien To, Michel Habib in Combinatorial Pattern Matching (2009)