Metaheuristic Multiple Sequence Alignment Optimisation
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima....
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | Swedish |
| Published: |
Högskolan i Skövde, Institutionen för kommunikation och information
2004
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-899 |