Sciweavers

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

13

TCBB
2010

favoriteEmaildiscussreport

166views more TCBB 2010»

Approximate Maximum Parsimony and Ancestral Maximum Likelihood

13 years 2 months ago

Approximate Maximum Parsimony and Ancestral Maximum Likelihood

Download www.cs.tau.ac.il

— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to 16/9

Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport

Real-time Traffic

Ancestral Maximum Likelihood | Steiner Tree | Steiner Tree Problems | TCBB 2010 |

claim paper

Related Content

» Finding a maximum likelihood tree is hard

» Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony

» Ancestral sequence alignment under optimal conditions

» GASP Gapped Ancestral Sequence Prediction for proteins

» Using Parsimony to Guide Maximum Likelihood Searches

» Parsimony accelerated Maximum Likelihood searches

» Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models

» Exact maximum likelihood estimation of structured or unit root multivariate time series mo...

» An approximation algorithm for haplotype inference by maximum parsimony

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	TCBB
Authors	Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport

Comments (0)