Average complexity of exact and approximate multiple string matching (Q1885904): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up two string-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast practical multi-pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Optimal Multiple Approximate String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm For Approximate String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Pattern Matching for a Random String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank

Latest revision as of 15:13, 7 June 2024

scientific article
Language Label Description Also known as
English
Average complexity of exact and approximate multiple string matching
scientific article

    Statements

    Average complexity of exact and approximate multiple string matching (English)
    0 references
    0 references
    0 references
    12 November 2004
    0 references
    0 references
    Lower bounds
    0 references
    Yao's bound
    0 references
    String matching allowing differences
    0 references
    Multipattern matching
    0 references
    0 references