Skip Navigation

This Article
Right arrow Full Text (Print 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Santibánez, M.
Right arrow Articles by Rohde, K.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Santibánez, M.
Right arrow Articles by Rohde, K.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 1987 IRL Press Ltd.

A multiple alignment program for protein sequences

M. Santibánez and K. Rohde *

Department of Biomathematics, Central Institute of Molecular Biology of the Academy of Sciences of the GDR Robert Roessle-Str. 10, 1115 Berlin-Buck, GDR

*To whom reprint requests should be sent.

A program for the multiple alignment of protein sequences is presented. The program is an extension of the fast alignment program by Wilbur et al. (1984) into higher dimensions. The use of hash procedures on fragments of the protein sequences increases the speed of calculation. Thereby we also take into account fragments which are present in some, but not in all, sequences considered. The results of some multiple alignments are given.

Received on September 11, 1986; accepted on March 18, 1987

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
 Protein Eng Des SelHome page
L. R. Murphy, A. Wallqvist, and R. M. Levy
Simplified amino acid alphabets for protein fold recognition and implications for folding
Protein Eng. Des. Sel., March 1, 2000; 13(3): 149 - 152.
[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.