Publication no #683   Type :   Html | Bib | Both
Created: 2009-01-14 17:42:31     Modified: 2012-04-17 16:00:19
683
photophoto
Thu-Hien To and Michel Habib. Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. In CPM09, (5577):275-288, springer, 2009.  
Keywords: explicit network, from triplets, level k phylogenetic network, minimum number, phylogenetic network, phylogeny, polynomial, reconstruction.
Note: http://arxiv.org/abs/0901.1657.
       
Toggle abstract