Faster sliding window string indexing in streams

DOI10.4230/LIPICS.CPM.2024.8MaRDI QIDQ6891091zbMATH OpenFDO

Authors Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, Simon R. Tarnow

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2024.8

zbMATH Keywords

data structurespattern matchingstring indexing

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• Alphabet-dependent string searching with wexponential search trees
• Dynamic ordered sets with exponential search trees
• Fast Pattern Matching in Strings
• Full-fledged real-time indexing for constant size alphabets
• scientific article; zbMATH DE number 5764836 (Why is no real title available?)
• scientific article; zbMATH DE number 177800 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
• Near real-time suffix tree construction via the fringe marked ancestor problem
• On the sorting-complexity of suffix tree construction
• On-line indexing for general alphabets via predecessor queries on subsets of an ordered list
• Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
• Sliding suffix tree
• Sliding window string indexing in streams
• Truncated suffix trees and their application to data compression.
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Faster sliding window string indexing in streams

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