HTML Microdata document

This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n13	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
n20	https://docs.lib.purdue.edu/cgi/
rdfs	http://www.w3.org/2000/01/rdf-schema#
n19	https://hal-upec-upem.archives-ouvertes.fr/hal-00619574/file/
dbpedia-sr	http://sr.dbpedia.org/resource/
freebase	http://rdf.freebase.com/ns/
n4	http://dbpedia.org/resource/Software:
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
dbpedia-fr	http://fr.dbpedia.org/resource/
wikipedia-en	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Boyer–Moore_string-search_algorithm
dbo:wikiPageWikiLink: dbr:Apostolico–Giancarlo_algorithm

Subject Item: dbr:Apostolico–Giancarlo_algorithm
rdfs:label: Algorithme d'Apostolico-Giancarlo Apostolico–Giancarlo algorithm
rdfs:comment: En informatique, l’algorithme de Apostolico–Giancarlo est une variante de l’algorithme de recherche de chaîne Boyer–Moore dont l'utilisation de base est la recherche d’occurrences d’un motif dans un texte . 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 in a text . As with other comparison-based string searches, this is done by aligning to a certain index of and checking whether a match occurs at that index. is then shifted relative to according to the rules of the Boyer–Moore algorithm, and the process repeats until the end of has been reached. Application of the Boyer-Moore shift rules often results in large chunks of the text being skipped entirely.
dcterms:subject: dbc:String_matching_algorithms
dbo:wikiPageID: 17267309
dbo:wikiPageRevisionID: 1054077165
dbo:wikiPageWikiLink: n4:_Practice_and_Experience dbr:Computer_science dbr:Cambridge_University_Press dbr:Galil_rule dbr:Information_Processing_Letters dbr:Oxford_University_Press dbr:SIAM_Journal_on_Computing dbr:University_of_Orléans dbr:Boyer–Moore_string_search_algorithm dbc:String_matching_algorithms
dbo:wikiPageExternalLink: n19:ipl2.pdf n20:viewcontent.cgi%3Farticle=1456&context=cstech
owl:sameAs: n13:4RHuV wikidata:Q4780701 dbpedia-fr:Algorithme_d'Apostolico-Giancarlo freebase:m.043qp_1 dbpedia-sr:Apostoliko–Đankarlov_algoritam
dbp:wikiPageUsesTemplate: dbt:Cite_thesis dbt:Cite_journal dbt:Strings dbt:Short_description dbt:Cite_book
dbo:abstract: 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 in a text . As with other comparison-based string searches, this is done by aligning to a certain index of and checking whether a match occurs at that index. is then shifted relative to according to the rules of the Boyer–Moore algorithm, and the process repeats until the end of 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 in requires that all characters of 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 , where is the length in characters of . Apostolico–Giancarlo speeds this up by recording the number of characters matched at the alignments of in a table, which is combined with data gathered during the pre-processing of to avoid redundant equality checking for sequences of characters that are known to match. It can be seen as a generalization of the Galil rule. En informatique, l’algorithme de Apostolico–Giancarlo est une variante de l’algorithme de recherche de chaîne Boyer–Moore dont l'utilisation de base est la recherche d’occurrences d’un motif dans un texte . Comme avec d’autres recherches de chaîne par comparaison, la recherche se fait en alignant à un index particulier de et en vérifiant s’il y a concordance à cet endroit. est ensuite décalé par rapport à en suivant les règles de l’algorithme de Boyer-Moore, et le processus se répète jusqu'à atteindre la fin de . L’application des règles de décalage de Boyer-Moore aboutit souvent à sauter complètement de grandes parties du texte.Concernant l’opération de décalage, Apostolico-Giancarlo est l’exact équivalent fonctionnel de Boyer-Moore. L'utilité de Apostolico-Giancarlo est d'accélérer l’opération de vérification de la concordance à un index donné. Avec Boyer-Moore, trouver une occurrence de dans exige que l’ensemble des caractères de corresponde explicitement. Pour certains motifs et textes, c’est très inefficace. Un exemple simple est celui où le motif et le texte consistent tous deux en un même caractère répété. Dans ce cas, Boyer-Moore s’exécute en , où est la longueur de en caractères. Apostolico-Giancarlo accélère le processus en enregistrant le nombre de caractères qui correspondent aux alignements de dans une table, qui est combinée aux données recueillies lors du pré-traitement de pour éviter les vérifications d’égalité redondantes pour les suites de caractères que l’on sait correspondre.
prov:wasDerivedFrom: wikipedia-en:Apostolico–Giancarlo_algorithm?oldid=1054077165&ns=0
dbo:wikiPageLength: 3347
foaf:isPrimaryTopicOf: wikipedia-en:Apostolico–Giancarlo_algorithm

Subject Item: dbr:Apostolico-Giancarlo_algorithm
dbo:wikiPageWikiLink: dbr:Apostolico–Giancarlo_algorithm
dbo:wikiPageRedirects: dbr:Apostolico–Giancarlo_algorithm

Subject Item: dbr:List_of_terms_relating_to_algorithms_and_data_structures
dbo:wikiPageWikiLink: dbr:Apostolico–Giancarlo_algorithm

Subject Item: wikipedia-en:Apostolico–Giancarlo_algorithm
foaf:primaryTopic: dbr:Apostolico–Giancarlo_algorithm