1612 search results - page 60 / 323 » Asynchronous Pattern Matching |
JISE
2010
14 years 4 months ago
2010
IPL
2008
14 years 9 months ago
2008
![Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time")
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
EPEW
2005
Springer
15 years 3 months ago
2005
Springer
We develop the static and dynamic semantics of PiDuce, a process calculus with XML values, schemas, and pattern matching. PiDuce values include channel names, therefore the structu...
VL
1994
IEEE
15 years 1 months ago
1994
IEEE
Dotplot is a technique for visualizing patterns of string matches in millions of lines of text and code. Patterns may be explored interactively or detected automatically. Applicat...