A new efficient indexing algorithm for one-dimensional real scaled patterns
From MaRDI portal
Recommendations
- Efficient indexing algorithms for one-dimensional discretely-scaled strings
- Efficient algorithms for the scaled indexing problem
- Efficient one-dimensional real scaled matching
- String Processing and Information Retrieval
- The indexing for one-dimensional proportionally-scaled strings
- scientific article; zbMATH DE number 6449348
- Practical space-efficient index for structural pattern matching
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- An index data structure for matrices, with applications to fast two-dimensional pattern matching
- Index structures for fast similarity search for real vectors. II
Cites work
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A fast string searching algorithm
- Alphabet-Independent and Scaled Dictionary Matching
- Constructing suffix arrays in linear time
- Efficient algorithms for the scaled indexing problem
- Efficient one-dimensional real scaled matching
- Efficient pattern matching with scaling
- Fast Pattern Matching in Strings
- Faster algorithms for string matching with k mismatches
- On the sorting-complexity of suffix tree construction
- On-line construction of suffix trees
- Real scaled matching
- Real two dimensional scaled matching
- Simple deterministic wildcard matching
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(4)
This page was built for publication: A new efficient indexing algorithm for one-dimensional real scaled patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414881)