Pattern Matching in DCA Coded Text
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A03142695" target="_blank" >RIV/68407700:21230/08:03142695 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Pattern Matching in DCA Coded Text
Original language description
A new algorithm searching all occurrences of a regular expression pattern in a text is presented. It uses only the text that has been compressed by the text compression using antidictionaries without its decompression. The proposed algorithm runs in $bigoh(2^mcdot||AD||^2+n_c+r)$ worst case time, where $m$ is the length of the pattern, AD is the antidictionary, $n_C$ is the length of the coded text and $r$ is the number of found matches.
Czech name
Vyhledávání v textu kódovaném metodou DCA
Czech description
Není známa.
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)
Others
Publication year
2008
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 13th International Conference on Implementation and Application of Automata
ISBN
978-3-540-70843-8
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer
Place of publication
Heidelberg
Event location
San Francisco
Event date
Jul 20, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000258311400016