Sciweavers

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

9

COCOON
2004
Springer

favoriteEmaildiscussreport

74views Combinatorics» more COCOON 2004»

Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets

13 years 10 months ago

Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets

Download www.df.lth.se

Jesper Jansson, Wing-Kin Sung

Real-time Traffic

COCOON 2004 |

claim paper

Related Content

» Levelk Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time

» Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

» New results on optimizing rooted triplets consistency

» The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	COCOON
Authors	Jesper Jansson, Wing-Kin Sung

Comments (0)