z-logo
open-access-imgOpen Access
Extracting multiple structural alignments from pairwise alignments: a comparison of a rigorous and a heuristic approach
Author(s) -
Erik Sandelin
Publication year - 2004
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/bti117
Subject(s) - pairwise comparison , heuristic , computer science , integer programming , equivalence (formal languages) , multiple sequence alignment , algorithm , set (abstract data type) , linear programming , sequence alignment , mathematics , theoretical computer science , discrete mathematics , artificial intelligence , biology , peptide sequence , biochemistry , gene , programming language
Multiple structural alignments (MSTAs) provide position-specific information on the sequence variability allowed by protein folds. This information can be exploited to better understand the evolution of proteins and the physical chemistry of polypeptide folding. Most MSTA methods rely on a pre-computed library of pairwise alignments. This library will in general contain conflicting residue equivalences not all of which can be realized in the final MSTA. Hence to build a consistent MSTA, these methods have to select a conflict-free subset of equivalences.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom