A Brief Overview of Dead-Zone Pattern Matching Algorithms
Abstract
Within the last decades, the dead-zone algorithms have emerged as being highly performant on certain types of data. Such algorithms solve the keyword exact matching problem over strings, though extensions to trees and two-dimensional data have also been devised. In this short paper, we give an overview of such algorithms.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
Loading...
