Sciweavers

Share
BMCBI
2008

A simple and fast heuristic for protein structure comparison

8 years 4 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Map Overlap problem (MAX-CMO) one of the alternatives available. Although this problem may be solved using exact algorithms, researchers require approximate algorithms that obtain good quality solutions using less computational resources than the formers. Results: We propose a variable neighborhood search metaheuristic for solving MAX-CMO. We analyze this strategy in two aspects: 1) from an optimization point of view the strategy is tested on
David A. Pelta, Juan Ramón González,
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where BMCBI
Authors David A. Pelta, Juan Ramón González, Marcos Moreno Vega
Comments (0)
books