Approximating shortest superstrings with constraints
type: Item
instance of: scholarly article
title: Approximating shortest superstrings with constraints
zbMATH Open document ID: 0834.68088
DOI: 10.1016/0304-3975(94)90249-6
author: Tao Jiang
author: Ming Li
published in: Theoretical Computer Science
publication date: 1996-04-01T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 708710
zbMATH Keywords: shortest common superstring
zbMATH Keywords: data compression
zbMATH Keywords: DNA sequencing
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90249-6
OpenAlex ID: W2011557376
cites work: On finding minimal length superstrings
cites work: Q4198056
cites work: Q5557602
cites work: On the complexity of learning strings and sequences
cites work: Q4739657
cites work: A greedy approximation algorithm for constructing shortest common superstrings
cites work: Approximation algorithms for the shortest common superstring problem
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 708710