More on the complexity of common superstring and supersequence problems
- 28 March 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 125 (2), 205-228
- https://doi.org/10.1016/0304-3975(92)00074-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Complexity of common subsequence and supersequence problems and related problemsCybernetics and Systems Analysis, 1990
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- The shortest common supersequence problem over binary alphabet is NP-completeTheoretical Computer Science, 1981
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Polynomial Complete Consecutive Information Retrieval ProblemsSIAM Journal on Computing, 1977