Sciweavers

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

33

LATIN
2004
Springer

favoriteEmaildiscussreport

93views Information Technology» more LATIN 2004»

Rooted Maximum Agreement Supertrees

14 years 4 months ago

Rooted Maximum Agreement Supertrees

Download www.df.lth.se

Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane

Real-time Traffic

Information Retrieval | LATIN 2004 |

claim paper

Related Content

» Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

» FixedParameter Tractability of the Maximum Agreement Supertree Problem

» Maximum agreement and compatible supertrees

» Fast FPT Algorithms for Computing Rooted Agreement Forests Theory and Experiments

» An On log n Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

» New results on optimizing rooted triplets consistency

» PolynomialTime Algorithms for the Ordered Maximum Agreement Subtree Problem

» Discovering Frequent Agreement Subtrees from Phylogenetic Data

» Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	LATIN
Authors	Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung

Comments (0)