Fast structure similarity searches among protein models: Efficient clustering of protein fragments

Federico Fogolari, Alessandra Corazza, Paolo Viglino, Gennaro Esposito

Research output: Contribution to journalArticle

Abstract

Background: For many predictive applications a large number of models is generated and later clustered in subsets based on structure similarity. In most clustering algorithms an all-vs-all root mean square deviation (RMSD) comparison is performed. Most of the time is typically spent on comparison of non-similar structures. For sets with more than, say, 10,000 models this procedure is very time-consuming and alternative faster algorithms, restricting comparisons only to most similar structures would be useful.Results: We exploit the inverse triangle inequality on the RMSD between two structures given the RMSDs with a third structure. The lower bound on RMSD may be used, when restricting the search of similarity to a reasonably low RMSD threshold value, to speed up similarity searches significantly. Tests are performed on large sets of decoys which are widely used as test cases for predictive methods, with a speed-up of up to 100 times with respect to all-vs-all comparison depending on the set and parameters used. Sample applications are shown.Conclusions: The algorithm presented here allows fast comparison of large data sets of structures with limited memory requirements. As an example of application we present clustering of more than 100000 fragments of length 5 from the top500H dataset into few hundred representative fragments. A more realistic scenario is provided by the search of similarity within the very large decoy sets used for the tests. Other applications regard filtering nearly-indentical conformation in selected CASP9 datasets and clustering molecular dynamics snapshots.Availability: A linux executable and a Perl script with examples are given in the supplementary material (Additional file 1). The source code is available upon request from the authors.

Original languageEnglish (US)
Article number16
JournalAlgorithms for Molecular Biology
Volume7
Issue number1
DOIs
StatePublished - May 29 2012

Fingerprint

Similarity Search
Root mean square deviation
Cluster Analysis
Fragment
Clustering
Proteins
Protein
Molecular Dynamics Simulation
Large Set
Speedup
Set theory
Clustering algorithms
Model
Conformations
Molecular dynamics
Triangle inequality
Snapshot
Availability
Linux
Threshold Value

ASJC Scopus subject areas

  • Structural Biology
  • Molecular Biology
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Fast structure similarity searches among protein models : Efficient clustering of protein fragments. / Fogolari, Federico; Corazza, Alessandra; Viglino, Paolo; Esposito, Gennaro.

In: Algorithms for Molecular Biology, Vol. 7, No. 1, 16, 29.05.2012.

Research output: Contribution to journalArticle

@article{dae1f9b15f11442c9c61f81161a1c9d8,
title = "Fast structure similarity searches among protein models: Efficient clustering of protein fragments",
abstract = "Background: For many predictive applications a large number of models is generated and later clustered in subsets based on structure similarity. In most clustering algorithms an all-vs-all root mean square deviation (RMSD) comparison is performed. Most of the time is typically spent on comparison of non-similar structures. For sets with more than, say, 10,000 models this procedure is very time-consuming and alternative faster algorithms, restricting comparisons only to most similar structures would be useful.Results: We exploit the inverse triangle inequality on the RMSD between two structures given the RMSDs with a third structure. The lower bound on RMSD may be used, when restricting the search of similarity to a reasonably low RMSD threshold value, to speed up similarity searches significantly. Tests are performed on large sets of decoys which are widely used as test cases for predictive methods, with a speed-up of up to 100 times with respect to all-vs-all comparison depending on the set and parameters used. Sample applications are shown.Conclusions: The algorithm presented here allows fast comparison of large data sets of structures with limited memory requirements. As an example of application we present clustering of more than 100000 fragments of length 5 from the top500H dataset into few hundred representative fragments. A more realistic scenario is provided by the search of similarity within the very large decoy sets used for the tests. Other applications regard filtering nearly-indentical conformation in selected CASP9 datasets and clustering molecular dynamics snapshots.Availability: A linux executable and a Perl script with examples are given in the supplementary material (Additional file 1). The source code is available upon request from the authors.",
author = "Federico Fogolari and Alessandra Corazza and Paolo Viglino and Gennaro Esposito",
year = "2012",
month = "5",
day = "29",
doi = "10.1186/1748-7188-7-16",
language = "English (US)",
volume = "7",
journal = "Algorithms for Molecular Biology",
issn = "1748-7188",
publisher = "BioMed Central",
number = "1",

}

TY - JOUR

T1 - Fast structure similarity searches among protein models

T2 - Efficient clustering of protein fragments

AU - Fogolari, Federico

AU - Corazza, Alessandra

AU - Viglino, Paolo

AU - Esposito, Gennaro

PY - 2012/5/29

Y1 - 2012/5/29

N2 - Background: For many predictive applications a large number of models is generated and later clustered in subsets based on structure similarity. In most clustering algorithms an all-vs-all root mean square deviation (RMSD) comparison is performed. Most of the time is typically spent on comparison of non-similar structures. For sets with more than, say, 10,000 models this procedure is very time-consuming and alternative faster algorithms, restricting comparisons only to most similar structures would be useful.Results: We exploit the inverse triangle inequality on the RMSD between two structures given the RMSDs with a third structure. The lower bound on RMSD may be used, when restricting the search of similarity to a reasonably low RMSD threshold value, to speed up similarity searches significantly. Tests are performed on large sets of decoys which are widely used as test cases for predictive methods, with a speed-up of up to 100 times with respect to all-vs-all comparison depending on the set and parameters used. Sample applications are shown.Conclusions: The algorithm presented here allows fast comparison of large data sets of structures with limited memory requirements. As an example of application we present clustering of more than 100000 fragments of length 5 from the top500H dataset into few hundred representative fragments. A more realistic scenario is provided by the search of similarity within the very large decoy sets used for the tests. Other applications regard filtering nearly-indentical conformation in selected CASP9 datasets and clustering molecular dynamics snapshots.Availability: A linux executable and a Perl script with examples are given in the supplementary material (Additional file 1). The source code is available upon request from the authors.

AB - Background: For many predictive applications a large number of models is generated and later clustered in subsets based on structure similarity. In most clustering algorithms an all-vs-all root mean square deviation (RMSD) comparison is performed. Most of the time is typically spent on comparison of non-similar structures. For sets with more than, say, 10,000 models this procedure is very time-consuming and alternative faster algorithms, restricting comparisons only to most similar structures would be useful.Results: We exploit the inverse triangle inequality on the RMSD between two structures given the RMSDs with a third structure. The lower bound on RMSD may be used, when restricting the search of similarity to a reasonably low RMSD threshold value, to speed up similarity searches significantly. Tests are performed on large sets of decoys which are widely used as test cases for predictive methods, with a speed-up of up to 100 times with respect to all-vs-all comparison depending on the set and parameters used. Sample applications are shown.Conclusions: The algorithm presented here allows fast comparison of large data sets of structures with limited memory requirements. As an example of application we present clustering of more than 100000 fragments of length 5 from the top500H dataset into few hundred representative fragments. A more realistic scenario is provided by the search of similarity within the very large decoy sets used for the tests. Other applications regard filtering nearly-indentical conformation in selected CASP9 datasets and clustering molecular dynamics snapshots.Availability: A linux executable and a Perl script with examples are given in the supplementary material (Additional file 1). The source code is available upon request from the authors.

UR - http://www.scopus.com/inward/record.url?scp=84861473258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861473258&partnerID=8YFLogxK

U2 - 10.1186/1748-7188-7-16

DO - 10.1186/1748-7188-7-16

M3 - Article

VL - 7

JO - Algorithms for Molecular Biology

JF - Algorithms for Molecular Biology

SN - 1748-7188

IS - 1

M1 - 16

ER -