TITLE

Prediction of hydrophobic regions effectively in transmembrane proteins using digital filter

AUTHOR(S)
Meher, Jayakishan; Raval, Mukesh Kumar; Dash, Gananath; Meher, Pramod Kumar
PUB. DATE
August 2011
SOURCE
Journal of Biomedical Science & Engineering;Aug2011, Vol. 4 Issue 8, p562
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The hydrophobic effect is the major factor that drives a protein molecule towards folding and to a great degree the stability of protein structures. Therefore the knowledge of hydrophobic regions and its prediction is of great help in understanding the structure and function of the protein. Hence determination of membrane buried region is a computationally intensive task in bioinformatics. Several prediction methods have been reported but there are some deficiencies in prediction accuracy and adaptability of these methods. Of these proteins that are found embedded in cellular membranes, called as membrane proteins, are of particular importance because they form targets for over 60% of drugs on the market. 20% - 30% of all the proteins in any organism are membrane proteins. Thus transmembrane protein plays important role in the life activity of the cells. Hence prediction of membrane buried segments in transmembrane proteins is of particular importance. In this paper we have proposed signal processing algorithms based on digital filter for prediction of hydrophobic regions in the transmembrane proteins and found improved prediction efficiency than the existing methods. Hydrophobic regions are extracted by assigning physico-chemical parameter such as hydrophobicity and hydration energy index to each amino acid residue and the resulting numerical representation of the protein is subjected to digital low pass filter. The proposed method is validated on transmembrane proteins using Orientation of Proteins in Membranes (OPM) dataset with various prediction measures and found better prediction accuracy than the existing methods.
ACCESSION #
67714426

 

Related Articles

  • Hybrid Method Using Wavelets and Predictive Method for Compression of Speech Signal. Aoubid, Karima Siham; Boulemden, Mohamed // Proceedings of World Academy of Science: Engineering & Technolog;Jun2008, Vol. 42, p150 

    The development of the signal compression algorithms is having compressive progress. These algorithms are continuously improved by new tools and aim to reduce, an average, the number of bits necessary to the signal representation by means of minimizing the reconstruction error. The following...

  • Image Denoising based on Spatial/Wavelet Filter using Hybrid Thresholding Function. Hussain, Sabahaldin A.; Gorashi, Sami M. // International Journal of Computer Applications;Mar2012, Vol. 42, p5 

    In this paper a hybrid denoising algorithm which combines spatial domain bilateral filter and hybrid thresholding function in the wavelet domain is proposed. The wavelet transform is used to decompose the noisy image into its different subbands namely LL, LH, HL, and HH. A two stage spatial...

  • Image De-noising using Contoulets (A Comparative Study with Wavelets). Singh, Abhay P.; Mishra, Abhinav; Khare, Ashish // International Journal of Advanced Networking & Applications;Nov/Dec2011, Vol. 3 Issue 3, p1210 

    Although the wavelet transform is powerful in representing images containing smooth areas separated with edges, it cannot perform well when the edges are smooth curves. Wavelets are less effective for images where singularities are located both in space and directions. The contourlet transform...

  • A Novel Markov Pairwise Protein Sequence Alignment Method for Sequence 665 Comparison. Xing-Ming Zhao; Yiu-Ming Cheung; De-Shuang Huang // Protein & Peptide Letters;Oct2005, Vol. 12 Issue 7, p665 

    The Smith-Waterman (SW) algorithm is a typical technique for local sequence alignment in computational biology. However, the SW algorithm does not consider the local behaviours of the amino acids, which may result in loss of some useful information. Inspired by the success of Markov Edit...

  • Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments. Sierk, Michael L.; Smoot, Michael E.; Bass, Ellen J.; Pearson, William R. // BMC Bioinformatics;2010, Vol. 11, p146 

    Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor and a similar structure; pairwise sequence alignments often fail to represent accurately the structural alignments...

  • Classification of protein sequences by means of irredundant patterns. Comin, Matteo; Verzotto, Davide // BMC Bioinformatics;2010 Supplement 1, Vol. 11, Special section p1 

    Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of different patterns, have been previously proposed. Almost all string-based approaches discover patterns that are not...

  • Support Vector Machines for predicting protein structural class. Yu-Dong Cai; Xiao-Jun Liu; Xue-biao Xu; Guo-Ping Zhou // BMC Bioinformatics;2001, Vol. 2, p3 

    Background: We apply a new machine learning method, the so-called Support Vector Machine method, to predict the protein structural class. Support Vector Machine method is performed based on the database derived from SCOP, in which protein domains are classified based on known structures and the...

  • DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. Subramanian, Amarendran R.; Weyer-Menkhoff, Jan; l Kaufmann, Michae; Morgenstern, Burkhard // BMC Bioinformatics;2005, Vol. 6, p66 

    Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous version 2.2 of DIALIGN. This previous version is superior to Needleman-Wunsch-based multi-alignment programs on locally...

  • Combination of scoring schemes for protein docking. Heuser, Philipp; Schomburg, Dietmar // BMC Bioinformatics;2007, Vol. 8, p279 

    Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist of a sampling step followed by a scoring step. We developed a weighted geometric correlation based on optimised atom...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics