A note on shortest superstrings with flipping
type: Item
instance of: scholarly article
title: A note on shortest superstrings with flipping
zbMATH Open document ID: 0774.68051
DOI: 10.1016/0020-0190(92)90084-9
author: Tao Jiang
author: Ming Li
author: Du Ding-Zhu
published in: Information Processing Letters
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 166444
zbMATH Keywords: approximation algorithms
zbMATH Keywords: \(NP\)-hard
zbMATH Keywords: DNA sequencing
MaRDI profile type: Publication
full work available at URL: 0020-0190(92)90084-9
OpenAlex ID: W2057864425
cites work: On finding minimal length superstrings
cites work: Q4198056
cites work: A greedy approximation algorithm for constructing shortest common superstrings
cites work: Approximation algorithms for the shortest common superstring problem
description: scientific article; zbMATH DE number 166444