Fast Algorithms for Computing the Statistics of Pattern Matching
Pattern matching is a fundamental problem in theoretical computer science. The algorithms for pattern matching and the study on the statistics of pattern matching have found enormous applications in practical fields. In this paper, we revisit the Markov embedding approach for studying pattern matchi...
Main Authors: | Danna Zhang, Kai Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9514871/ |
Similar Items
-
An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
by: Sven Rahmann, et al.
Published: (2011-10-01) -
Permuted Pattern Matching Algorithms on Multi-Track Strings
by: Diptarama Hendrian, et al.
Published: (2019-04-01) -
On Tree Pattern Matching by Pushdown Automata
by: T. Flouri
Published: (2009-01-01) -
ANALISIS STRING MATCHING PADA JUDUL SKRIPSI DENGAN ALGORITMA KNUTH-MORRIS PRATT (KMP)
by: Wistiani Astuti
Published: (2017-08-01) -
A novel technique to prevent SQL injection and cross-site scripting attacks using Knuth-Morris-Pratt string match algorithm
by: Oluwakemi Christiana Abikoye, et al.
Published: (2020-08-01)