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

DOI10.1016/J.IPL.2009.10.015zbMATH Open1206.68353OpenAlexW2095356161MaRDI QIDQ990128FDOQ990128

Authors: 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)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• An efficient algorithm for the all pairs suffix-prefix problem
• Replacing suffix trees with enhanced suffix arrays

Cited In (7)

• Approximate all-pairs suffix/prefix overlaps
• A simple algorithm for computing the document array
• An improved algorithm for the all-pairs suffix-prefix problem
• A fast algorithm for the all-pairs suffix-prefix problem
• All-pairs suffix/prefix in optimal time using Aho-Corasick space
• Title not available (Why is that?)
• 2D Lyndon words and applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990128)