A simple and fast heuristic for protein structure comparison

13 years 4 months ago

Download www.biomedcentral.com

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,

Real-time Traffic

BMCBI 2008 | Map Overlap Problem | Protein Structure Comparison | Variable Neighborhood Search |

claim paper

» Graph Alignments A New Concept to Detect Conserved Regions in Protein Active Sites

» Comparison of protein structures by growing neighborhood alignments

» TOPSFATCAT Fast flexible structural alignment using constraints derived from TOPS Strings ...

» Fast and accurate protein substructure searching with simulated annealing and GPUs

» Boosting Methods for Protein Fold Recognition An Empirical Comparison

» TALI Protein Structure Alignment Using Backbone Torsion Angles

» Analysis of Secondary Structure Elements of Proteins Using Indexing Techniques

» Multiple structure alignment and consensus identification for proteins

Post Info
More Details (n/a)

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)

Sciweavers

A simple and fast heuristic for protein structure comparison

BMCBI 2008 | Map Overlap Problem | Protein Structure Comparison | Variable Neighborhood Search |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers