arXiv (All)
open access
Correcting Burst Errors with Applications to DNA-Based Data Storage
We introduce the problem of permutation burst error-correction, motivated by applications in molecular data storage with nanopore sequencing read platforms. A permutation burst of length $k$ is an error that affects a substring of length $k$ of a string of length $n$ by permuting its entries. Permut
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#986200
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#1079303
- IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System#1257937
- IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System#1248041
- Redundant mispair excision mechanisms in eukaryotic DNA mismatch repair#1263666
Record · ID 1326951
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive