Linear Pattern Matching with Swaps for Short Patterns

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00160118" target="_blank" >RIV/68407700:21230/09:00160118 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Linear Pattern Matching with Swaps for Short Patterns
Original language description
The Pattern Matching problem with swaps is a variation of the classical pattern matching problem. It consists of finding all the occurrences of a pattern P in a text T, when an unrestricted number of disjoint local swaps is allowed. In this paper, we present a new, efficient method for the Swap Matching problem with short patterns. In particular, we present an algorithm constructing a non-deterministic finite automaton for a given pattern P which, when transformed to a deterministic finite automaton, serves as a pattern matcher running in time O(n), where n is the length of the input text T.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2009
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
Proceedings of the 10th International PhD Workshop on Systems and Control
ISBN
978-80-903834-3-2
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
AV ČR, Ústav teorie informace a automatizace
Place of publication
Praha
Event location
Hluboká nad Vltavou
Event date
Sep 22, 2009
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)