Complete automata for fast matching of multiple skewed strings

Multiple string matching is required to handle massive amount of data in many applications including pattern recognition, intrusion detection, and biological sequence analysis, etc. However, the matching process is often disturbed by intentional or unintentional skewing of the strings being matched. This paper presents a new automata formation to perform fast and accurate string matching under such disturbances. This automaton will significantly enhance the accuracy of the skewed string matching process. We present a new algorithm for fast skewed string matching based on the new automaton.