Sciweavers

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

116

Voted

CPM
1997
Springer

111views Combinatorics» more CPM 1997»

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

15 years 6 months ago

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem

Download www.csc.liv.ac.uk

Mary Cryan, Leslie Ann Goldberg, Cynthia A. Philli

Real-time Traffic

Combinatorics | CPM 1997 |

claim paper

Related Content

» Computing the minimum number of hybridization events for a consistent evolutionary history

» Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets

» Approximate Maximum Parsimony and Ancestral Maximum Likelihood

» HighPerformance Algorithm Engineering for Computational Phylogenetics

» Nature Reserve Selection Problem A Tight Approximation Algorithm

» The Largest Compatible Subset Problem for Phylogenetic Data

» On Approximating the Number of Relevant Variables in a Function

» A pattern recognitionbased approach for phylogenetic network construction with constrained...

» Near optimal online algorithms and fast approximation algorithms for resource allocation p...

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	CPM
Authors	Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips

Comments (0)