Full-fledged real-time indexing for constant size alphabets

DOI10.1007/s00453-016-0199-7zbMath1372.68314arXiv1302.4016OpenAlexW2509063142WikidataQ58064448 ScholiaQ58064448MaRDI QIDQ2408918

Gregory Kucherov, Yakov Nekrich

Publication date: 10 October 2017

Published in: Algorithmica, Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4016

zbMATH Keywords

data structurespattern matchingtext indexingreal-time indexing

Mathematics Subject Classification ID

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

Related Items (2)

Alphabet-Dependent String Searching with Wexponential Search Trees ⋮ Towards a real time algorithm for parameterized longest common prefix computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Near real-time suffix tree construction via the fringe marked ancestor problem
• Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
• Cross-Document Pattern Matching
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• Alphabet-Dependent String Searching with Wexponential Search Trees
• Simple Real-Time Constant-Space String Matching
• String Matching in Real Time
• Design and implementation of an efficient priority queue
• Dynamic LCA Queries on Trees

This page was built for publication: Full-fledged real-time indexing for constant size alphabets