Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111): 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.1007/978-3-642-02441-2_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1488535707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inplace run-length 2d compressed search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching for run-length encoded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit distance of run-length encoded strings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic algorithms for 3SUM / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast variable run-length coding for embedded progressive wavelet-based image compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing the edit distance of run-length coded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple deterministic wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching with don't cares and few errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying candidate matches in sparse and wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of \(O(n^ 2)\) problems in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence Alignment Algorithms for Run-Length-Encoded Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing similarity of run-length encoded strings with affine gap penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit distance for a run-length-encoded string and an uncompressed string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate matching of run-length compressed strings / rank
 
Normal rank

Latest revision as of 18:56, 1 July 2024

scientific article
Language Label Description Also known as
English
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
scientific article

    Statements

    Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    run-length encoding
    0 references
    3sum
    0 references
    wildcard matching
    0 references
    \(k\)-mismatches
    0 references
    alignment
    0 references
    0 references