The shortest common supersequence problem over binary alphabet is NP- complete
type: Item
instance of: scholarly article
title: The shortest common supersequence problem over binary alphabet is NP- complete
zbMATH Open document ID: 0469.68049
DOI: 10.1016/0304-3975(81)90075-X
author: Esko Ukkonen
author: Kari-Jouko Raeihae
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 3737027
zbMATH Keywords: NP-completeness
zbMATH Keywords: semantic attribute evaluation
Wikidata QID: Q61067915
MaRDI profile type: Publication
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
cites work: The complexity of theorem-proving procedures
cites work: Q4198056
cites work: Q4142699
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Minimizing the Number of Evaluation Passes for Attribute Grammars
cites work: The String-to-String Correction Problem
full work available at URL: 0304-3975(81)90075-x
OpenAlex ID: W2053393747
description: scientific article; zbMATH DE number 3737027