Significant Subpatterns Matching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03133334" target="_blank" >RIV/68407700:21230/07:03133334 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Significant Subpatterns Matching
Original language description
We present an algorithm for matching significant subpatterns of a given pattern in a text. The significant subpattern is any subpattern of the pattern which is at least of some specified length. We use bit-parallel simulation of an automaton for matchingall subpatterns. The bit-parallel approach enables us to count the length of the longest subpatterns.
Czech name
Vyhledávání významných podvzorků v textu
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)
Others
Publication year
2007
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
Twelfth International Conference on Implementation and Application of Automata
ISBN
978-3-540-76335-2
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
317-319
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Prague
Event date
Jul 16, 2007
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—