Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948): 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.1145/3129536 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2754988343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Case Optimal Approximate Circular String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Suffix Automata Based Algorithm for Exact Online String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Counters in Bit-Parallel String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-optimal single and multiple approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Statistics of <b><i>N</i></b> Random Variables Distributed by the Negative Binomial Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wide window string matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: NR‐grep: a fast and flexible pattern‐matching tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Boyer–Moore String Matching / rank
 
Normal rank

Latest revision as of 05:55, 16 July 2024

scientific article; zbMATH DE number 6913938
Language Label Description Also known as
English
Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches
scientific article; zbMATH DE number 6913938

    Statements

    Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (English)
    0 references
    0 references
    0 references
    6 August 2018
    0 references
    approximate matching
    0 references
    bit-parallel automata
    0 references
    circular strings
    0 references

    Identifiers