@InProceedings{bassino_et_al:LIPIcs.AofA.2020.3,
  author =	{Bassino, Fr\'{e}d\'{e}rique and Rakotoarimalala, Tsinjo and Sportiello, Andrea},
  title =	{{The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings}},
  booktitle =	{31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
  pages =	{3:1--3:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-147-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{159},
  editor =	{Drmota, Michael and Heuberger, Clemens},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.3},
  URN =		{urn:nbn:de:0030-drops-120336},
  doi =		{10.4230/LIPIcs.AofA.2020.3},
  annote =	{Keywords: Average-case analysis of algorithms, String Pattern Matching, Computational Complexity bounds}
}