Journal Article

Contact‐based sequence alignment

Jens Kleinjung, John Romein, Kuang Lin and Jaap Heringa

in Nucleic Acids Research

Volume 32, issue 8, pages 2464-2473
Published in print April 2004 | ISSN: 0305-1048
Published online April 2004 | e-ISSN: 1362-4962 | DOI:
Contact‐based sequence alignment

More Like This

Show all results sharing this subject:

  • Bioinformatics and Computational Biology


Show Summary Details


This paper introduces the novel method of contact‐based protein sequence alignment, where structural information in the form of contact mutation probabilities is incorporated into an alignment routine using contact‐mutation matrices (CAO: Contact Accepted mutatiOn). The contact‐based alignment routine optimizes the score of matched contacts, which involves four (two per contact) instead of two residues per match in pairwise alignments. The first contact refers to a real side‐chain contact in a template sequence with known structure, and the second contact is the equivalent putative contact of a homologous query sequence with unknown structure. An algorithm has been devised to perform a pairwise sequence alignment based on contact information. The contact scores were combined with PAM‐type (Point Accepted Mutation) substitution scores after parameterization of gap penalties and score weights by means of a genetic algorithm. We show that owing to the structural information contained in the CAO matrices, significantly improved alignments of distantly related sequences can be obtained. This has allowed us to annotate eight putative Drosophila IGF sequences. Contact‐based sequence alignment should therefore prove useful in comparative modelling and fold recognition.

Journal Article.  5535 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. subscribe or login to access all content.