An Encoding for Order-Preserving Matching.
From MaRDI portal
Publication:5111725
DOI10.4230/LIPIcs.ESA.2017.38zbMath1442.68038arXiv1610.02865OpenAlexW2595089934MaRDI QIDQ5111725
Rossano Venturini, Travis Gagie, Giovanni Manzini
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1610.02865
Related Items (4)
Wheeler graphs: a framework for BWT-based data structures ⋮ String Periods in the Order-Preserving Model ⋮ The effective entropy of next/previous larger/smaller value queries ⋮ String periods in the order-preserving model
Cites Work
- Space-efficient substring occurrence estimation
- Order-preserving indexing
- Order-preserving pattern matching with \(k\) mismatches
- A linear time algorithm for consecutive permutation pattern matching
- A fast algorithm for order-preserving pattern matching
- Combined data structure for previous- and next-smaller-values
- A filtration method for order-preserving matching
- Encoding 2D range maximum queries
- Parameterized pattern matching: Algorithms and applications
- Order-preserving matching
- Space efficient data structures for nearest larger neighbor
- Efficient Algorithms for the Order Preserving Pattern Matching Problem
- Encodings for Range Selection and Top-k Queries
- Single and Multiple Consecutive Permutation Motif Search
- Encodings of Range Maximum-Sum Segment Queries and Applications
- Encoding range minima and range top-2 queries
- Asymptotically Optimal Encodings for Range Selection
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max
- Fast Prefix Search in Little Space, with Applications
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Efficient Storage and Retrieval by Content and Address of Static Files
- pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- Encodings for Range Majority Queries
- Encoding Data Structures
- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
- Theory and practice of monotone minimal perfect hashing
- An experimental study of a compressed index
This page was built for publication: An Encoding for Order-Preserving Matching.