Least Random Suffix/Prefix Matches in Output-Sensitive Time

DOI10.1007/978-3-642-31265-6_22zbMath1358.68348OpenAlexW86329357MaRDI QIDQ2904500

Niko Välimäki

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_22

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

This page was built for publication: Least Random Suffix/Prefix Matches in Output-Sensitive Time