Parallel Pattern Matching Using Bit-vectors

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03133187" target="_blank" >RIV/68407700:21230/07:03133187 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Parallel Pattern Matching Using Bit-vectors

Original language description

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.

Czech name

Parallel Pattern Matching Using Bit-vectors

Czech description

Náš paralelní algoritmus pro vyhledávání 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ě paralelní simulace konečnýchautomatů.

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F06%2F1039" target="_blank" >GA201/06/1039: Text processing and analysis</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2007

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

MEMICS proceedings 2007

ISBN

978-80-7355-077-6

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

201-208

Publisher name

Masarykova univerzita

Place of publication

Brno

Event location

Znojmo

Event date

Oct 26, 2007

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—