Fast pattern matching with epsilon transitions
From MaRDI portal
Cites work
- A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
- Algorithms and complexity on indexing founder graphs
- An Eulerian path approach to DNA fragment assembly
- Co-lexicographically ordering automata and regular languages. I
- Combinatorial pattern matching. 6th annual symposium, CPM 95, Espoo, Finland, July 5--7, 1995. Proceedings
- Compressing and indexing labeled trees, with applications
- Computational graph pangenomics: a tutorial on data structures and their applications
- Computing the LCP array of a labeled graph
- Fast Pattern Matching in Strings
- Genome-Scale Algorithm Design
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- scientific article; zbMATH DE number 7788491 (Why is no real title available?)
- Improved approximate pattern matching on hypertext
- Indexing compressed text
- Linear time construction of indexable elastic founder graphs
- On the complexity of string matching for graphs
- Pattern Matching in Hypertext
- Prefix sorting DFAs: a recursive algorithm
- Regular Languages meet Prefix Sorting
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Succinct de Bruijn graphs
- Wheeler graphs: a framework for BWT-based data structures
This page was built for publication: Fast pattern matching with epsilon transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876393)
