Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994855795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5506324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved construction of progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Convolutions and Their Applications in Approximate String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large 3-free sets. I. The small \(n\) case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster pattern matching with character classes using prime number encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Roth's theorem on progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471360 / rank
 
Normal rank

Latest revision as of 21:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
scientific article

    Statements

    Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate string matching
    0 references
    pattern matching
    0 references
    convolutions
    0 references
    word RAM model of computation
    0 references
    0 references