Cross-document pattern matching
From MaRDI portal
Publication:396714
DOI10.1016/j.jda.2013.05.002zbMath1334.68319OpenAlexW2025134853WikidataQ58064467 ScholiaQ58064467MaRDI QIDQ396714
Tsvi Kopelowitz, Tatiana Starikovskaya, Gregory Kucherov, Yakov Nekrich
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.05.002
Related Items
The property suffix tree with dynamic properties, Inducing enhanced suffix arrays for string collections, A simple algorithm for computing the document array, The Online House Numbering Problem: Min-Max Online List Labeling, Orthogonal Range Searching for Text Indexing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- The level ancestor problem simplified
- Fast local searches and updates in bounded universes
- Succinct data structures for flexible text retrieval systems
- Faster entropy-bounded compressed suffix trees
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Finding level-ancestors in trees
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Compressed suffix trees with full functionality
- Space Efficient Suffix Trees
- Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
- Dynamic text and static pattern matching
- Compressed representations of sequences and full-text indexes
- Fully compressed suffix trees
- Dynamic ordered sets with exponential search trees
- Rank/select operations on large alphabets
- Design and implementation of an efficient priority queue
- New upper bounds for generalized intersection searching problems
- Automata, Languages and Programming
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
