FlexProt: alignment of flexible protein structures without a predefinition of hinge regions

FlexProt is a novel technique for the alignment of flexible proteins. Unlike all previous algorithms designed to solve the problem of structural comparisons allowing hinge-bending motions, FlexProt does not require an a priori knowledge of the location of the hinge(s). FlexProt carries out the flexi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational biology 2004, Vol.11 (1), p.83-106
Hauptverfasser: Shatsky, Maxim, Nussinov, Ruth, Wolfson, Haim J
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 106
container_issue 1
container_start_page 83
container_title Journal of computational biology
container_volume 11
creator Shatsky, Maxim
Nussinov, Ruth
Wolfson, Haim J
description FlexProt is a novel technique for the alignment of flexible proteins. Unlike all previous algorithms designed to solve the problem of structural comparisons allowing hinge-bending motions, FlexProt does not require an a priori knowledge of the location of the hinge(s). FlexProt carries out the flexible alignment, superimposing the matching rigid subpart pairs, and detects the flexible hinge regions simultaneously. A large number of methods are available to handle rigid structural alignment. However, proteins are flexible molecules, which may appear in different conformations. Hence, protein structural analysis requires algorithms that can deal with molecular flexibility. Here, we present a method addressing specifically a flexible protein alignment task. First, the method efficiently detects maximal congruent rigid fragments in both molecules. Transforming the task into a graph theoretic problem, our method proceeds to calculate the optimal arrangement of previously detected maximal congruent rigid fragments. The fragment arrangement does not violate the protein sequence order. A clustering procedure is performed on fragment-pairs which have the same 3-D rigid transformation regardless of insertions and deletions (such as loops and turns) which separate them. Although the theoretical worst case complexity of the algorithm is O(n(6)), in practice FlexProt is highly efficient. It performs a structural comparison of a pair of proteins 300 amino acids long in about seven seconds on a standard desktop PC (400 MHz Pentium II processor with 256MB internal memory). We have performed extensive experiments with the algorithm. An assortment of these results is presented here. FlexProt can be accessed via WWW at bioinfo3d.cs.tau.ac.il/FlexProt/.
doi_str_mv 10.1089/106652704773416902
format Article
fullrecord <record><control><sourceid>proquest_pubme</sourceid><recordid>TN_cdi_proquest_miscellaneous_71817548</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17846896</sourcerecordid><originalsourceid>FETCH-LOGICAL-p170t-f69e2f0d6b6454c5b20e66372977c09c57a99b6d3cca32f99e29c41dca16c55d3</originalsourceid><addsrcrecordid>eNqFkD1PwzAQhj2AaCn8AQbkiS3gj9iO2VBFAQkJBpgYIsc5t0aJU2JHwL_HFWVmOt3zPnc6HUJnlFxSUukrSqQUTJFSKV5SqQk7QPMdLDJVM3Qc4zshlEuijtCMCqJYlubobdXB1_M4pGtsOr8OPYSEB4ddxr7pAG9zBj7gmMbJpmmEiD992gxTwiaH0ILzwSc_hN3Yxoc14BHWuY8n6NCZLsLpvi7Q6-r2ZXlfPD7dPSxvHostVSQVTmpgjrSykaUorWgYASm5YlopS7QVymjdyJZbazhzOtvalrS1hkorRMsX6OJ3b771Y4KY6t5HC11nAgxTrBWtqBJl9a9IVVXKSsssnu_Fqemhrbej7834Xf_9jf8Am51vJw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>17846896</pqid></control><display><type>article</type><title>FlexProt: alignment of flexible protein structures without a predefinition of hinge regions</title><source>Mary Ann Liebert Online Subscription</source><source>MEDLINE</source><creator>Shatsky, Maxim ; Nussinov, Ruth ; Wolfson, Haim J</creator><creatorcontrib>Shatsky, Maxim ; Nussinov, Ruth ; Wolfson, Haim J</creatorcontrib><description>FlexProt is a novel technique for the alignment of flexible proteins. Unlike all previous algorithms designed to solve the problem of structural comparisons allowing hinge-bending motions, FlexProt does not require an a priori knowledge of the location of the hinge(s). FlexProt carries out the flexible alignment, superimposing the matching rigid subpart pairs, and detects the flexible hinge regions simultaneously. A large number of methods are available to handle rigid structural alignment. However, proteins are flexible molecules, which may appear in different conformations. Hence, protein structural analysis requires algorithms that can deal with molecular flexibility. Here, we present a method addressing specifically a flexible protein alignment task. First, the method efficiently detects maximal congruent rigid fragments in both molecules. Transforming the task into a graph theoretic problem, our method proceeds to calculate the optimal arrangement of previously detected maximal congruent rigid fragments. The fragment arrangement does not violate the protein sequence order. A clustering procedure is performed on fragment-pairs which have the same 3-D rigid transformation regardless of insertions and deletions (such as loops and turns) which separate them. Although the theoretical worst case complexity of the algorithm is O(n(6)), in practice FlexProt is highly efficient. It performs a structural comparison of a pair of proteins 300 amino acids long in about seven seconds on a standard desktop PC (400 MHz Pentium II processor with 256MB internal memory). We have performed extensive experiments with the algorithm. An assortment of these results is presented here. FlexProt can be accessed via WWW at bioinfo3d.cs.tau.ac.il/FlexProt/.</description><identifier>ISSN: 1066-5277</identifier><identifier>DOI: 10.1089/106652704773416902</identifier><identifier>PMID: 15072690</identifier><language>eng</language><publisher>United States</publisher><subject>Computational Biology - methods ; Computer Simulation ; Models, Molecular ; Protein Structure, Tertiary ; Sequence Alignment ; Sequence Analysis, Protein ; Software</subject><ispartof>Journal of computational biology, 2004, Vol.11 (1), p.83-106</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4022,27922,27923,27924</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/15072690$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Shatsky, Maxim</creatorcontrib><creatorcontrib>Nussinov, Ruth</creatorcontrib><creatorcontrib>Wolfson, Haim J</creatorcontrib><title>FlexProt: alignment of flexible protein structures without a predefinition of hinge regions</title><title>Journal of computational biology</title><addtitle>J Comput Biol</addtitle><description>FlexProt is a novel technique for the alignment of flexible proteins. Unlike all previous algorithms designed to solve the problem of structural comparisons allowing hinge-bending motions, FlexProt does not require an a priori knowledge of the location of the hinge(s). FlexProt carries out the flexible alignment, superimposing the matching rigid subpart pairs, and detects the flexible hinge regions simultaneously. A large number of methods are available to handle rigid structural alignment. However, proteins are flexible molecules, which may appear in different conformations. Hence, protein structural analysis requires algorithms that can deal with molecular flexibility. Here, we present a method addressing specifically a flexible protein alignment task. First, the method efficiently detects maximal congruent rigid fragments in both molecules. Transforming the task into a graph theoretic problem, our method proceeds to calculate the optimal arrangement of previously detected maximal congruent rigid fragments. The fragment arrangement does not violate the protein sequence order. A clustering procedure is performed on fragment-pairs which have the same 3-D rigid transformation regardless of insertions and deletions (such as loops and turns) which separate them. Although the theoretical worst case complexity of the algorithm is O(n(6)), in practice FlexProt is highly efficient. It performs a structural comparison of a pair of proteins 300 amino acids long in about seven seconds on a standard desktop PC (400 MHz Pentium II processor with 256MB internal memory). We have performed extensive experiments with the algorithm. An assortment of these results is presented here. FlexProt can be accessed via WWW at bioinfo3d.cs.tau.ac.il/FlexProt/.</description><subject>Computational Biology - methods</subject><subject>Computer Simulation</subject><subject>Models, Molecular</subject><subject>Protein Structure, Tertiary</subject><subject>Sequence Alignment</subject><subject>Sequence Analysis, Protein</subject><subject>Software</subject><issn>1066-5277</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><recordid>eNqFkD1PwzAQhj2AaCn8AQbkiS3gj9iO2VBFAQkJBpgYIsc5t0aJU2JHwL_HFWVmOt3zPnc6HUJnlFxSUukrSqQUTJFSKV5SqQk7QPMdLDJVM3Qc4zshlEuijtCMCqJYlubobdXB1_M4pGtsOr8OPYSEB4ddxr7pAG9zBj7gmMbJpmmEiD992gxTwiaH0ILzwSc_hN3Yxoc14BHWuY8n6NCZLsLpvi7Q6-r2ZXlfPD7dPSxvHostVSQVTmpgjrSykaUorWgYASm5YlopS7QVymjdyJZbazhzOtvalrS1hkorRMsX6OJ3b771Y4KY6t5HC11nAgxTrBWtqBJl9a9IVVXKSsssnu_Fqemhrbej7834Xf_9jf8Am51vJw</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Shatsky, Maxim</creator><creator>Nussinov, Ruth</creator><creator>Wolfson, Haim J</creator><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>7QO</scope><scope>8FD</scope><scope>FR3</scope><scope>P64</scope><scope>7X8</scope></search><sort><creationdate>2004</creationdate><title>FlexProt: alignment of flexible protein structures without a predefinition of hinge regions</title><author>Shatsky, Maxim ; Nussinov, Ruth ; Wolfson, Haim J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p170t-f69e2f0d6b6454c5b20e66372977c09c57a99b6d3cca32f99e29c41dca16c55d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Computational Biology - methods</topic><topic>Computer Simulation</topic><topic>Models, Molecular</topic><topic>Protein Structure, Tertiary</topic><topic>Sequence Alignment</topic><topic>Sequence Analysis, Protein</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shatsky, Maxim</creatorcontrib><creatorcontrib>Nussinov, Ruth</creatorcontrib><creatorcontrib>Wolfson, Haim J</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>Biotechnology Research Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>Journal of computational biology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shatsky, Maxim</au><au>Nussinov, Ruth</au><au>Wolfson, Haim J</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>FlexProt: alignment of flexible protein structures without a predefinition of hinge regions</atitle><jtitle>Journal of computational biology</jtitle><addtitle>J Comput Biol</addtitle><date>2004</date><risdate>2004</risdate><volume>11</volume><issue>1</issue><spage>83</spage><epage>106</epage><pages>83-106</pages><issn>1066-5277</issn><abstract>FlexProt is a novel technique for the alignment of flexible proteins. Unlike all previous algorithms designed to solve the problem of structural comparisons allowing hinge-bending motions, FlexProt does not require an a priori knowledge of the location of the hinge(s). FlexProt carries out the flexible alignment, superimposing the matching rigid subpart pairs, and detects the flexible hinge regions simultaneously. A large number of methods are available to handle rigid structural alignment. However, proteins are flexible molecules, which may appear in different conformations. Hence, protein structural analysis requires algorithms that can deal with molecular flexibility. Here, we present a method addressing specifically a flexible protein alignment task. First, the method efficiently detects maximal congruent rigid fragments in both molecules. Transforming the task into a graph theoretic problem, our method proceeds to calculate the optimal arrangement of previously detected maximal congruent rigid fragments. The fragment arrangement does not violate the protein sequence order. A clustering procedure is performed on fragment-pairs which have the same 3-D rigid transformation regardless of insertions and deletions (such as loops and turns) which separate them. Although the theoretical worst case complexity of the algorithm is O(n(6)), in practice FlexProt is highly efficient. It performs a structural comparison of a pair of proteins 300 amino acids long in about seven seconds on a standard desktop PC (400 MHz Pentium II processor with 256MB internal memory). We have performed extensive experiments with the algorithm. An assortment of these results is presented here. FlexProt can be accessed via WWW at bioinfo3d.cs.tau.ac.il/FlexProt/.</abstract><cop>United States</cop><pmid>15072690</pmid><doi>10.1089/106652704773416902</doi><tpages>24</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1066-5277
ispartof Journal of computational biology, 2004, Vol.11 (1), p.83-106
issn 1066-5277
language eng
recordid cdi_proquest_miscellaneous_71817548
source Mary Ann Liebert Online Subscription; MEDLINE
subjects Computational Biology - methods
Computer Simulation
Models, Molecular
Protein Structure, Tertiary
Sequence Alignment
Sequence Analysis, Protein
Software
title FlexProt: alignment of flexible protein structures without a predefinition of hinge regions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T15%3A07%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pubme&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=FlexProt:%20alignment%20of%20flexible%20protein%20structures%20without%20a%20predefinition%20of%20hinge%20regions&rft.jtitle=Journal%20of%20computational%20biology&rft.au=Shatsky,%20Maxim&rft.date=2004&rft.volume=11&rft.issue=1&rft.spage=83&rft.epage=106&rft.pages=83-106&rft.issn=1066-5277&rft_id=info:doi/10.1089/106652704773416902&rft_dat=%3Cproquest_pubme%3E17846896%3C/proquest_pubme%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=17846896&rft_id=info:pmid/15072690&rfr_iscdi=true