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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 178; s. 106275
Hlavní autori:	Loukides, Grigorios, Pissis, Solon P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2022 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!