DSpace at IIT Bombay >
IITB Publications >
Please use this identifier to cite or link to this item:
|Title: ||An alignment-free method for classification of protein sequences|
|Authors: ||DESHMUKH, S|
|Keywords: ||hidden markov-models|
support vector machines
|Issue Date: ||2007|
|Publisher: ||BENTHAM SCIENCE PUBL LTD|
|Citation: ||PROTEIN AND PEPTIDE LETTERS, 14(7), 647-657|
|Abstract: ||Protein sequences vary in their length and are not readily amenable to conventional data mining techniques that need mapping in a fixed dimensional space. Thus, majority of the current methods for protein sequence classification are based on alignment of the query sequence either with a sequence or a pro. le of the sequence family. We present a method for mapping of protein sequences in a fixed dimensional descriptor space. The descriptors such as amino acid content and amino acid pair association rules were used along with routinely available classification methods. An experiment on one hundred Pfam families showed classification accuracy of 98% with support vector machines classifier. Information gain based feature selection helped simplify the model and improve accuracy. Interestingly, a large number of the selected features were based on the association rules of Glycine or Aspartic acid residues suggesting their role in the conserved loops among evolutionarily related proteins. Further, in another experiment, the approach was tested for classification of proteins from 39 Pfam families of protein kinases. Support vector machines classifier provided an accuracy of approximately 96%. The method provides an alternative to conventional pro. le based methods for protein sequence classification.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.