Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform.
Jacqueline W. DaykinRichard GroultYannick GuesnetThierry LecroqArnaud LefebvreMartine LéonardLaurent MouchardÉlise PrieurBruce W. WatsonPublished in: Inf. Process. Lett. (2019)
Keyphrases
- pattern matching
- string matching
- boyer moore
- hamming distance
- matching process
- pattern matching algorithm
- regular expressions
- tree matching
- matching strategy
- suffix array
- bit parallel
- natural language
- suffix tree
- exact and approximate
- lossy compression
- edit distance
- compressed text
- compression algorithm
- approximate pattern matching
- data structure