44,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

We present various parallel and bit-parallel text algorithms. A parallel solution of the arithmetic coding compression algorithm, the computation of the border array, and a new approach to pattern matching problems. This approach uses non-deterministic finite automata for pattern matching and their bit-parallel simulation. We also present a new solution to weighted degenerated pattern matching problem, which sets new conditions on the searched pattern, and a pattern matching which matches any subpattern of a length specified. This algorithm uses the bit-vector extension as well. Moreover, we…mehr

Produktbeschreibung
We present various parallel and bit-parallel text algorithms. A parallel solution of the arithmetic coding compression algorithm, the computation of the border array, and a new approach to pattern matching problems. This approach uses non-deterministic finite automata for pattern matching and their bit-parallel simulation. We also present a new solution to weighted degenerated pattern matching problem, which sets new conditions on the searched pattern, and a pattern matching which matches any subpattern of a length specified. This algorithm uses the bit-vector extension as well. Moreover, we present a new bit-parallel simulation of the determinisation of pattern matching automata and suffix automata. Our determinisation provides an increase in speed in comparison to a standard subset construction determinisation algorithm.
Autorenporträt
Jan ¿upol received his Ph.D. degree at Czech Technical University in Prague (Czech Republic), in 2009. Currently, he works as software engineer with Oracle. He is married and has three children.