4.7 Article

Optimizing amino acid groupings for GPCR classification

Journal

BIOINFORMATICS
Volume 24, Issue 18, Pages 1980-1986

Publisher

OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btn382

Keywords

-

Funding

  1. ESPRC [EP/D501377/1]
  2. Engineering and Physical Sciences Research Council [EP/D501377/1] Funding Source: researchfish
  3. EPSRC [EP/D501377/1] Funding Source: UKRI

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available