CoChat

Exact Reconstruction From Insertions in Synchronization Codes

Open access
Sala, Frederic, Gabrys, Ryan, Schoeny, Clayton, Dolecek, Lara · 2017 · IEEE Transactions on Information Theory
Cited by 92

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

This paper studies problems in data reconstruction, an important area with numerous applications. In particular, we examine the reconstruction of binary and nonbinary sequences from synchronization (insertion/deletion-correcting) codes. These sequences have been corrupted by a fixed number of symbol insertions (larger than the minimum edit distance of the code), yielding a number of distinct traces to be used for reconstruction. We wish to know the minimum number of traces needed for exact reconstruction. This is a general version of a problem tackled by Levenshtein for uncoded sequences. We introduce an exact formula for the maximum number of common supersequences shared by sequences at a certain edit distance, yielding an upper bound on the number of distinct traces necessary to guarantee exact reconstruction. Without specific knowledge of the code words, this upper bound is tight. We apply our results to the famous single deletion/insertion-correcting Varshamov-Tenengolts (VT) codes and show that a significant number of VT code word pairs achieve the worst case number of outputs needed for exact reconstruction. We also consider extensions to other channels, such as adversarial deletion and insertion/deletion channels and probabilistic channels.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2017.2649493

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 34

  1. 10.1109/JSAC.2008.081204 · doi:10.1109/jsac.2008.081204
  2. 10.1109/ISIT.2012.6284242 · doi:10.1109/isit.2012.6284242
  3. 10.1109/ISIT.2016.7541568 · DOI
  4. 10.1016/S0019-9958(69)90442-2 · doi:10.1016/s0019-9958(69)90442-2
  5. wilf, 1990, Generatingfunctionology
  6. 10.1109/TCOMM.2016.2552175 · doi:10.1109/tcomm.2016.2552175
  7. 10.1109/TIT.2015.2466635 · doi:10.1109/tit.2015.2466635
  8. 10.1109/TIT.2013.2290045 · doi:10.1109/tit.2013.2290045
  9. 10.1109/TIT.2015.2508800 · DOI
  10. farnoud, 2016, Estimating Mutation Rates and Sequence age Under a Stochastic Model for Tandem Duplication and Point Mutation
  11. benson, 1999, Reconstructing the duplication history of a tandem repeat, Proc Int Conf Intell Syst Molecular Biol (ISMB), 44
  12. 10.1109/ISIT.2016.7541455 · DOI
  13. 10.1109/TIT.2015.2505735 · doi:10.1109/tit.2015.2505735
  14. 10.1109/ISIT.2016.7541778 · DOI
  15. 10.1109/ISIT.2015.7282587 · DOI
  16. 10.1109/ITW.2015.7133132 · DOI
  17. levenshtein, 1966, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Phys Doklady, 10, 707
  18. 10.1109/ISIT.2005.1523342 · DOI
  19. 10.1109/TIT.2005.853300 · DOI
  20. batu, 2004, Reconstructing strings from random traces, Proc ACM-SIAM Symp Discrete Algorithms (SODA), 910
  21. holenstein, 2008, Trace reconstruction with constant deletion probability and related results, Proc ACM-SIAM Symp Discrete Algorithms (SODA), 389
  22. varshamov, 1965, Codes which correct single asymmetric errors, Avtomat i Telemeh, 26, 288
  23. viswanathan, 2008, Improved string reconstruction over insertion-deletion channels, Proc ACM-SIAM Symp Discrete Algorithms (SODA), 399
  24. 10.1109/ISIT.2015.7282947 · DOI
  25. 10.1109/ISIT.2012.6283016 · DOI
  26. 10.1006/jcta.2000.3081 · DOI · Paper page
  27. 10.1109/ISIT.2016.7541372 · doi:10.1109/isit.2016.7541372
  28. 10.1109/18.904499 · DOI · Paper page
  29. yazdi, 2015, A rewritable, random-access DNA-based storage system, Nature Sci Rep, 5, 14138, 10.1038/srep14138 · DOI · Paper page
  30. 10.1145/2872362.2872397 · DOI · Paper page
  31. 10.1109/TIT.2013.2257917 · doi:10.1109/tit.2013.2257917
  32. 10.1109/TIT.2015.2413958 · DOI
  33. 10.1109/TIT.2004.831751 · doi:10.1109/tit.2004.831751
  34. 10.1109/TIT.2016.2544348 · doi:10.1109/tit.2016.2544348

Cited by

See all 92

Metadata

Authors
Sala, F., Gabrys, R., Schoeny, C., & Dolecek, L.
Venue
IEEE Transactions on Information Theory
Published
2017-04
Volume
63
Issue
4
Pages
2428-2445
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2338754814
Cited by
92
References
2
FWCI
4.92
Type
journal article
Language
en
Open access
green
Funders
  • NSF Graduate Research Fellowship Program
  • NSF (CCF-1527130)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.