{"id":"https://openalex.org/W2073103034","doi":"https://doi.org/10.1016/0196-6774(83)90017-2","title":"Factorizing words over an ordered alphabet","display_name":"Factorizing words over an ordered alphabet","publication_year":1983,"publication_date":"1983-12-01","ids":{"openalex":"https://openalex.org/W2073103034","doi":"https://doi.org/10.1016/0196-6774(83)90017-2","mag":"2073103034"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(83)90017-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(83)90017-2","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5112045485","display_name":"Jean Pierre Duval","orcid":null},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean Pierre Duval","raw_affiliation_strings":["Laboratoire d'Informatique, Facult\u00e9 des Sciences, Universit\u00e9 de Rouen B.P. 67, 76130 Mo\u0144t Saint Aignan, France","Laboratoire d'Informatique, Facult\u00e9 des Sciences, Universit\u00e9 de Rouen, B.P. 67, 76130 Mont Saint Aignan, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique, Facult\u00e9 des Sciences, Universit\u00e9 de Rouen B.P. 67, 76130 Mo\u0144t Saint Aignan, France","institution_ids":["https://openalex.org/I62396329"]},{"raw_affiliation_string":"Laboratoire d'Informatique, Facult\u00e9 des Sciences, Universit\u00e9 de Rouen, B.P. 67, 76130 Mont Saint Aignan, France","institution_ids":["https://openalex.org/I62396329"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112045485"],"corresponding_institution_ids":["https://openalex.org/I62396329"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":236,"citation_normalized_percentile":{"value":0.1595112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"4","issue":"4","first_page":"363","last_page":"381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.8508245944976807},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.8400274515151978},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.8105608820915222},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.6816644668579102},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6649302840232849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6564558744430542},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.6251471638679504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.531324565410614},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.42958125472068787},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35305845737457275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3106100559234619},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.308749258518219},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.11164313554763794}],"concepts":[{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.8508245944976807},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.8400274515151978},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.8105608820915222},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.6816644668579102},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6649302840232849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6564558744430542},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6251471638679504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.531324565410614},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.42958125472068787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35305845737457275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3106100559234619},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.308749258518219},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.11164313554763794},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(83)90017-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(83)90017-2","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.4300000071525574,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W66021708","https://openalex.org/W1514324498","https://openalex.org/W1655990431","https://openalex.org/W1985108724","https://openalex.org/W1995300673","https://openalex.org/W2093599904","https://openalex.org/W2313966519"],"related_works":["https://openalex.org/W170639041","https://openalex.org/W2063841356","https://openalex.org/W2949482180","https://openalex.org/W4298668117","https://openalex.org/W2949533829","https://openalex.org/W2064184672","https://openalex.org/W2170862288","https://openalex.org/W2501071811","https://openalex.org/W3102384285","https://openalex.org/W2073103034"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}
