Sciweavers

193 search results - page 1 / 39
» Approximate Maximum Parsimony and Ancestral Maximum Likeliho...
Sort
View
TCBB
2010
166views more  TCBB 2010»
13 years 2 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— 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 sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
JACM
2006
99views more  JACM 2006»
13 years 4 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
RECOMB
2008
Springer
14 years 4 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
BMCBI
2005
134views more  BMCBI 2005»
13 years 4 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
BMCBI
2004
94views more  BMCBI 2004»
13 years 4 months ago
GASP: Gapped Ancestral Sequence Prediction for proteins
Background: The prediction of ancestral protein sequences from multiple sequence alignments is useful for many bioinformatics analyses. Predicting ancestral sequences is not a sim...
Richard J. Edwards, Denis C. Shields