Login / Signup
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time.
Thu-Hien To
Michel Habib
Published in:
CPM (2009)
Keyphrases
</>
small number
computational complexity
data sets
image sequences
special case
input data
lower level