Faster implementation of a shortest superstring approximation
type: Item
instance of: scholarly article
title: Faster implementation of a shortest superstring approximation
zbMATH Open document ID: 0942.68781
DOI: 10.1016/0020-0190(94)00097-2
author: Dan Gusfield
published in: Information Processing Letters
publication date: 1996-02-26T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 681781
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00097-2
OpenAlex ID: W2042037790
cites work: Linear approximation of shortest superstrings
cites work: Q4198056
cites work: An efficient algorithm for the all pairs suffix-prefix problem
cites work: Fast Pattern Matching in Strings
cites work: Approximating Shortest Superstrings
description: scientific article; zbMATH DE number 681781