Cooperative Metaheuristics for Exploring Proteomic Data

Part of the Computational Biology book series (COBO, volume 5)

Most combinatorial optimization problems cannot be solved exactly. A class of methods, called metaheuristics, has proved its efficiency to give good approximated solutions in a reasonable time. Cooperative metaheuristics are a sub-set of metaheuristics, which implies a parallel exploration of the search space by several entities with information exchange between them. Several improvements in the field of metaheuristics are given. A hierarchical approach resting on multiple levels of cooperative metaheuristics is presented. Some applications of these concepts to difficult proteomics problems, including automatic protein identi- fication, biological motif discovery and multiple sequence alignment are presented. For each application, an innovative method based on the cooperation concept is given and compared with classical approaches.


Search Space Evolutionary Algorithm Multiple Sequence Alignment Relative Entropy Spectrum Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2004

Authors and Affiliations

  1. 1.Swiss Institute of BioinformaticsSwitzerland
  2. 2.IRISA-INRIAFrance

Personalised recommendations