Boyer-Moore string search: Difference between revisions

m
Line 67:
Ben Langmead. Because of that ancestry, it returns results that are 0-based in indexing,
though Julia native 1-based indexing is used within the individual functions. The theorem references
in the comments are to the definitive work of DonDaniel M. Gusfield, "Algorithms on Strings, Trees, and Sequences",
1997, available online as a pdf in several publicly indexed archives on the internet.
<lang ruby>""" Rosetta Code task at rosettacode.org/mw/index.php?title=Boyer-Moore_string_search """
4,105

edits