One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point set pattern matching in \(d\)-dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate matching in the \(L_{\infty }\) metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L_{1}\) pattern matching lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank

Revision as of 06:00, 7 July 2024

scientific article
Language Label Description Also known as
English
One-dimensional approximate point set pattern matching with \(L_p\)-norm
scientific article

    Statements

    One-dimensional approximate point set pattern matching with \(L_p\)-norm (English)
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    point set pattern matching
    0 references
    \(L_p\)-norm
    0 references
    dynamic programming
    0 references

    Identifiers