|
(Moderator)
Registriert seit: 6. Mai 2005
Ort: Berlin
4.956 Beiträge
Delphi 2007 Enterprise
|
Re: Boyer-Moore Search
22. Jan 2009, 20:39
BM is by definition not suitable for wildcards. It uses good and bad suffix tables which are based on exact characters. So the algorithm just won't fit.
You might try looking for a variation of the Knuth-Morris-Pratt algorithm which uses wildcard characters. The KMP uses a DEA which supports wildcards.
"Wenn ist das Nunstruck git und Slotermeyer? Ja! Beiherhund das Oder die Flipperwaldt gersput!"
(Monty Python "Joke Warefare")
|