Sciweavers

101 search results - page 4 / 21
» Using Parsimony to Guide Maximum Likelihood Searches
Sort
View
BMCBI
2005
134views more  BMCBI 2005»
14 years 9 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
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 1 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
ICML
2008
IEEE
15 years 10 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
ESCIENCE
2007
IEEE
15 years 3 months ago
Distributed and Generic Maximum Likelihood Evaluation
This paper presents GMLE 1 , a generic and distributed framework for maximum likelihood evaluation. GMLE is currently being applied to astroinformatics for determining the shape o...
Travis J. Desell, Nathan Cole, Malik Magdon-Ismail...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 10 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...