The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello. The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. In Michael Drmota, Clemens Heuberger, editors, 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference). Volume 159 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

This author has not been identified. Look up 'Frédérique Bassino' in GoogleThis author has not been identified. Look up 'Tsinjo Rakotoarimalala' in GoogleThis author has not been identified. Look up 'Andrea Sportiello' in Google

runs on WebDSL