Evidence map›Paper›PMID 27639380›Full record

ArticleBMC bioinformatics2016

Structural alignment of protein descriptors - a combinatorial model.

Maciej Antczak, Marta Kasprzak, Piotr Lukasiak, Jacek Blazewicz

Abstract read
In one paragraph

Article in BMC bioinformatics, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Maciej AntczakInstitute of Computing Science, Poznan University of Technology, Piotrowo 2, Poznan, 60-965, Poland. maciej.antczak@cs.put.poznan.pl.ORCID http://orcid.org/0000-0002-5320-2023
Marta KasprzakInstitute of Computing Science, Poznan University of Technology, Piotrowo 2, Poznan, 60-965, Poland.
Piotr LukasiakInstitute of Computing Science, Poznan University of Technology, Piotrowo 2, Poznan, 60-965, Poland.
Jacek BlazewiczInstitute of Computing Science, Poznan University of Technology, Piotrowo 2, Poznan, 60-965, Poland.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundStructural alignment of proteins is one of the most challenging problems in molecular biology. The tertiary structure of a protein strictly correlates with its function and computationally predicted structures are nowadays a main premise for understanding the latter. However, computationally derived 3D models often exhibit deviations from the native structure. A way to confirm a model is a comparison with other structures. The structural alignment of a pair of proteins can be defined with the use of a concept of protein descriptors. The protein descriptors are local substructures of protein molecules, which allow us to divide the original problem into a set of subproblems and, consequently, to propose a more efficient algorithmic solution. In the literature, one can find many applications of the descriptors concept that prove its usefulness for insight into protein 3D structures, but the proposed approaches are presented rather from the biological perspective than from the computational or algorithmic point of view. Efficient algorithms for identification and structural comparison of descriptors can become crucial components of methods for structural quality assessment as well as tertiary structure prediction.

resultsIn this paper, we propose a new combinatorial model and new polynomial-time algorithms for the structural alignment of descriptors. The model is based on the maximum-size assignment problem, which we define here and prove that it can be solved in polynomial time. We demonstrate suitability of this approach by comparison with an exact backtracking algorithm. Besides a simplification coming from the combinatorial modeling, both on the conceptual and complexity level, we gain with this approach high quality of obtained results, in terms of 3D alignment accuracy and processing efficiency.

conclusionsAll the proposed algorithms were developed and integrated in a computationally efficient tool descs-standalone, which allows the user to identify and structurally compare descriptors of biological molecules, such as proteins and RNAs. Both PDB (Protein Data Bank) and mmCIF (macromolecular Crystallographic Information File) formats are supported. The proposed tool is available as an open source project stored on GitHub ( https://github.com/mantczak/descs-standalone ).

Indexed as

AlgorithmsAmino Acid SequenceDatabases, ProteinModels, MolecularProteinsSequence AlignmentTime FactorsProteinsCombinatorial optimizationProtein structureStructural comparison

Identifiers

PMID27639380
PMCPMC5027075

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.