Succinct Data Structures for Parameterized Pattern Matching and Related Problems
Let T be a fixed text-string of length n and P be a varying pattern-string of length |P| <= n. Both T and P contain characters from a totally ordered alphabet Sigma of size sigma <= n. Suffix tree is the ubiquitous data structure for answering a pattern matching query: report all the positions...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
LSU
2017
|
| Subjects: | |
| Online Access: | http://etd.lsu.edu/docs/available/etd-06212017-142105/ |