Finding short structural motifs for re-construction of proteins 3D structure

Authors:
Nikhil R. Pal;Rupan Panja
Affiliations:
Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700 108, India and Computer Science and Engineering Department, Dr. Sudhir Chandra Sur Degree Eng ...;Electronics and Communication Sciences Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700 108, India and Computer Science and Engineering Department, Dr. Sudhir Chandra Sur Degree Eng ...
Venue:
Applied Soft Computing
Year:
2013

Citing 5
Cited 0

Topology representing networks

Neural Networks
On the relationship between sequence and structure similarities in proteomics

Bioinformatics
Recognition of structure classification of protein folding by NN and SVM hierarchical learning architecture

ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Some new features for protein fold prediction

ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
`Neural-gas' network for vector quantization and its application to time-series prediction

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

With a view to find useful building blocks (short structural motifs) for reconstruction of 3D structure of proteins, we propose a modified neural gas learning algorithm that we call structural neural gas (SNG) algorithm. The SNG is applied on a benchmark protein data set and its performance is compared with a well known algorithm from the literature (two stage clustering algorithm (TSCA)). The SNG algorithm is found to generate better building blocks compared to TSCA. We have also compared the performance of SNG algorithm with that of a recently reported Incremental Structural Mountain Clustering Method (ISMCM). In general, ISMCM is found to use more building blocks to yield results comparable to that of SNG algorithm. We demonstrate the superiority of SNG over TSCA both in terms of local-fit and global-fit errors using fragments of length five, six, and seven. We also use a graphical means for comparison of the performance of the two algorithms.