Sciweavers

254 search results - page 18 / 51
» Multiple Approximate String Matching
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 12 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
ICNP
2006
IEEE
14 years 1 months ago
High Speed Pattern Matching for Network IDS/IPS
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
Mansoor Alicherry, Muthusrinivasan Muthuprasanna, ...
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
14 years 25 days ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
13 years 12 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
DATE
2010
IEEE
190views Hardware» more  DATE 2010»
13 years 12 months ago
Ultra-high throughput string matching for Deep Packet Inspection
Deep Packet Inspection (DPI) involves searching a packet's header and payload against thousands of rules to detect possible attacks. The increase in Internet usage and growing...
Alan Kennedy, Xiaojun Wang, Zhen Liu, Bin Liu