Skip to main content

and
  1. 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)