Journal Article

Optimizing amino acid groupings for GPCR classification

Matthew N. Davies, Andrew Secker, Alex A. Freitas, Edward Clark, Jon Timmis and Darren R. Flower

in Bioinformatics

Volume 24, issue 18, pages 1980-1986
Published in print September 2008 | ISSN: 1367-4803
Published online August 2008 | e-ISSN: 1460-2059 | DOI: http://dx.doi.org/10.1093/bioinformatics/btn382
Optimizing amino acid groupings for GPCR classification

More Like This

Show all results sharing this subject:

  • Bioinformatics and Computational Biology

GO

Show Summary Details

Preview

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

Journal Article.  4782 words.  Illustrated.

Subjects: Bioinformatics and Computational Biology

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.