EUVIMEDEUVIMED entdecken
ÜbersichtsarbeitOpen Access

Building genomic data structures from compressed representations using prefix-free parsing

Rahul Varki iD, Christina Boucher iD

Genome Research · 2026-06 · 36 (6) · 1081-1093

DOI: 10.1101/gr.281245.125 ↗

Kurz gefasst

Übersichtsarbeit in der Zeitschrift Genome Research, online erschienen am 15.05.2026. Verfasst von Rahul Varki und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer and Information Science and Engineering, Herbert Wertheim College of Engineering, University of Florida, Gainesville, Florida …. Hauptthemen laut MEDLINE: Computational Biology, Data Compression, Genomics. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 68 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar. Gefördert von: NHGRI NIH HHS.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Advances in high-throughput sequencing have lowered the cost and complexity of genome sequencing, making it possible for the first time to assemble large pangenomic data sets for many species. These data sets, comprising thousands of individuals, already span from hundreds of gigabytes to petabytes, far exceeding the memory capacity of most machines, and are expected to continue growing in scale over time. Already, many traditional bioinformatics tools fail on inputs at this scale because they cannot construct their necessary data structures within memory limits. There is a growing need for methods that can construct these structures directly from compressed representations. Prefix-free parsing (PFP) addresses this challenge. PFP serves as a preprocessing step that compresses sufficiently repetitive text, yet still permits building important data structures for the original data set from its compressed output. This survey offers an overview of PFP, covering its core principles, the primary data structures it enables, current applications, and future research directions.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Computational BiologyData CompressionGenomicsAnimalsHumansCompression AlgorithmsHigh-Throughput Nucleotide SequencingSoftware

Autor:innen und Institutionen

  • Department of Computer and Information Science and Engineering, Herbert Wertheim College of Engineering, University of Florida, Gainesville, Florida 32611, USA rvarki@ufl.edu.
  • Department of Computer and Information Science and Engineering, Herbert Wertheim College of Engineering, University of Florida, Gainesville, Florida 32611, USA.

ORCID-Profile: Rahul Varki, Christina Boucher

Förderung

  • NHGRI NIH HHS

Zitieren

APA

Varki, R., & Boucher, C. (2026). Building genomic data structures from compressed representations using prefix-free parsing. Genome Research, 36(6), 1081-1093. https://doi.org/10.1101/gr.281245.125

Vancouver

Varki R, Boucher C. Building genomic data structures from compressed representations using prefix-free parsing. Genome Research. 2026;36(6):1081-1093. doi:10.1101/gr.281245.125

BibTeX
@article{Varki2026,
  author = {Varki, Rahul and Boucher, Christina},
  title = {Building genomic data structures from compressed representations using prefix-free parsing},
  journal = {Genome Research},
  year = {2026},
  volume = {36},
  number = {6},
  pages = {1081--1093},
  doi = {10.1101/gr.281245.125}
}
Kostenlos starten →