Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 616

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

The Complexity of Some Problems on Subsequences and Supersequences

Open access
Maier, David·1978·Journal of the ACM

Abstract

The complexity of finding the Longest Common Subsequence (LCS) and the Shortest Common Supersequence (SCS) of an arbRrary number of sequences IS considered We show that the yes/no version of the LCS problem is NP-complete for sequences over an alphabet of size 2, and that the yes/no SCS problem is NPcomplete for sequences over an alphabet of size 5 KEY WORDS AND PHRASES computational complexity, NP-completeness, longest common subsequence, shortest common supersequence CR CATEGORIES 5 23, 5 39 DefinitionsGiven a finite sequence S = sl, s2, ..., sin, we define a subsequence S' of S to be any sequence which consists of S with between 0 and m terms deleted (e.g.ac, ad, and abcd are all subsequences of abcd).We write S' < S if S' is a subsequence of S. We also say that S is a supersequence of S', and write S > S'.Given a set R = {$1, $2 ..... Sp} of sequences, we speak of a Longest Common Subsequence of R, LCS(R), as a longest sequence S such that S < S, for i = 1 ..... p.For example, abe = LCS((ababe, cabe, abdde} ).Actually, LCS(R) is a set of subsequences, since there may be more than one sequence fitting the definition.Since we will be mamly concerned with the length of any (and every) LCS(R), when we write LCS(R) we will mean a single representaUve of this set.Simdarly, a Shortest Common Supersequence of R, SCS(R), is a shortest sequence S' such that S' > S,, I = 1 ..... p.For example, SCS({abbb, bab, bba} ) = abbab.The yes~no LCS (SCS)problem is: Given an integer k and a listing of the sequences in R, is ILCS(R)[ --> k (ISCS(R)I .~k), where IsI is the number of terms in sequence S?Whenever we refer to the LCS and SCS problems in this paper, we will mean the yes/no versions.We define the alphabet of R, X(R), to be the finite set of values the terms of sequences S1, $2 ..... Sp take on.Clearly IX(R) I -< ml + m2 + + rap, where m, = [ S,I.We also use I I to denote the cardinality of a set; the context will distinguish the usage. Threading SchemesIt is convenient to think of the LCS and SCS problems in terms of threading beads.We think of a sequence as a row of beads and the matching process as threading the beads m a certain manner.Suppose we have three sequences $1 = bybrr, $2 --yyrrbr, and $3 = byrry.We represent them as rows of beads:General permission to make fair use in teaching or research of all or part of this material is granted to individual readers and to nonprofit hbrarles acting for them provided that ACM's copyright noUce is given and that reference is made to the pubhcatlon, to ItS date of msue, and to the fact that reprinting prlwleges were granted by permission of the Association for Computing Machinery To otherwise reprint a figure, table, other substantial excerpt, or the entire work requires specific permission as does repubhcatlon, or systematic or muluple reproduction

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1145/322063.322075

Cites

14 of 14 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 14 references

Cited by

See all 616

Metadata

Authors
Maier, D.
Venue
Journal of the ACM
Published
1978-04
Volume
25
Issue
2
Pages
322-336
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W2040176884
Cited by
616
References
14
FWCI
2.60
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: The Complexity of Some Problems on Subsequences and Supersequences. https://app.cochat.ai/papers/10.1145/322063.322075
The paper
Maier, D. (1978). The Complexity of Some Problems on Subsequences and Supersequences. Journal of the ACM. https://doi.org/10.1145/322063.322075

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.