Cargando…

BetaSearch: a new method for querying β-residue motifs

BACKGROUND: Searching for structural motifs across known protein structures can be useful for identifying unrelated proteins with similar function and characterising secondary structures such as β-sheets. This is infeasible using conventional sequence alignment because linear protein sequences do no...

Descripción completa

Detalles Bibliográficos
Autores principales: Ho, Hui Kian, Gange, Graeme, Kuiper, Michael J, Ramamohanarao, Kotagiri
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3532365/
https://www.ncbi.nlm.nih.gov/pubmed/22839199
http://dx.doi.org/10.1186/1756-0500-5-391
_version_ 1782254298564919296
author Ho, Hui Kian
Gange, Graeme
Kuiper, Michael J
Ramamohanarao, Kotagiri
author_facet Ho, Hui Kian
Gange, Graeme
Kuiper, Michael J
Ramamohanarao, Kotagiri
author_sort Ho, Hui Kian
collection PubMed
description BACKGROUND: Searching for structural motifs across known protein structures can be useful for identifying unrelated proteins with similar function and characterising secondary structures such as β-sheets. This is infeasible using conventional sequence alignment because linear protein sequences do not contain spatial information. β-residue motifs are β-sheet substructures that can be represented as graphs and queried using existing graph indexing methods, however, these approaches are designed for general graphs that do not incorporate the inherent structural constraints of β-sheets and require computationally-expensive filtering and verification procedures. 3D substructure search methods, on the other hand, allow β-residue motifs to be queried in a three-dimensional context but at significant computational costs. FINDINGS: We developed a new method for querying β-residue motifs, called BetaSearch, which leverages the natural planar constraints of β-sheets by indexing them as 2D matrices, thus avoiding much of the computational complexities involved with structural and graph querying. BetaSearch exhibits faster filtering, verification, and overall query time than existing graph indexing approaches whilst producing comparable index sizes. Compared to 3D substructure search methods, BetaSearch achieves 33 and 240 times speedups over index-based and pairwise alignment-based approaches, respectively. Furthermore, we have presented case-studies to demonstrate its capability of motif matching in sequentially dissimilar proteins and described a method for using BetaSearch to predict β-strand pairing. CONCLUSIONS: We have demonstrated that BetaSearch is a fast method for querying substructure motifs. The improvements in speed over existing approaches make it useful for efficiently performing high-volume exploratory querying of possible protein substructural motifs or conformations. BetaSearch was used to identify a nearly identical β-residue motif between an entirely synthetic (Top7) and a naturally-occurring protein (Charcot-Leyden crystal protein), as well as identifying structural similarities between biotin-binding domains of avidin, streptavidin and the lipocalin gamma subunit of human C8.
format Online
Article
Text
id pubmed-3532365
institution National Center for Biotechnology Information
language English
publishDate 2012
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-35323652013-01-03 BetaSearch: a new method for querying β-residue motifs Ho, Hui Kian Gange, Graeme Kuiper, Michael J Ramamohanarao, Kotagiri BMC Res Notes Technical Note BACKGROUND: Searching for structural motifs across known protein structures can be useful for identifying unrelated proteins with similar function and characterising secondary structures such as β-sheets. This is infeasible using conventional sequence alignment because linear protein sequences do not contain spatial information. β-residue motifs are β-sheet substructures that can be represented as graphs and queried using existing graph indexing methods, however, these approaches are designed for general graphs that do not incorporate the inherent structural constraints of β-sheets and require computationally-expensive filtering and verification procedures. 3D substructure search methods, on the other hand, allow β-residue motifs to be queried in a three-dimensional context but at significant computational costs. FINDINGS: We developed a new method for querying β-residue motifs, called BetaSearch, which leverages the natural planar constraints of β-sheets by indexing them as 2D matrices, thus avoiding much of the computational complexities involved with structural and graph querying. BetaSearch exhibits faster filtering, verification, and overall query time than existing graph indexing approaches whilst producing comparable index sizes. Compared to 3D substructure search methods, BetaSearch achieves 33 and 240 times speedups over index-based and pairwise alignment-based approaches, respectively. Furthermore, we have presented case-studies to demonstrate its capability of motif matching in sequentially dissimilar proteins and described a method for using BetaSearch to predict β-strand pairing. CONCLUSIONS: We have demonstrated that BetaSearch is a fast method for querying substructure motifs. The improvements in speed over existing approaches make it useful for efficiently performing high-volume exploratory querying of possible protein substructural motifs or conformations. BetaSearch was used to identify a nearly identical β-residue motif between an entirely synthetic (Top7) and a naturally-occurring protein (Charcot-Leyden crystal protein), as well as identifying structural similarities between biotin-binding domains of avidin, streptavidin and the lipocalin gamma subunit of human C8. BioMed Central 2012-07-30 /pmc/articles/PMC3532365/ /pubmed/22839199 http://dx.doi.org/10.1186/1756-0500-5-391 Text en Copyright ©2012 Ho et al.; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Technical Note
Ho, Hui Kian
Gange, Graeme
Kuiper, Michael J
Ramamohanarao, Kotagiri
BetaSearch: a new method for querying β-residue motifs
title BetaSearch: a new method for querying β-residue motifs
title_full BetaSearch: a new method for querying β-residue motifs
title_fullStr BetaSearch: a new method for querying β-residue motifs
title_full_unstemmed BetaSearch: a new method for querying β-residue motifs
title_short BetaSearch: a new method for querying β-residue motifs
title_sort betasearch: a new method for querying β-residue motifs
topic Technical Note
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3532365/
https://www.ncbi.nlm.nih.gov/pubmed/22839199
http://dx.doi.org/10.1186/1756-0500-5-391
work_keys_str_mv AT hohuikian betasearchanewmethodforqueryingbresiduemotifs
AT gangegraeme betasearchanewmethodforqueryingbresiduemotifs
AT kuipermichaelj betasearchanewmethodforqueryingbresiduemotifs
AT ramamohanaraokotagiri betasearchanewmethodforqueryingbresiduemotifs