An efficient algorithm for the all pairs suffix-prefix problem
type: Item
instance of: scholarly article
title: An efficient algorithm for the all pairs suffix-prefix problem
zbMATH Open document ID: 0748.68021
DOI: 10.1016/0020-0190(92)90176-V
author: Dan Gusfield
author: Gad M. Landau
author: Baruch Schieber
published in: Information Processing Letters
publication date: 1992-09-26T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 55560
zbMATH Keywords: string matching
zbMATH Keywords: suffix-prefix match
MaRDI profile type: Publication
cites work: Parallel construction of a suffix tree with applications
cites work: Fast Pattern Matching in Strings
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: A greedy approximation algorithm for constructing shortest common superstrings
cites work: Q4010349
cites work: Approximation algorithms for the shortest common superstring problem
cites work: A linear-time algorithm for finding approximate shortest common superstrings
full work available at URL: 0020-0190(92)90176-v
OpenAlex ID: W2063556310
Wikidata QID: Q126551376
description: scientific article; zbMATH DE number 55560