Optimal suffix tree construction with large alphabets

DOI10.1109/SFCS.1997.646102MaRDI QIDQ7251042zbMATH OpenFDO

Authors Martin Farach

Publication date 21 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.1997.646102

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(9)

• Longest common substring with gaps and related problems
• Height-bounded Lempel-Ziv encodings
• Two-dimensional longest common extension queries in compact space
• Shortest undirected paths in de Bruijn graphs
• Faster approximate elastic-degenerate string matching. Part A
• Faster approximate elastic-degenerate string matching. Part B
• Self-assembly of strings and languages revisited: efficiently deciding closure under self-assembly
• Repetition aware text indexing for matching patterns with wildcards
• Sorting circular suffixes in linear time

This page was built for publication: Optimal suffix tree construction with large alphabets

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