2D Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03120434" target="_blank" >RIV/68407700:21230/06:03120434 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
2D Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching
Original language description
A very fast parallel approach to pattern matching is presented. The approach is based on the bit-parallel approach and we use two-dimensional bitwise memory matrix which helps to achieve very fast parallel pattern matching algorithms. The parallel pattern matching takes O(1) time for the exact pattern matching and O(k) for the approximate pattern matching, where k is the number of errors.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Prague Stringology Conference '06
ISBN
80-01-03533-6
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
18-28
Publisher name
Vydavatelství ČVUT
Place of publication
Praha
Event location
Praha
Event date
Aug 28, 2006
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—