On the approximation of longest common nonsupersequences and shortest common nonsubsequences
type: Item
instance of: scholarly article
title: On the approximation of longest common nonsupersequences and shortest common nonsubsequences
zbMATH Open document ID: 0873.68064
DOI: 10.1016/0304-3975(94)00257-J
author: Louxin Zhang
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 985363
zbMATH Keywords: longest common nonsupersequence
zbMATH Keywords: binary alphabet
MaRDI profile type: Publication
cites work: Theory and algorithms for plan merging
cites work: Q4198056
cites work: On the complexity of learning strings and sequences
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: The shortest common nonsubsequence problem is NP-complete
cites work: The shortest common supersequence problem over binary alphabet is NP- complete
cites work: String Noninclusion Optimization Problems
description: scientific article; zbMATH DE number 985363