Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CPM
2009
Springer

favoriteEmaildiscussreport

208views Combinatorics» more CPM 2009»

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

13 years 11 months ago

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

Download www.cs.ucr.edu

Thu-Hien To, Michel Habib

Real-time Traffic

CPM 2009 | Discrete Geometry |

claim paper

Related Content

» New results on optimizing rooted triplets consistency

» GIST GroupIndependent Spanning Tree for Data Aggregation in Dense Sensor Networks

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CPM
Authors	Thu-Hien To, Michel Habib

Comments (0)