"N\u00E1\u0161 paraleln\u00ED algoritmus pro vyhled\u00E1v\u00E1n\u00ED vzorku v textu je proveden v case O(k log m) , kde k je pocet chyb a m je delka vzorku, na O(n/log m) procesorech, kde n je delka textu, na stroji CREW PRAM. Algoritmus pouziva bitov\u011B paraleln\u00ED simulace kone\u010Dn\u00FDch automat\u016F."@cs . "978-80-7355-077-6" . "\u0160upol, Jan" . "Parallel Pattern Matching Using Bit-vectors"@cs . "We present a fast parallel algorithm for approximate pattern matching. The algorithm is vased on bit-parallel ondeterministic finite automata simulation in contrary to existing algorithms based on dynamic programming. Our algorithm takes O(k log m) parallel time using O(n/log m) processors on CREW PRAM, where mn is the length of the text, m is the length of the pattern, and k is the number of edit operations." . "Parallel Pattern Matching Using Bit-vectors" . "bit-parallel NFA simulation; finite automata; parallel algorithm; pattern matching"@en . . "Parallel Pattern Matching Using Bit-vectors"@cs . "[A70B206B3402]" . . . "201;208" . . "Parallel Pattern Matching Using Bit-vectors"@en . "Parallel Pattern Matching Using Bit-vectors" . . "Parallel Pattern Matching Using Bit-vectors"@en . . . . "440584" . . "21230" . "8"^^ . "Brno" . . . . . "Masarykova univerzita" . . "1"^^ . . "Znojmo" . . "2007-10-26+02:00"^^ . "We present a fast parallel algorithm for approximate pattern matching. The algorithm is vased on bit-parallel ondeterministic finite automata simulation in contrary to existing algorithms based on dynamic programming. Our algorithm takes O(k log m) parallel time using O(n/log m) processors on CREW PRAM, where mn is the length of the text, m is the length of the pattern, and k is the number of edit operations."@en . "RIV/68407700:21230/07:03133187!RIV08-GA0-21230___" . . . "MEMICS proceedings 2007" . "1"^^ . "RIV/68407700:21230/07:03133187" . . "P(GA201/06/1039), Z(MSM6840770014)" .