Classification of GPCRs Using Family Specific Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
PRIB'12 Proceedings of the 7th IAPR international conference on Pattern Recognition in Bioinformatics
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
| Hi-index | 3.84 |
Motivation: There is much interest in reducing the complexity inherent in the representation of the 20 standard amino acids within bioinformatics algorithms by developing a so-called reduced alphabet. Although there is no universally applicable residue grouping, there are numerous physiochemical criteria upon which one can base groupings. Local descriptors are a form of alignment-free analysis, the efficiency of which is dependent upon the correct selection of amino acid groupings. Results: Within the context of G-protein coupled receptor (GPCR) classification, an optimization algorithm was developed, which was able to identify the most efficient grouping when used to generate local descriptors. The algorithm was inspired by the relatively new computational intelligence paradigm of artificial immune systems. A number of amino acid groupings produced by this algorithm were evaluated with respect to their ability to generate local descriptors capable of providing an accurate classification algorithm for GPCRs. Contact: m.davies@mail.cryst.bbk.ac.uk