Home › Entities › academia › Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph

Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph

Research article (BMC Bioinformatics, 2015) · cited 111× · AI/ML
academia openalex:W1931027898
Press Enter · cited answer in seconds

Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph

Summary

Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph is a scholarly article[1].

Key Facts

  • Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph. Retrieved May 24, 2026, from https://4ort.xyz/entity/reference-free-compression-of-high-throughput-sequencing-data-with-a-probabilistic-de-bruijn-graph
MLA “Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/reference-free-compression-of-high-throughput-sequencing-data-with-a-probabilistic-de-bruijn-graph.
BibTeX @misc{4ortxyz_reference-free-compression-of-high-throughput-sequencing-data-with-a-probabilistic-de-bruijn-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph}}, year = {2026}, url = {https://4ort.xyz/entity/reference-free-compression-of-high-throughput-sequencing-data-with-a-probabilistic-de-bruijn-graph}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph — https://4ort.xyz/entity/reference-free-compression-of-high-throughput-sequencing-data-with-a-probabilistic-de-bruijn-graph (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/reference-free-compression-of-high-throughput-sequencing-data-with-a-probabilistic-de-bruijn-graph · Last refreshed: