Top-k Substring Matching for Auto-Completion
type: Item
instance of: scholarly article
title: Top-k Substring Matching for Auto-Completion
zbMATH Open document ID: 1430.68464
DOI: 10.1137/1.9781611973198.5
author: Yuzuru Okajima
published in: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
publication date: 2019-09-12T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 7104417
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1137/1.9781611973198.5
OpenAlex ID: W2196636117
Recommended article: String Processing and Information Retrieval
Recommended article: Approximate string matching with suffix automata
Recommended article: String indexing for top-\(k\) close consecutive occurrences
Recommended article: Fast and practical approximate string matching
Recommended article: Efficient string matching with k mismatches
Recommended article: Improving practical exact string matching
description: scientific article; zbMATH DE number 7104417