Talk:Boyer-Moore string search: Difference between revisions

From Rosetta Code
Content added Content deleted
m (Thundergnat moved page Talk:Boyer-Moore String Search to Talk:Boyer-Moore string search: Capitalization policy)
m (better ref)
Line 4: Line 4:




For strings I do not know, but variants of this algorithm are commonly used to search DNA databases. See for example this video: https://www.coursera.org/lecture/dna-sequencing/lecture-boyer-moore-putting-it-all-together-GuaWm --[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 03:03, 6 July 2022 (UTC)
For strings I do not know, but variants of this algorithm are commonly used to search DNA databases. See for example this paper: http://www.ijsetr.com/uploads/625413IJSETR2868-162.pdf --[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 03:03, 6 July 2022 (UTC)

Revision as of 09:13, 8 July 2022

I am not sure if this is intended to be a task.

I also am not sure how this algorithm's performance fairs against the caching mechanisms of recent machines. (Other than branch prediction issues, boyer-moore is probably not penalized by caching implementations -- unlike tree search algorithms which experience poor cache locality -- but there might be some minimum search string length necessary to see significant gains from this approach, especially in uncached contexts.) --Rdm (talk) 01:13, 6 July 2022 (UTC)


For strings I do not know, but variants of this algorithm are commonly used to search DNA databases. See for example this paper: http://www.ijsetr.com/uploads/625413IJSETR2868-162.pdf --Wherrera (talk) 03:03, 6 July 2022 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Boyer-Moore_string_search?oldid=321528"