Pulse Explorar nav.journalClub Debates Tendencias Investigadores

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

Inicio Explorar nav.journalClub Tendencias

⌘+K

On improving the worst case running time of the Boyer-Moore string matching algorithm | Synapse

September 1, 1979Open Access

On improving the worst case running time of the Boyer-Moore string matching algorithm

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Cite This Study

Zvi Galil (Sat,) studied this question.

synapsesocial.com/papers/6a0ccc4c6d2ea0967e4a4690 https://doi.org/https://doi.org/10.1145/359146.359148

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo