Finding Patterns in Given Intervals

DOI10.1007/978-3-540-74456-6_57zbMath1147.68470OpenAlexW1677489834MaRDI QIDQ3525608

Costas S. Iliopoulos, M. Sohel Rahman, Maxime Crochemore

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00620133/file/Finding_Patterns_In_Given_Intervals.pdf

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (8)

Efficient Data Structures for the Orthogonal Range Successor Problem ⋮ Improved data structures for the orthogonal range successor problem ⋮ Cache oblivious algorithms for the RMQ and the RMSQ problems ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Improved algorithms for the range next value problem and applications ⋮ Optimal prefix and suffix queries on texts ⋮ Faster entropy-bounded compressed suffix trees ⋮ Orthogonal Range Searching for Text Indexing

This page was built for publication: Finding Patterns in Given Intervals