scientific article; zbMATH DE number 7651042

DOI10.4230/LIPICS.AOFA.2020.3MaRDI QIDQ5874401FDOQ5874401

Authors: Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello 

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of the multiple pattern matching problem for random strings
• Average complexity of exact and approximate multiple string matching
• A randomized algorithm for approximate string matching
• On approximate jumbled pattern matching in strings
• A lower-variance randomized algorithm for approximate string matching
• Exact bounds on the complexity of sequential string matching algorithms
• On the Exact Complexity of String Matching: Upper Bounds
• On the Exact Complexity of String Matching: Lower Bounds
• scientific article; zbMATH DE number 2052914
• scientific article; zbMATH DE number 1256698

zbMATH Keywords

average-case analysis of algorithmsstring pattern matchingcomputational complexity bounds

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited In (3)

• Pattern Matching with Variables: A Multivariate Complexity Analysis
• Communication and Streaming Complexity of Approximate Pattern Matching
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874401)