An efficient algorithm for the All Pairs Suffix-Prefix Problem

For a pair of strings ( S 1, S 2), define the suffix-prefix match of ( S 1, S 2) to be the longest suffix of string S 1 that matches a prefix of string S 2. The following problem is considered in this paper. Given a collection of strings S 1, S 2,..., S k of total length m, find the suffix-prefix ma...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1992-03, Vol.41 (4), p.181-185
Hauptverfasser:	Gusfield, Dan, M. Landau, Gad, Schieber, Baruch
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Computer science control theory systems Data processing. List processing. Character string processing Design of algorithms Exact sciences and technology Information processing Memory organisation. Data processing Modifications Software string matching suffix tree Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!