Evidence map›Paper›PMID 37120614›Full record

ArticleScientific reports2023

Content-based filter queries on DNA data storage systems.

Alex El-Shaikh, Bernhard Seeger

Abstract read
In one paragraph

Article in Scientific reports, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

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

2 citing papers in PubMed.

  1. DNA storage: The future direction for medical cold data storage.Synthetic and systems biotechnology · 2025
    Review
  2. Optimizing fountain codes for DNA data storage.Computational and structural biotechnology journal · 2024
    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.

Alex El-ShaikhDepartement of Mathematics and Computer Science, University of Marburg, 35037, Marburg, Germany. elshaika@mathematik.uni-marburg.de.
Bernhard SeegerDepartement of Mathematics and Computer Science, University of Marburg, 35037, Marburg, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Recent developments in DNA data storage systems have revealed the great potential to store large amounts of data at a very high density with extremely long persistence and low cost. However, despite recent contributions to robust data encoding, current DNA storage systems offer limited support for random access on DNA storage devices due to restrictive biochemical constraints. Moreover, state-of-the-art approaches do not support content-based filter queries on DNA storage. This paper introduces the first encoding for DNA that enables content-based searches on structured data like relational database tables. We provide the details of the methods for coding and decoding millions of directly accessible data objects on DNA. We evaluate the derived codes on real data sets and verify their robustness.

Indexed as

DNAInformation Storage and RetrievalDatabases, FactualDNA

Identifiers

PMID37120614
PMCPMC10148835

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.