Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem

DOI10.1016/j.ipl.2009.10.015zbMath1206.68353OpenAlexW2095356161MaRDI QIDQ990128

Enno Ohlebusch, Simon Gog

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.015

zbMATH Keywords

algorithmssuffix arraysuffix-prefix matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (7)

An improved algorithm for the all-pairs suffix-prefix problem ⋮ All-pairs suffix/prefix in optimal time using Aho-Corasick space ⋮ A fast algorithm for the all-pairs suffix-prefix problem ⋮ Approximate all-pairs suffix/prefix overlaps ⋮ 2D Lyndon words and applications ⋮ A simple algorithm for computing the document array ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• An efficient algorithm for the all pairs suffix-prefix problem
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem