Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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...
-
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...