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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
A linear space algorithm for computing maximal common subsequences
Hirschberg, D. S. (1975) · Communications of the ACM · doi:10.1145/360825.360861 · Cited by 1,093
An Extension of the String-to-String Correction Problem
Wagner, R. A., & Lowrance, R. (1975) · Journal of the ACM · doi:10.1145/321879.321880 · Cited by 313
Matching Sequences under Deletion/Insertion Constraints
Sankoff, D. (1972) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.69.1.4 · Cited by 296
On computing the length of longest increasing subsequences
Fredman, M. L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90103-x · Cited by 248
Cited by
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
A survey of longest common subsequence algorithms
Bergroth, L., Hakonen, H., & Raita, T. (2002) · Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000 · doi:10.1109/spire.2000.878178 · Cited by 655
Data compression via textual substitution
Storer, J. A., & Szymanski, T. G. (1982) · Journal of the ACM · doi:10.1145/322344.322346 · Cited by 634
Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
Rigoutsos, I., & Floratos, A. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.1.55 · Cited by 557
Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
Akutsu, T. (2000) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(00)00186-4 · Cited by 297
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.