Unknown

Dataset Information

0

Proteins comparison through probabilistic optimal structure local alignment.


ABSTRACT: Multiple local structure comparison helps to identify common structural motifs or conserved binding sites in 3D structures in distantly related proteins. Since there is no best way to compare structures and evaluate the alignment, a wide variety of techniques and different similarity scoring schemes have been proposed. Existing algorithms usually compute the best superposition of two structures or attempt to solve it as an optimization problem in a simpler setting (e.g., considering contact maps or distance matrices). Here, we present PROPOSAL (PROteins comparison through Probabilistic Optimal Structure local ALignment), a stochastic algorithm based on iterative sampling for multiple local alignment of protein structures. Our method can efficiently find conserved motifs across a set of protein structures. Only the distances between all pairs of residues in the structures are computed. To show the accuracy and the effectiveness of PROPOSAL we tested it on a few families of protein structures. We also compared PROPOSAL with two state-of-the-art tools for pairwise local alignment on a dataset of manually annotated motifs. PROPOSAL is available as a Java 2D standalone application or a command line program at http://ferrolab.dmi.unict.it/proposal/proposal.html.

SUBMITTER: Micale G 

PROVIDER: S-EPMC4151033 | biostudies-literature | 2014

REPOSITORIES: biostudies-literature

altmetric image

Publications

Proteins comparison through probabilistic optimal structure local alignment.

Micale Giovanni G   Pulvirenti Alfredo A   Giugno Rosalba R   Ferro Alfredo A  

Frontiers in genetics 20140902


Multiple local structure comparison helps to identify common structural motifs or conserved binding sites in 3D structures in distantly related proteins. Since there is no best way to compare structures and evaluate the alignment, a wide variety of techniques and different similarity scoring schemes have been proposed. Existing algorithms usually compute the best superposition of two structures or attempt to solve it as an optimization problem in a simpler setting (e.g., considering contact maps  ...[more]

Similar Datasets

| S-EPMC2440424 | biostudies-literature
| S-EPMC2677745 | biostudies-literature
| S-EPMC1868766 | biostudies-literature
| S-EPMC3704055 | biostudies-literature
| S-EPMC2770072 | biostudies-literature
| S-EPMC1559724 | biostudies-literature
| S-EPMC2190701 | biostudies-literature
| S-EPMC4049608 | biostudies-literature
| S-EPMC3478504 | biostudies-literature
| S-EPMC2829528 | biostudies-literature