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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n4https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-srhttp://sr.dbpedia.org/resource/
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Lexicographically_minimal_string_rotation
rdf:type
yago:Problem114410605 yago:Abstraction100002137 yago:State100024720 yago:Condition113920835 yago:Attribute100024264 dbo:Disease yago:Difficulty114408086 yago:WikicatProblemsOnStrings
rdfs:label
Lexicographically minimal string rotation
rdfs:comment
In computer science, the lexicographically minimal string rotation or lexicographically least circular substring is the problem of finding the rotation of a string possessing the lowest lexicographical order of all such rotations. For example, the lexicographically minimal rotation of "bbaaccaadd" would be "aaccaaddbb". It is possible for a string to have multiple lexicographically minimal rotations, but for most applications this does not matter as the rotations must be equivalent. Finding the lexicographically minimal rotation is useful as a way of normalizing strings. If the strings represent potentially isomorphic structures such as graphs, normalizing in this way allows for simple equality checking.A common implementation trick when dealing with circular strings is to concatenate the
dct:subject
dbc:Problems_on_strings dbc:Articles_with_example_code dbc:Lexicography
dbo:wikiPageID
35402084
dbo:wikiPageRevisionID
1100366787
dbo:wikiPageWikiLink
dbr:Knuth-Morris-Pratt_algorithm dbr:Computer_science dbr:Isomorphism dbr:String_(computer_science) dbr:Text_normalization dbr:Lexicographical_order dbr:Graph_(discrete_mathematics) dbc:Articles_with_example_code dbc:Lexicography dbr:Lyndon_word dbr:Modular_arithmetic dbc:Problems_on_strings
owl:sameAs
n4:4qATy freebase:m.0j9knqb yago-res:Lexicographically_minimal_string_rotation wikidata:Q6537716 dbpedia-sr:Leksikografski_minimalna_rotacija_niske
dbp:wikiPageUsesTemplate
dbt:Math dbt:Mvar dbt:Tmath
dbo:abstract
In computer science, the lexicographically minimal string rotation or lexicographically least circular substring is the problem of finding the rotation of a string possessing the lowest lexicographical order of all such rotations. For example, the lexicographically minimal rotation of "bbaaccaadd" would be "aaccaaddbb". It is possible for a string to have multiple lexicographically minimal rotations, but for most applications this does not matter as the rotations must be equivalent. Finding the lexicographically minimal rotation is useful as a way of normalizing strings. If the strings represent potentially isomorphic structures such as graphs, normalizing in this way allows for simple equality checking.A common implementation trick when dealing with circular strings is to concatenate the string to itself instead of having to perform modular arithmetic on the string indices.
gold:hypernym
dbr:Problem
prov:wasDerivedFrom
wikipedia-en:Lexicographically_minimal_string_rotation?oldid=1100366787&ns=0
dbo:wikiPageLength
6252
foaf:isPrimaryTopicOf
wikipedia-en:Lexicographically_minimal_string_rotation
Subject Item
dbr:Lexicographic_order
dbo:wikiPageWikiLink
dbr:Lexicographically_minimal_string_rotation
Subject Item
dbr:String_(computer_science)
dbo:wikiPageWikiLink
dbr:Lexicographically_minimal_string_rotation
Subject Item
dbr:Knuth–Morris–Pratt_algorithm
dbo:wikiPageWikiLink
dbr:Lexicographically_minimal_string_rotation
Subject Item
dbr:Lyndon_word
dbo:wikiPageWikiLink
dbr:Lexicographically_minimal_string_rotation
Subject Item
wikipedia-en:Lexicographically_minimal_string_rotation
foaf:primaryTopic
dbr:Lexicographically_minimal_string_rotation