Improved circular dictionary matching
From MaRDI portal
Cites work
- A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
- An extension of the Burrows-Wheeler transform
- Co-lexicographically ordering automata and regular languages. I
- Compressed suffix trees with full functionality
- Computing the original eBWT faster, simpler, and with less memory
- Dictionary matching in a stream
- Dictionary matching with a bounded gap in pattern or in text
- Dictionary matching with a few gaps
- Dynamic dictionary matching in the online model
- Efficient algorithm for circular Burrows-Wheeler transform
- Efficient string matching
- Faster compressed dictionary matching
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 7695993 (Why is no real title available?)
- scientific article; zbMATH DE number 7788491 (Why is no real title available?)
- Indexing Circular Patterns
- Indexing compressed text
- Internal dictionary matching
- Linear-time string indexing and analysis in small space
- Mind the gap!
- Regular Languages meet Prefix Sorting
- Searching and indexing circular patterns
- Sorting conjugates and suffixes of words in a multiset
- Space-efficient construction algorithm for the circular suffix tree
- Space-efficient construction of compressed indexes in deterministic linear time
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Streaming Dictionary Matching with Mismatches
- Succinct Dictionary Matching with No Slowdown
- Succinct indexes for circular patterns
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Wheeler graphs: a framework for BWT-based data structures
This page was built for publication: Improved circular dictionary matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299453)
