Hardness of comparing two run-length encoded strings (Q990818): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.jco.2010.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009278392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inplace run-length 2d compressed search. / 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: Matching for run-length encoded strings / 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: Simple deterministic wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633890 / 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: Matching patterns in strings subject to multi-linear transformations / 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: 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 04:11, 3 July 2024

scientific article
Language Label Description Also known as
English
Hardness of comparing two run-length encoded strings
scientific article

    Statements

    Hardness of comparing two run-length encoded strings (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2010
    0 references
    0 references
    compressed pattern matching
    0 references
    run-length encoding
    0 references
    sequence comparison
    0 references
    0 references