Sciweavers

101 search results - page 2 / 21
» Using Parsimony to Guide Maximum Likelihood Searches
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 5 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
TCBB
2008
107views more  TCBB 2008»
13 years 5 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
BMCBI
2007
165views more  BMCBI 2007»
13 years 5 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ICDAR
1999
IEEE
13 years 9 months ago
Heeding More Than the Top Template
We present a method of classifying a pattern using information furnished by a ranked list of templates, rather than just the best matching template. We propose a parsimonious mode...
Prateek Sarkar, George Nagy
BIBE
2003
IEEE
13 years 10 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret