More on the complexity of common superstring and supersequence problems
type: Item
instance of: scholarly article
title: More on the complexity of common superstring and supersequence problems
zbMATH Open document ID: 0795.68093
DOI: 10.1016/0304-3975(92)00074-2
published in: Theoretical Computer Science
publication date: 1994-04-05T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 540844
zbMATH Keywords: permutations of strings
zbMATH Keywords: shortest common superstring problem
zbMATH Keywords: shortest common supersequence problem
zbMATH Keywords: NP-complete
author: Martin Middendorf
MaRDI profile type: Publication
full work available at URL: 0304-3975(92)00074-2
OpenAlex ID: W2010332450
cites work: On finding minimal length superstrings
cites work: Q4198056
cites work: Hamilton Paths in Grid Graphs
cites work: Polynomial Complete Consecutive Information Retrieval Problems
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: The shortest common supersequence problem over binary alphabet is NP- complete
description: scientific article; zbMATH DE number 540844