CoChat

Efficient Reconstruction of Sequences from Their Subsequences or Supersequences

Open access
Levenshtein, Vladimir I. · 2001 · Journal of Combinatorial Theory, Series A
Cited by 191

The DOI matches its Crossref record.

Abstract

In the paper two combinatorial problems for the set Fnq of sequences of length n over the alphabet Fq={0, 1, ?, q?1} are considered. The maximum size N?q(n, t) of the set of common subsequences of length n?t and the maximum size N+q(n, t) of the set of common supersequences of length n+t of two different sequences of Fnq are found for any nonnegative integers n and t. The number N?q(n, t)+1 (respectively, N+q(n, t)+1) is equal to the minimum number N of different subsequences of length n?t (supersequences of length n+t) of an unknown sequence X?Fnq which are sufficient for its reconstruction. Simple algorithms to recover X?Fnq from N?q(n, t)+1 of its subsequences of length n?t and from N+q(n, t)+1 of its supersequences of length n+t are given.

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.1006/jcta.2000.3081

Cites

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

Cited by

See all 191

Metadata

Authors
Levenshtein, V. I.
Venue
Journal of Combinatorial Theory, Series A
Publisher
Elsevier BV
Published
2001-02
Volume
93
Issue
2
Pages
310-332
ISSN
0097-3165 (ISSN-L)
OpenAlex
W1969151232
Cited by
191
References
0
FWCI
1.50
Type
journal article
Language
en
Open access
bronze

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. https://app.cochat.ai/papers/10.1006/jcta.2000.3081
The paper
Levenshtein, V. I. (2001). Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. Journal of Combinatorial Theory, Series A. https://doi.org/10.1006/jcta.2000.3081

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.