Apostolico–Giancarlo algorithm
id:
apostolico-giancarlo-algorithm-239-17624533
title:
Apostolico–Giancarlo algorithm
text:
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. Ap
brand slug:
wiki
category slug:
encyclopedia
description:
Optimization of Boyer–Moore string-search algorithm
original url:
https://en.wikipedia.org/wiki/Apostolico%E2%80%93Giancarlo_algorithm
date created:
date modified:
2023-10-20T17:10:32Z
main entity:
{"identifier":"Q4780701","url":"https://www.wikidata.org/entity/Q4780701"}
image:
fields total:
13
integrity:
14