Evidence map›Paper›PMID 22962464›Full record

ArticleBioinformatics (Oxford, England)2012

SANS: high-throughput retrieval of protein sequences allowing 50% mismatches.

J Patrik Koskinen, Liisa Holm

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

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

10 citing papers in PubMed.

  1. Article
  2. Osmoprotectants play a major role in theFrontiers in plant science · 2023
    Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Lambda: the local aligner for massive biological data.Bioinformatics (Oxford, England) · 2014
    Article
  9. A fast Peptide Match service for UniProt Knowledgebase.Bioinformatics (Oxford, England) · 2013
    Article
  10. 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

2 authors.

J Patrik KoskinenDepartment of Biosciences, Division of Genetics. University of Helsinki, 00014 Helsinki, Finland.
Liisa Holm

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationThe genomic era in molecular biology has brought on a rapidly widening gap between the amount of sequence data and first-hand experimental characterization of proteins. Fortunately, the theory of evolution provides a simple solution: functional and structural information can be transferred between homologous proteins. Sequence similarity searching followed by k-nearest neighbor classification is the most widely used tool to predict the function or structure of anonymous gene products that come out of genome sequencing projects.

resultsWe present a novel word filter, suffix array neighborhood search (SANS), to identify protein sequence similarities in the range of 50-100% identity with sensitivity comparable to BLAST and 10 times the speed of USEARCH. In contrast to these previous approaches, the complexity of the search is proportional only to the length of the query sequence and independent of database size, enabling fast searching and functional annotation into the future despite rapidly expanding databases. AVAILABILITY AND IMPLEMENTATION: The software is freely available to non-commercial users from our website http://ekhidna.biocenter.helsinki.fi/downloads/sans. CONTACT: liisa.holm@helsinki.fi.

Indexed as

Sequence Homology, Amino AcidAlgorithmsBacterial ProteinsDatabases, ProteinGenomeMetagenomeSequence AlignmentSequence Analysis, ProteinSoftwareBacterial Proteins

Identifiers

PMID22962464
PMCPMC3436844

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.