Evidence map›Paper›PMID 20813068›Full record

ArticleBMC bioinformatics2010

Fast and accurate protein substructure searching with simulated annealing and GPUs.

Alex D Stivala, Peter J Stuckey, Anthony I Wirth

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
14citing 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

14 citing papers in PubMed.

  1. Article
  2. Bayesian Optimization for State and Parameter Estimation of Dynamic Networks with Binary Space.Control Technology and Applications. Control Technology and Applications · 2024
    Article
  3. Article
  4. Article
  5. Article
  6. Review
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. 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

3 authors.

Alex D StivalaDepartment of Computer Science and Software Engineering, The University of Melbourne, Victoria 3010, Australia. a.stivala@pgrad.unimelb.edu.au
Peter J Stuckey
Anthony I Wirth

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundSearching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioinformatics. While there are many existing methods for structural similarity searching, faster and more accurate approaches are still required, and few current methods are capable of substructure (motif) searching.

resultsWe developed an improved heuristic for tableau-based protein structure and substructure searching using simulated annealing, that is as fast or faster and comparable in accuracy, with some widely used existing methods. Furthermore, we created a parallel implementation on a modern graphics processing unit (GPU).

conclusionsThe GPU implementation achieves up to 34 times speedup over the CPU implementation of tableau-based structure search with simulated annealing, making it one of the fastest available methods. To the best of our knowledge, this is the first application of a GPU to the protein structural search problem.

Indexed as

Computer SimulationComputer GraphicsDatabases, ProteinProteinsProtein Structure, TertiaryProteins

Identifiers

PMID20813068
PMCPMC2944279

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.