Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

2 2003

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: bit-parallelism

Sortuj według:

Ogranicz wyniki do:

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms

Crochemore M., Iliopoulos C.S., Pinzon Y.J.

Fundamenta Informaticae

2003

Vol. 56, nr 1,2

89-103

Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The first algorithm is an improvement of Hirschberg's divide-and-conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an efficient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very efficiently in practice.

Fast Multipattern Search Algorithms for Intrusion Detection

Kuri J., Navarro G., Mé L.

Fundamenta Informaticae

2003

Vol. 56, nr 1,2

23-49

We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text characters among those of the pattern. This is a common requirement in intrusion detection applications. Our algorithms exploit the ability to represent the search state of one or more patterns in the bits of a single machine word and update all the search states in a single operation. We show analytically and experimentally that the algorithms are able of fast searching for large sets of patterns allowing a wide number of spurious characters, yielding in our machine about a 75-fold improvement over the classical dynamic programming algorithm.