scientific article; zbMATH DE number 7559174
From MaRDI portal
Publication:5088893
DOI10.4230/LIPIcs.CPM.2019.6MaRDI QIDQ5088893
Eitan Kondratovsky, Amihood Amir
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
general matching relationsoff-the-shelf indexing algorithmsweaker sufficient conditions for indexing
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-preserving indexing
- A linear time algorithm for consecutive permutation pattern matching
- A fast algorithm for order-preserving pattern matching
- Efficient string matching with k mismatches
- Alphabet dependence in parameterized matching
- On-line construction of suffix trees
- Parameterized pattern matching: Algorithms and applications
- On-line construction of parameterized suffix trees for large alphabets
- On representations of ternary order relations in numeric strings
- Order-preserving matching
- On the relationship between histogram indexing and block-mass indexing
- Indexing compressed text
- A Space-Economical Suffix Tree Construction Algorithm
- Design and implementation of an efficient priority queue
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Faster Suffix Tree Construction with Missing Suffix Links
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- Cartesian Tree Matching and Indexing
- On Hardness of Jumbled Indexing
This page was built for publication:
