75 search results - page 2 / 15 » Local Search for the Maximum Parsimony Problem |
SAC
2004
ACM
13 years 10 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
LION
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
EVOW
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
JAIR
2006
13 years 4 months ago
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
HIS
2008
13 years 6 months ago
2008
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...