SANA: an algorithm for sequential and non-sequential protein structure alignment

@article{Wang2009SANAAA,
  title={SANA: an algorithm for sequential and non-sequential protein structure alignment},
  author={Lin Wang and Ling-Yun Wu and Yong Wang and Xiang-Sun Zhang and Luonan Chen},
  journal={Amino Acids},
  year={2009},
  volume={39},
  pages={417-425}
}
Protein structure alignment algorithms play an important role in the studies of protein structure and function. In this paper, a novel approach for structure alignment is presented. Specifically, core regions in two protein structures are first aligned by identifying connected components in a network of neighboring geometrically compatible aligned fragment pairs. The initial alignments then are refined through a multi-objective optimization method. The algorithm can produce both sequential and… 
Using predicted shape string to enhance the accuracy of γ-turn prediction
TLDR
The results indicate that the protein shape string is useful for predicting protein tight turns and it is reasonable to use the dihedral angle information as a variable for machine learning to predict protein folding.
A Circuit Topology Approach to Categorizing Changes in Biomolecular Structure
TLDR
This work translates familiar molecular operations in biology, such as duplication, permutation, and elimination of contacts, into the language of circuit topology and shows that for such operations there are corresponding matrix representations as well as basic rules that serve as a foundation for understanding these operations within the context of a coherent algebraic framework.
Knowledge derivation and data mining strategies for probabilistic functional integrated networks
TLDR
One of the most powerful integration techniques, probabilistic functional integrated networks (PFINs), is extended to incorporate a concept of biological relevance, which significantly reduces the hypothesis space for experimental validation of genes hypothesised to be involved in the oxidative stress response.
Circular Permutation in Proteins
TLDR
This work was supported by the RCSB PDB grant NSF DBI 0829586 and the funders had no role in the preparation of the manuscript.
Similarités et divergences, globales et locales entre structures protéiques. (Global and Local Similarities and Divergences of Protein Structures )
TLDR
Une methode de modelisation de comparaisons de proteines au sein of graphes dont le parcours permet d’extraire les differentes sous-structures similaires islamique, repose sur des notions de compatibilites entre elements des structures ainsi que des criteres de distances ent between elements.

References

SHOWING 1-10 OF 20 REFERENCES
Protein structure alignment by incremental combinatorial extension (CE) of the optimal path.
A new algorithm is reported which builds an alignment between two protein structures. The algorithm involves a combinatorial extension (CE) of an alignment path defined by aligned fragment pairs
Protein structure comparison by alignment of distance matrices.
TLDR
A novel algorithm (DALI) for optimal pairwise alignment of protein structures that identifies structural resemblances and common structural cores accurately and sensitively, even in the presence of geometrical distortions is developed.
Comparison of protein structures by growing neighborhood alignments
TLDR
A protein structure comparison scheme, which is capable of detecting correct alignments even in difficult cases, e.g. non-topological similarities, is described and two algorithms arising out of the scheme, resulting in two algorithms, have been developed, implemented and tested.
Matalign: Precise Protein Structure Comparison by Matrix Alignment
TLDR
On the benchmark set of 68 protein structure pairs by Fischer et al., MatAlign provides better alignment results, according to four different criteria, than both DALI and CE in a majority of cases.
Revealing divergent evolution, identifying circular permutations and detecting active-sites by protein structure comparison
TLDR
A novel formulation is proposed to accurately align protein structures in the framework of multi-objective optimization, based on a sequence order-independent strategy and a fast and accurate algorithm based on the bipartite matching algorithm is developed by exploiting the special features.
A method for simultaneous alignment of multiple protein structures
TLDR
It is their residue sequence order‐independence that allows application of MultiProt to derive multiple alignments of binding sites and of protein‐protein interfaces, making MultiProt an extremely useful structural tool.
Vorolign - fast structural alignment using Voronoi contacts
TLDR
The performance of Vorolign in calculating pair wise and multiple alignments is found to be comparable with other pairwise and multiple protein structure alignment methods.
Comparative Analysis of Protein Structure Alignments
TLDR
The alignments produced by different methods tend to agree to a considerable extent, but the agreement is lower for the more challenging pairs, and the results for the comparison to reference alignments are encouraging, but indicate that there is still room for improvement.
Secondary-structure matching (SSM), a new tool for fast protein structure alignment in three dimensions.
The present paper describes the SSM algorithm of protein structure comparison in three dimensions, which includes an original procedure of matching graphs built on the protein's secondary-structure
Matt: Local Flexibility Aids Protein Multiple Structure Alignment
TLDR
This work introduces the program Matt (Multiple Alignment with Translations and Twists), an aligned fragment pair chaining algorithm that, in intermediate steps, allows local flexibility between fragments: small translations and rotations are temporarily allowed to bring sets of aligned fragments closer, even if they are physically impossible under rigid body transformations.
...
...