Sciweavers

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

88

Voted

ALGORITHMICA
2008

50views more ALGORITHMICA 2008»

Approximation Algorithms for Bounded Degree Phylogenetic Roots

15 years 2 months ago

Approximation Algorithms for Bounded Degree Phylogenetic Roots

Download rnc.r.dendai.ac.jp

Zhi-Zhong Chen

Real-time Traffic

ALGORITHMICA 2008 |

claim paper

Related Content

» Computing BoundedDegree Phylogenetic Roots of Disconnected Graphs

» Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

» An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps

» On the approximability of two tree drawing conventions

» Enumeration of Totally Real Number Fields of Bounded Root Discriminant

» Approximating rooted Steiner networks

» Distance Approximation in BoundedDegree and General Sparse Graphs

» Retrospective Approximation Algorithms for the Multidimensional Stochastic RootFinding Pro...

» Lower Bounds on the Loading of Degree2 Multiple Bus Networks for BinaryTree Algorithms

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Zhi-Zhong Chen

Comments (0)