|
=={{header|Julia}}==
Some of this code is partially derived from PerlPython code by DavidBen ChouLangmead. andBecause Pythonof codethat ancestry, it returns by
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 Daniel M. Gusfield,
though Julia native 1-based indexing is used within the individual functions. The theorem references
in the comments are to the definitive work of Daniel M. Gusfield, "Algorithms on Strings, Trees, and Sequences", 1997, available online as a pdf in several publicly indexed
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 """
|