Evidence map›Paper›PMID 28508884›Full record

ArticleNature communications2017

A hybrid cloud read aligner based on MinHash and kmer voting that preserves privacy.

Victoria Popic, Serafim Batzoglou

Abstract read
In one paragraph

Article in Nature communications, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

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

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Weighted minimizer sampling improves long read mapping.Bioinformatics (Oxford, England) · 2020
    Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. A Fast Approximate Algorithm for Mapping Long Reads to Large Reference Databases.Journal of computational biology : a journal of computational molecular cell biology · 2018
    Article
  12. Article
  13. A Secure Alignment Algorithm for Mapping Short Reads to Human Genome.Journal of computational biology : a journal of computational molecular cell biology · 2018
    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.

Victoria PopicDepartment of Computer Science, Stanford University, Stanford, California 94305, USA.
Serafim BatzoglouDepartment of Computer Science, Stanford University, Stanford, California 94305, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Low-cost clouds can alleviate the compute and storage burden of the genome sequencing data explosion. However, moving personal genome data analysis to the cloud can raise serious privacy concerns. Here, we devise a method named Balaur, a privacy preserving read mapper for hybrid clouds based on locality sensitive hashing and kmer voting. Balaur can securely outsource a substantial fraction of the computation to the public cloud, while being highly competitive in accuracy and speed with non-private state-of-the-art read aligners on short read data. We also show that the method is significantly faster than the state of the art in long read mapping. Therefore, Balaur can enable institutions handling massive genomic data sets to shift part of their analysis to the cloud without sacrificing accuracy or exposing sensitive information to an untrusted third party.

Indexed as

AlgorithmsCloud ComputingComputer SecurityPrivacyComputational BiologyGenomicsHigh-Throughput Nucleotide SequencingHumansReproducibility of Results

Identifiers

PMID28508884
PMCPMC5440850

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.