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 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.
Liu
Derong
D
Department of Electrical and Computer Engineering, University of Illinois, Chicago, IL 60607, USA. dliu@ece.uic.edu
Xiong
Xiaoxu
X
Hou
Zeng-Guang
ZG
Dasgupta
Bhaskar
B
D000465:Algorithms; D020816:Amino Acid Motifs; D000595:Amino Acid Sequence; D002965:Classification; D004251:DNA Transposable Elements; D017353:Gene Deletion; D008969:Molecular Sequence Data; D016571:Neural Networks, Computer
D004251:DNA Transposable Elements