Apostolico–Giancarlo algorithm

In computer science, the Apostolico–Giancarlo algorithm is a variant of the Boyer–Moore string search algorithm, the basic application of which is searching for occurrences of a pattern $P$ in a text $T$ . As with other comparison-based string searches, this is done by aligning $P$ to a certain index of $T$ and checking whether a match occurs at that index. $P$ is then shifted relative to $T$ according to the rules of the Boyer-Moore algorithm, and the process repeats until the end of $T$ has been reached. Application of the Boyer-Moore shift rules often results in large chunks of the text being skipped entirely.

With regard to the shift operation, Apostolico-Giancarlo is exactly equivalent in functionality to Boyer-Moore. The utility of Apostolico-Giancarlo is to speed up the match-checking operation at any index. With Boyer-Moore, finding an occurrence of $P$ in $T$ requires that all $n$ characters of $P$ be explicitly matched. For certain patterns and texts, this is very inefficient - a simple example is when both pattern and text consist of the same repeated character, in which case Boyer-Moore runs in $O(nm)$ where $m$ is the length in characters of $T$ . Apostolico-Giancarlo speeds this up by recording the number of characters matched at the alignments of $T$ in a table, which is combined with data gathered during the pre-processing of $P$ to avoid redundant equality checking for sequences of characters that are known to match.

References

Apostolico A., Giancarlo R., 1986, The Boyer-Moore-Galil string searching strategies revisited, SIAM Journal on Computing 15(1):98-105. doi: 10.1137/0215007.
Crochemore, M., Lecroq, T., 1997, Tight bounds on the complexity of the Apostolico–Giancarlo algorithm, Information Processing Letters 63(4):195-203. doi: 10.1016/S0020-0190(97)00107-5.
Crochemore, M., Rytter, W., 1994, Text Algorithms, Oxford University Press.
Gusfield, D., 1997, Algorithms on strings, trees, and sequences: Computer Science and Computational Biology, Cambridge University Press. ISBN 0-521-58519-8.
Lecroq, T., 1992, Recherches de mot, Ph. D. Thesis, University of Orléans, France.
Lecroq, T., 1995, Experimental results on string matching algorithms, Software - Practice & Experience 25(7):727-765. doi: 10.1002/spe.4380250703.

Strings

String metric	Approximate string matching Bitap algorithm Damerau–Levenshtein distance Edit distance Hamming distance Jaro–Winkler distance Lee distance Levenshtein automaton Levenshtein distance Wagner–Fischer algorithm

String searching algorithm	Apostolico–Giancarlo algorithm Boyer–Moore string search algorithm Boyer–Moore–Horspool algorithm Knuth–Morris–Pratt algorithm Rabin–Karp string search algorithm

Multiple string searching	Aho–Corasick Commentz-Walter algorithm Rabin–Karp

Regular expression	Comparison of regular expression engines Regular tree grammar Thompson's construction Nondeterministic finite automaton

Sequence alignment	Hirschberg's algorithm Needleman–Wunsch algorithm Smith–Waterman algorithm

Data structures	DAFSA Suffix array Suffix automaton Suffix tree Generalized suffix tree Rope Ternary search tree Trie

Other	Parsing Pattern matching Compressed pattern matching Longest common subsequence Longest common substring Sequential pattern mining Sorting

This article is issued from Wikipedia - version of the 12/3/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.