Top-k Substring Matching for Auto-Completion

DOI10.1137/1.9781611973198.5zbMATH Open1430.68464OpenAlexW2196636117MaRDI QIDQ5232489FDOQ5232489

Yuzuru Okajima

Publication date: 12 September 2019

Published in: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973198.5

Mathematics Subject Classification ID

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

Recommendations

• Fast and practical approximate string matching 👍 👎
• Efficient string matching with k mismatches 👍 👎
• Improving practical exact string matching 👍 👎
• Approximate string matching with suffix automata 👍 👎
• String Processing and Information Retrieval 👍 👎
• String indexing for top-\(k\) close consecutive occurrences 👍 👎

This page was built for publication: Top-k Substring Matching for Auto-Completion

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