{"version":"1.0","type":"link","title":"Two-way string-matching algorithm - Newikis","description":"In computer science, the two-way string-matching algorithm (or Crochemore-Perrin string-matching algorithm) is a string-searching algorithm, discovered by Maxime Crochemore and Dominique Perrin in 1991. It searches for copies of a \"needle\" of length m in a \"haystack\" of length n. After…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}