{"id":"https://openalex.org/W1969428672","doi":"https://doi.org/10.1016/0304-3975(92)90137-5","title":"Optimal algorithms for computing the canonical form of a circular string","display_name":"Optimal algorithms for computing the canonical form of a circular string","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1969428672","doi":"https://doi.org/10.1016/0304-3975(92)90137-5","mag":"1969428672"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(92)90137-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(92)90137-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["Royal Holloway College, University of London, Department of Computer Science, Egham TW20 0EX, England"],"affiliations":[{"raw_affiliation_string":"Royal Holloway College, University of London, Department of Computer Science, Egham TW20 0EX, England","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108477315","display_name":"W.F. Smyth","orcid":null},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]},{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["AU","CA"],"is_corresponding":false,"raw_author_name":"W.F. Smyth","raw_affiliation_strings":["Department of Computer Science and Systems, McMaster University, Hamilton, Ontario, Canada L8S4K1","School of Computing Science, Curtin University, GPO Box U-1981, Perth WA 6001, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Systems, McMaster University, Hamilton, Ontario, Canada L8S4K1","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"School of Computing Science, Curtin University, GPO Box U-1981, Perth WA 6001, Australia","institution_ids":["https://openalex.org/I205640436"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058155947"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.7902,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.90101721,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"92","issue":"1","first_page":"87","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7846652269363403},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6976821422576904},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6962641477584839},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6745746731758118},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6706678867340088},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5941548347473145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5594381093978882},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.538930356502533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5113248229026794},{"id":"https://openalex.org/keywords/rotation","display_name":"Rotation (mathematics)","score":0.45971089601516724},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4583567678928375},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.448354572057724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35453128814697266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3432389497756958}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7846652269363403},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6976821422576904},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6962641477584839},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6745746731758118},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6706678867340088},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5941548347473145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5594381093978882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.538930356502533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5113248229026794},{"id":"https://openalex.org/C74050887","wikidata":"https://www.wikidata.org/wiki/Q848368","display_name":"Rotation (mathematics)","level":2,"score":0.45971089601516724},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4583567678928375},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.448354572057724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35453128814697266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3432389497756958},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0304-3975(92)90137-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(92)90137-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:researchrepository.murdoch.edu.au:27508","is_oa":false,"landing_page_url":"http://researchrepository.murdoch.edu.au/id/eprint/27508/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400274","display_name":"Murdoch Research Repository (Murdoch University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I176790772","host_organization_name":"Murdoch University","host_organization_lineage":["https://openalex.org/I176790772"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"  Iliopoulos, C.S. and Smyth, W.F. &lt;http://researchrepository.murdoch.edu.au/view/author/Smyth, William.html&gt;   (1992) Optimal algorithms for computing the canonical form of a circular string.   Theoretical Computer Science, 92  (1).   pp. 87-105.  ","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1974803623","https://openalex.org/W1985108724","https://openalex.org/W1986597203","https://openalex.org/W1995300673","https://openalex.org/W2003200876","https://openalex.org/W2027142120","https://openalex.org/W2073103034","https://openalex.org/W2093599904","https://openalex.org/W6659015802"],"related_works":["https://openalex.org/W1581210843","https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W2018076478","https://openalex.org/W1529390395","https://openalex.org/W1982530285","https://openalex.org/W2804770727","https://openalex.org/W2611723985","https://openalex.org/W2515993118","https://openalex.org/W1830048115"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
