Faster approximate elastic-degenerate string matching. Part A
From MaRDI portal
Cites work
- A data structure for dynamic trees
- A unifying taxonomy of pattern matching in degenerate strings and founder graphs
- Approximate circular pattern matching
- Approximate pattern matching on elastic-degenerate text
- Approximate suffix-prefix dictionary queries
- Constructing Efficient Dictionaries in Close to Sorting Time
- Dictionary matching and indexing with errors and don't cares
- Efficient pattern matching in elastic-degenerate strings
- Efficient string matching with k mismatches
- Elastic-degenerate string comparison
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- Elastic-degenerate string matching with 1 error
- Elastic-degenerate string matching with 1 error or mismatch
- Fast parallel and serial approximate string matching
- Faster algorithms for string matching with k mismatches
- Faster algorithms for text-to-pattern Hamming distances
- Faster approximate elastic-degenerate string matching. Part B
- Faster Online Elastic Degenerate String Matching
- Finding the Position of the k-Mismatch and Approximate Tandem Repeats
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- On the Complexity of String Matching for Graphs
- On-line construction of suffix trees
- On-line pattern matching on similar texts
- Optimal suffix tree construction with large alphabets
- Parallel string matching with k mismatches
- Path minima queries in dynamic weighted trees
- Perspectives of Monge properties in optimization
- Storing a Sparse Table with 0 (1) Worst Case Access Time
This page was built for publication: Faster approximate elastic-degenerate string matching. Part A
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299463)
