Loading…

Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks

The problem of motif identification in protein sequences has been studied for many years in the literature. Current popular algorithms of motif identification in protein sequences face two difficulties, high computational cost and the possibility of insertions and deletions. In this paper, we provid...

Full description

Saved in:
Bibliographic Details
Published in:Neural networks 2005-07, Vol.18 (5), p.835-842
Main Authors: Liu, Derong, Xiong, Xiaoxu, Hou, Zeng-Guang, DasGupta, Bhaskar
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3
cites cdi_FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3
container_end_page 842
container_issue 5
container_start_page 835
container_title Neural networks
container_volume 18
creator Liu, Derong
Xiong, Xiaoxu
Hou, Zeng-Guang
DasGupta, Bhaskar
description The problem of motif identification in protein sequences has been studied for many years in the literature. Current popular algorithms of motif identification in protein sequences face two difficulties, high computational cost and the possibility of insertions and deletions. In this paper, we provide a new strategy that solve the problem more efficiently. We develop a self-organizing neural network structure with multiple levels of subnetworks to make an intelligent classification of the subsequences obtained from protein sequences. We maintain a low computational complexity through the use of this multi-level structure so that the classification of each subsequence is performed with respect to a small subspace of the whole input space. The new definition of pairwise distance between motif patterns provided in this paper can deal with up to two insertions/deletions allowed in a motif, while other existing algorithm can only deal with one insertion or deletion. We also maintain a high reliability using our self-organizing neural network since it will grow as needed to make sure all input patterns are considered and are given the same amount of attention. Simulation results show that our algorithm significantly outperforms existing algorithms in both accuracy and reliability aspects.
doi_str_mv 10.1016/j.neunet.2005.06.007
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_68553003</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0893608005001462</els_id><sourcerecordid>19375835</sourcerecordid><originalsourceid>FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3</originalsourceid><addsrcrecordid>eNqFkU9v1DAQxS0EosvCN0AoF7gljO3YsS9IqOJPpUpc4Gx57XHxknVaO6GCT49DVuoNTqMn_-b5aR4hLyl0FKh8e-wSLgnnjgGIDmQHMDwiO6oG3bJBscdkB0rzVoKCC_KslCMASNXzp-SCSgq6H_odubvymOYYorNznFIzheY0VV2a-zh_b2IqmNeH0tjkG48jbiqm5jZPM9ZZ8G7B5LA0S4nppuoxtFO-sSn-XnWNme1Yx3w_5R_lOXkS7FjwxXnuybePH75efm6vv3y6unx_3bqe0bm1llkdrNIMOO2ZZIFyFSCA9ELLXgvWH6hQHtFpcRA-cMEP9MBEr8E7DHxP3my-NWcNWGZzisXhONqE01KMVEJwAP5fkGo-CFXt96TfQJenUjIGc5vjyeZfhoJZOzFHs3Vi1k4MSFM7qWuvzv7L4YT-YelcQgVenwFbnB1DtsnF8sANlGv69_93G4f1bD8jZlNcXC_vY0Y3Gz_Ffyf5A45PrpM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>19375835</pqid></control><display><type>article</type><title>Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Liu, Derong ; Xiong, Xiaoxu ; Hou, Zeng-Guang ; DasGupta, Bhaskar</creator><creatorcontrib>Liu, Derong ; Xiong, Xiaoxu ; Hou, Zeng-Guang ; DasGupta, Bhaskar</creatorcontrib><description>The problem of motif identification in protein sequences has been studied for many years in the literature. Current popular algorithms of motif identification in protein sequences face two difficulties, high computational cost and the possibility of insertions and deletions. In this paper, we provide a new strategy that solve the problem more efficiently. We develop a self-organizing neural network structure with multiple levels of subnetworks to make an intelligent classification of the subsequences obtained from protein sequences. We maintain a low computational complexity through the use of this multi-level structure so that the classification of each subsequence is performed with respect to a small subspace of the whole input space. The new definition of pairwise distance between motif patterns provided in this paper can deal with up to two insertions/deletions allowed in a motif, while other existing algorithm can only deal with one insertion or deletion. We also maintain a high reliability using our self-organizing neural network since it will grow as needed to make sure all input patterns are considered and are given the same amount of attention. Simulation results show that our algorithm significantly outperforms existing algorithms in both accuracy and reliability aspects.</description><identifier>ISSN: 0893-6080</identifier><identifier>EISSN: 1879-2782</identifier><identifier>DOI: 10.1016/j.neunet.2005.06.007</identifier><identifier>PMID: 16109474</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Algorithms ; Amino Acid Motifs ; Amino Acid Sequence ; Applied sciences ; Artificial intelligence ; Classification ; Computer science; control theory; systems ; Connectionism. Neural networks ; DNA ; DNA Transposable Elements ; Exact sciences and technology ; Gene Deletion ; Molecular Sequence Data ; Motif identification ; Multiple sequence alignment ; Neural network ; Neural Networks (Computer) ; Self-organization</subject><ispartof>Neural networks, 2005-07, Vol.18 (5), p.835-842</ispartof><rights>2005 Elsevier Ltd</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3</citedby><cites>FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,780,784,789,790,23930,23931,25140,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17139135$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/16109474$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Liu, Derong</creatorcontrib><creatorcontrib>Xiong, Xiaoxu</creatorcontrib><creatorcontrib>Hou, Zeng-Guang</creatorcontrib><creatorcontrib>DasGupta, Bhaskar</creatorcontrib><title>Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks</title><title>Neural networks</title><addtitle>Neural Netw</addtitle><description>The problem of motif identification in protein sequences has been studied for many years in the literature. Current popular algorithms of motif identification in protein sequences face two difficulties, high computational cost and the possibility of insertions and deletions. In this paper, we provide a new strategy that solve the problem more efficiently. We develop a self-organizing neural network structure with multiple levels of subnetworks to make an intelligent classification of the subsequences obtained from protein sequences. We maintain a low computational complexity through the use of this multi-level structure so that the classification of each subsequence is performed with respect to a small subspace of the whole input space. The new definition of pairwise distance between motif patterns provided in this paper can deal with up to two insertions/deletions allowed in a motif, while other existing algorithm can only deal with one insertion or deletion. We also maintain a high reliability using our self-organizing neural network since it will grow as needed to make sure all input patterns are considered and are given the same amount of attention. Simulation results show that our algorithm significantly outperforms existing algorithms in both accuracy and reliability aspects.</description><subject>Algorithms</subject><subject>Amino Acid Motifs</subject><subject>Amino Acid Sequence</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Classification</subject><subject>Computer science; control theory; systems</subject><subject>Connectionism. Neural networks</subject><subject>DNA</subject><subject>DNA Transposable Elements</subject><subject>Exact sciences and technology</subject><subject>Gene Deletion</subject><subject>Molecular Sequence Data</subject><subject>Motif identification</subject><subject>Multiple sequence alignment</subject><subject>Neural network</subject><subject>Neural Networks (Computer)</subject><subject>Self-organization</subject><issn>0893-6080</issn><issn>1879-2782</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNqFkU9v1DAQxS0EosvCN0AoF7gljO3YsS9IqOJPpUpc4Gx57XHxknVaO6GCT49DVuoNTqMn_-b5aR4hLyl0FKh8e-wSLgnnjgGIDmQHMDwiO6oG3bJBscdkB0rzVoKCC_KslCMASNXzp-SCSgq6H_odubvymOYYorNznFIzheY0VV2a-zh_b2IqmNeH0tjkG48jbiqm5jZPM9ZZ8G7B5LA0S4nppuoxtFO-sSn-XnWNme1Yx3w_5R_lOXkS7FjwxXnuybePH75efm6vv3y6unx_3bqe0bm1llkdrNIMOO2ZZIFyFSCA9ELLXgvWH6hQHtFpcRA-cMEP9MBEr8E7DHxP3my-NWcNWGZzisXhONqE01KMVEJwAP5fkGo-CFXt96TfQJenUjIGc5vjyeZfhoJZOzFHs3Vi1k4MSFM7qWuvzv7L4YT-YelcQgVenwFbnB1DtsnF8sANlGv69_93G4f1bD8jZlNcXC_vY0Y3Gz_Ffyf5A45PrpM</recordid><startdate>200507</startdate><enddate>200507</enddate><creator>Liu, Derong</creator><creator>Xiong, Xiaoxu</creator><creator>Hou, Zeng-Guang</creator><creator>DasGupta, Bhaskar</creator><general>Elsevier Ltd</general><general>Elsevier Science</general><scope>IQODW</scope><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QO</scope><scope>7TK</scope><scope>8FD</scope><scope>FR3</scope><scope>P64</scope><scope>7X8</scope></search><sort><creationdate>200507</creationdate><title>Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks</title><author>Liu, Derong ; Xiong, Xiaoxu ; Hou, Zeng-Guang ; DasGupta, Bhaskar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Amino Acid Motifs</topic><topic>Amino Acid Sequence</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Classification</topic><topic>Computer science; control theory; systems</topic><topic>Connectionism. Neural networks</topic><topic>DNA</topic><topic>DNA Transposable Elements</topic><topic>Exact sciences and technology</topic><topic>Gene Deletion</topic><topic>Molecular Sequence Data</topic><topic>Motif identification</topic><topic>Multiple sequence alignment</topic><topic>Neural network</topic><topic>Neural Networks (Computer)</topic><topic>Self-organization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Derong</creatorcontrib><creatorcontrib>Xiong, Xiaoxu</creatorcontrib><creatorcontrib>Hou, Zeng-Guang</creatorcontrib><creatorcontrib>DasGupta, Bhaskar</creatorcontrib><collection>Pascal-Francis</collection><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Biotechnology Research Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>Neural networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Derong</au><au>Xiong, Xiaoxu</au><au>Hou, Zeng-Guang</au><au>DasGupta, Bhaskar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks</atitle><jtitle>Neural networks</jtitle><addtitle>Neural Netw</addtitle><date>2005-07</date><risdate>2005</risdate><volume>18</volume><issue>5</issue><spage>835</spage><epage>842</epage><pages>835-842</pages><issn>0893-6080</issn><eissn>1879-2782</eissn><abstract>The problem of motif identification in protein sequences has been studied for many years in the literature. Current popular algorithms of motif identification in protein sequences face two difficulties, high computational cost and the possibility of insertions and deletions. In this paper, we provide a new strategy that solve the problem more efficiently. We develop a self-organizing neural network structure with multiple levels of subnetworks to make an intelligent classification of the subsequences obtained from protein sequences. We maintain a low computational complexity through the use of this multi-level structure so that the classification of each subsequence is performed with respect to a small subspace of the whole input space. The new definition of pairwise distance between motif patterns provided in this paper can deal with up to two insertions/deletions allowed in a motif, while other existing algorithm can only deal with one insertion or deletion. We also maintain a high reliability using our self-organizing neural network since it will grow as needed to make sure all input patterns are considered and are given the same amount of attention. Simulation results show that our algorithm significantly outperforms existing algorithms in both accuracy and reliability aspects.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><pmid>16109474</pmid><doi>10.1016/j.neunet.2005.06.007</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0893-6080
ispartof Neural networks, 2005-07, Vol.18 (5), p.835-842
issn 0893-6080
1879-2782
language eng
recordid cdi_proquest_miscellaneous_68553003
source ScienceDirect Freedom Collection 2022-2024
subjects Algorithms
Amino Acid Motifs
Amino Acid Sequence
Applied sciences
Artificial intelligence
Classification
Computer science
control theory
systems
Connectionism. Neural networks
DNA
DNA Transposable Elements
Exact sciences and technology
Gene Deletion
Molecular Sequence Data
Motif identification
Multiple sequence alignment
Neural network
Neural Networks (Computer)
Self-organization
title Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T16%3A21%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Identification%20of%20motifs%20with%20insertions%20and%20deletions%20in%20protein%20sequences%20using%20self-organizing%20neural%20networks&rft.jtitle=Neural%20networks&rft.au=Liu,%20Derong&rft.date=2005-07&rft.volume=18&rft.issue=5&rft.spage=835&rft.epage=842&rft.pages=835-842&rft.issn=0893-6080&rft.eissn=1879-2782&rft_id=info:doi/10.1016/j.neunet.2005.06.007&rft_dat=%3Cproquest_cross%3E19375835%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c421t-aa2a9fa8920314262f138f0f06d59649524b158deec95b5df353b1b25490dcef3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=19375835&rft_id=info:pmid/16109474&rfr_iscdi=true