Pattern Matching in Huffman Coded Text
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03092941" target="_blank" >RIV/68407700:21230/03:03092941 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Pattern Matching in Huffman Coded Text
Original language description
We present a simple and effective algorithm for pattern matching in text compressed by static Huffman coding. Our algorithm can be used to solve any pattern matching problem.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F01%2F1433" target="_blank" >GA201/01/1433: Pattern Matching</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
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 6th International Multi-Conference Information Society IS 2003
ISBN
961-6303-52-X
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
274-279
Publisher name
Institut Jozef Stefan
Place of publication
Ljubljana
Event location
Ljubljana
Event date
Oct 13, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—