A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00315777" target="_blank" >RIV/68407700:21240/17:00315777 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-319-72453-9_28" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-72453-9_28</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-72453-9_28" target="_blank" >10.1007/978-3-319-72453-9_28</a>
Alternative languages
Result language
angličtina
Original language name
A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching
Original language description
The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions and has only streaming access to the input. We introduce a new approach to solve this problem based on the graph theoretic model and compare its performance to previously known algorithms. We also show that an approach using deterministic finite automata cannot achieve similarly efficient algorithms. Furthermore, we describe a fatal flaw in some of the previously published algorithms based on the same model. Finally, we provide experimental evaluation of our algorithm on real-world data.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA17-20065S" target="_blank" >GA17-20065S: Tight Parameterized Results for Directed Connectivity Problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
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
Mathematical Aspects of Computer and Information Sciences
ISBN
978-3-319-72452-2
ISSN
0302-9743
e-ISSN
—
Number of pages
16
Pages from-to
333-348
Publisher name
Springer International Publishing
Place of publication
Cham
Event location
Vídeň
Event date
Nov 15, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—