Tuning BNDM with q-Grams
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A03154066" target="_blank" >RIV/68407700:21230/09:03154066 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Tuning BNDM with q-Grams
Original language description
We develop bit-parallel algorithms for exact string matching. Our algorithms are variations of the BNDM and Shift-Or algorithms. At each alignment the algorithms read a $q$-gram before testing the state variable. In addition we apply reading a 2-gram inone instruction. Our experiments show that many of the new variations are substantially faster than any previous string matching algorithm on x86 processors for English and DNA data.
Czech name
Ladění BNDM pomocí q-gramů
Czech description
Vyvinuli jsme novou metodu pro přesné vyhledávání založenou na bitovém paralelismu, která využívá q-gramů.
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
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 Tenth Workshop on Algorithm Engineering and Experiments
ISBN
978-0-89871-653-5
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
—
Publisher name
SIAM
Place of publication
Philadelphia
Event location
New York
Event date
Jan 3, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—