Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cannata, N.
Right arrow Articles by Valle, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Cannata, N.
Right arrow Articles by Valle, G.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 8 2002
Pages 1102-1108
© 2002 Oxford University Press

Simplifying amino acid alphabets by means of a branch and bound algorithm and substitution matrices

Nicola Cannata , Stefano Toppo , Chiara Romualdi and Giorgio Valle

CRIBI Biotechnology Centre, Universitá di Padova, via Ugo Bassi 58/B, 35131 Padova, Italy

Received on September 6, 2001 ; revised on January 8, 2002 ; accepted on

Motivation: Protein and DNA are generally represented by sequences of letters. In a number of circumstances simplified alphabets (where one or more letters would be represented by the same symbol) have proved their potential utility in several fields of bioinformatics including searching for patterns occurring at an unexpected rate, studying protein folding and finding consensus sequences in multiple alignments. The main issue addressed in this paper is the possibility of finding a general approach that would allow an exhaustive analysis of all the possible simplified alphabets, using substitution matrices like PAM and BLOSUM as a measure for scoring.

Results: The computational approach presented in this paper has led to a computer program called AlphaSimp (Alphabet Simplifier) that can perform an exhaustive analysis of the possible simplified amino acid alphabets, using a branch and bound algorithm together with standard or user-defined substitution matrices. The program returns a ranked list of the highest-scoring simplified alphabets. When the extent of the simplification is limited and the simplified alphabets are maintained above ten symbols the program is able to complete the analysis in minutes or even seconds on a personal computer. However, the performance becomes worse, taking up to several hours, for highly simplified alphabets.

Availability: AlphaSimp and other accessory programs are available at http://bioinformatics.cribi.unipd.it/alphasimp

Contact: giorgio.valle{at}unipd.it


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
M. N. Davies, A. Secker, A. A. Freitas, E. Clark, J. Timmis, and D. R. Flower
Optimizing amino acid groupings for GPCR classification
Bioinformatics, September 15, 2008; 24(18): 1980 - 1986.
[Abstract] [Full Text] [PDF]

Home page
 Mol Biol EvolHome page
E. Susko and A. J. Roger
On Reduced Amino Acid Alphabets for Phylogenetic Inference
Mol. Biol. Evol., September 1, 2007; 24(9): 2139 - 2150.
[Abstract] [Full Text] [PDF]

Home page
 Protein Eng Des SelHome page
T. Li, K. Fan, J. Wang, and W. Wang
Reduction of protein sequence complexity by residue grouping
Protein Eng. Des. Sel., May 1, 2003; 16(5): 323 - 330.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.