Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886431 / rank
 
Normal rank
Property / zbMATH Keywords
 
design and analysis of algorithms
Property / zbMATH Keywords: design and analysis of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial algorithms on words
Property / zbMATH Keywords: combinatorial algorithms on words / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate string matching
Property / zbMATH Keywords: approximate string matching / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamming distance
Property / zbMATH Keywords: Hamming distance / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9345-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974523510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient 2-dimensional approximate matching of half-rectangular figures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet dependence in parameterized 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: A randomized algorithm for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of parameterized pattern matching / 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: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for approximately counting mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: String matching under a general matching relation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 01:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
scientific article

    Statements

    Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    design and analysis of algorithms
    0 references
    combinatorial algorithms on words
    0 references
    approximate string matching
    0 references
    Hamming distance
    0 references

    Identifiers