75 search results - page 6 / 15 » Local Search for the Maximum Parsimony Problem |
ANOR
2011
12 years 11 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
AAAI
2004
13 years 8 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
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...
JSAT
2010
13 years 2 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
ALMOB
2006
13 years 7 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...