Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance

We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1, where pi ,

• Type: Journal
• Year: 2008
• Where: IR
• Authors: Kimmo Fredriksson, Szymon Grabowski
• Keywords: Character Classes, Efficient Dynamic Programming, General Gaps, IR 2008, Natural Language Processing