Fast prefix matching of bounded strings
From MaRDI portal
Recommendations
- I/O Efficient Dynamic Data Structures for Longest Prefix Queries
- I/O efficient dynamic data structures for longest prefix queries
- DMP-tree: A dynamic M-way prefix tree data structure for strings matching
- scientific article; zbMATH DE number 1998344
- Fast prefix search in little space, with applications
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms for the Longest Common Subsequence Problem
- Fast packet classification for two-dimensional conflict-free filters
- Fast parallel string prefix-matching
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1263248 (Why is no real title available?)
- scientific article; zbMATH DE number 1305543 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- Improved dynamic dictionary matching
- Internet packet filter management and rectangle geometry
- Linear approximation of shortest superstrings
- On the Comparison Complexity of the String Prefix-Matching Problem
Cited in
(9)- I/O efficient dynamic data structures for longest prefix queries
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares
- I/O Efficient Dynamic Data Structures for Longest Prefix Queries
- scientific article; zbMATH DE number 2030084 (Why is no real title available?)
- Linear-time computation of prefix table for weighted strings {\&} applications
- DMP-tree: A dynamic M-way prefix tree data structure for strings matching
- Fast parallel string prefix-matching
- Tight comparison bounds for the string prefix-matching problem
This page was built for publication: Fast prefix matching of bounded strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463440)
