All-pairs suffix/prefix in optimal time using Aho-Corasick space

The all-pairs suffix/prefix (APSP) problem is a classic problem in computer science with many applications in bioinformatics. Given a set {S1,…,Sk} of k strings of total length n, we are asked to find, for each string Si, i∈[1,k], its longest suffix that is a prefix of string Sj, for all j≠i, j∈[1,k...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 178; p. 106275
Main Authors:	Loukides, Grigorios, Pissis, Solon P.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2022 Elsevier
Subjects:	Aho-Corasick machine Algorithms Computer Science Data structures Failure transition tree String algorithms String algorithms Data structures Failure transition tree Algorithms Aho-Corasick machine
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!