ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS (Q2909199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional Huffman Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching in Huffman encoded texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast exact string matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a canonical prefix encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054112400163 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976439571 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:20, 30 July 2024

scientific article
Language Label Description Also known as
English
ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS
scientific article

    Statements

    ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS (English)
    0 references
    0 references
    0 references
    0 references
    30 August 2012
    0 references
    string matching
    0 references
    compression algorithms
    0 references
    Huffman coding
    0 references
    Boyer-Moore algorithm
    0 references
    text processing
    0 references
    information retrieval
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references