Pages that link to "Item:Q3891776"

The following pages link to A Correct Preprocessing Algorithm for Boyer–Moore String-Searching (Q3891776):

Displaying 10 items.

• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
• A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
• A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
• A variation on the Boyer-Moore algorithm (Q1190458) (← links)
• Speeding up two string-matching algorithms (Q1336956) (← links)
• Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm (Q1853605) (← links)
• (Q3143774) (← links)
• A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences (Q4792964) (← links)
• Fast algorithms for two dimensional and multiple pattern matching (Q5056115) (← links)
• Speeding up two string-matching algorithms (Q5096813) (← links)