Compact data structures for shortest unique substring queries

DOI10.1007/978-3-030-32686-9_8zbMATH Open1539.68089MaRDI QIDQ6536247

Masayuki Takeda, Takuya Mieno, Dominik Köppl, Shunsuke Inenaga, Yuto Nakashima, Hideo Bannai

Publication date: 19 April 2024

zbMATH Keywords

compact data structureshortest unique substringstring processing algorithm

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
• In-place algorithms for exact and approximate shortest unique substring problems
• Space-time trade-offs for finding shortest unique substrings and maximal unique matches
• Succinct Representations of Binary Trees for Range Minimum Queries
• Shortest Unique Substrings Queries in Optimal Time
• Suffix Arrays: A New Method for On-Line String Searches
• Shortest Unique Substring Queries on Run-Length Encoded Strings

This page was built for publication: Compact data structures for shortest unique substring queries

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