{"id":"https://openalex.org/W3087991744","doi":"https://doi.org/10.3390/a13110294","title":"Computing Maximal Lyndon Substrings of a String","display_name":"Computing Maximal Lyndon Substrings of a String","publication_year":2020,"publication_date":"2020-11-12","ids":{"openalex":"https://openalex.org/W3087991744","doi":"https://doi.org/10.3390/a13110294","mag":"3087991744"},"language":"en","primary_location":{"id":"doi:10.3390/a13110294","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110294","pdf_url":"https://www.mdpi.com/1999-4893/13/11/294/pdf?version=1606357181","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/11/294/pdf?version=1606357181","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025523396","display_name":"Franti\u0161ek Fran\u011bk","orcid":"https://orcid.org/0000-0002-4110-2113"},"institutions":[{"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":["CA"],"is_corresponding":false,"raw_author_name":"Frantisek Franek","raw_affiliation_strings":["Department of Computing and Software, McMaster University, Hamilton, ON L8S 4K1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, ON L8S 4K1, Canada","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017029944","display_name":"Michael Liut","orcid":"https://orcid.org/0000-0003-2965-5302"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Michael Liut","raw_affiliation_strings":["Department of Mathematical and Computational Sciences, University of Toronto Mississauga, Mississauga, ON L5L 1C6, Canada"],"raw_orcid":"https://orcid.org/0000-0003-2965-5302","affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computational Sciences, University of Toronto Mississauga, Mississauga, ON L5L 1C6, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017029944"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1304,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55113004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"11","first_page":"294","last_page":"294"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.9264695644378662},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.65035080909729},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.6241673827171326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5872551202774048},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5693034529685974},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.5484902262687683},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5394557118415833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5178647041320801},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5007073879241943},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4793689548969269},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.4768418073654175},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.47201818227767944},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.42699486017227173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3640965521335602},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3502911329269409},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2859717607498169}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9264695644378662},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.65035080909729},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.6241673827171326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5872551202774048},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5693034529685974},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.5484902262687683},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5394557118415833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5178647041320801},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5007073879241943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4793689548969269},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.4768418073654175},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.47201818227767944},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.42699486017227173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3640965521335602},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3502911329269409},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2859717607498169},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a13110294","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110294","pdf_url":"https://www.mdpi.com/1999-4893/13/11/294/pdf?version=1606357181","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:utoronto.scholaris.ca:1807/102746","is_oa":true,"landing_page_url":"http://hdl.handle.net/1807/102746","pdf_url":"https://utoronto.scholaris.ca/bitstreams/31274fe7-3288-449b-8982-65ffab44067a/download","source":{"id":"https://openalex.org/S4306400261","display_name":"TSpace (University of Toronto)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I185261750","host_organization_name":"University of Toronto","host_organization_lineage":["https://openalex.org/I185261750"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:67de28ce3d494ed3a8b54b47a6e14723","is_oa":true,"landing_page_url":"https://doaj.org/article/67de28ce3d494ed3a8b54b47a6e14723","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 11, p 294 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/11/294/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13110294","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 13; Issue 11; Pages: 294","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13110294","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110294","pdf_url":"https://www.mdpi.com/1999-4893/13/11/294/pdf?version=1606357181","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6930459443","display_name":null,"funder_award_id":"RGPIN/5504-2018","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3087991744.pdf","grobid_xml":"https://content.openalex.org/works/W3087991744.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W82544137","https://openalex.org/W1514324498","https://openalex.org/W1586417893","https://openalex.org/W1976395511","https://openalex.org/W1977174119","https://openalex.org/W1986197414","https://openalex.org/W1994182156","https://openalex.org/W2049646746","https://openalex.org/W2057452256","https://openalex.org/W2060547410","https://openalex.org/W2061171222","https://openalex.org/W2063841356","https://openalex.org/W2073103034","https://openalex.org/W2092245166","https://openalex.org/W2097540673","https://openalex.org/W2107079154","https://openalex.org/W2120749565","https://openalex.org/W2130564474","https://openalex.org/W2139749722","https://openalex.org/W2152736125","https://openalex.org/W2161151382","https://openalex.org/W2169708967","https://openalex.org/W2199929370","https://openalex.org/W2313966519","https://openalex.org/W2418403027","https://openalex.org/W2576782855","https://openalex.org/W2766136522","https://openalex.org/W2784266189","https://openalex.org/W2990480882","https://openalex.org/W2991221851","https://openalex.org/W3003477910","https://openalex.org/W3091805329","https://openalex.org/W3098936105","https://openalex.org/W3105923835","https://openalex.org/W6664775227","https://openalex.org/W6717025799","https://openalex.org/W6751481364","https://openalex.org/W6770460738","https://openalex.org/W6770824298","https://openalex.org/W6773462180"],"related_works":["https://openalex.org/W2063841356","https://openalex.org/W2405149725","https://openalex.org/W2003608043","https://openalex.org/W2118703123","https://openalex.org/W1593730394","https://openalex.org/W1568850903","https://openalex.org/W75168880","https://openalex.org/W2736693933","https://openalex.org/W4379644220","https://openalex.org/W2560606564"],"abstract_inverted_index":{"There":[0],"are":[1],"two":[2,110,270],"reasons":[3],"to":[4,28,148,244,284],"have":[5],"an":[6,172],"efficient":[7],"algorithm":[8,27,75,121,127,156,196,204,243,258],"for":[9,89,113,128,158,165,197,259],"identifying":[10],"all":[11,30,39],"right-maximal":[12,40,63,99],"Lyndon":[13,41,64,92,100,116,129,199,247],"substrings":[14,42,65,101],"of":[15,32,43,58,66,76,87,98,102,185,234,249,256,268,276,278],"a":[16,25,33,55,67,71,84,118,132,169,194,241,250],"string:":[17],"firstly,":[18],"Bannai":[19],"et":[20,50,81],"al.":[21,51,82],"introduced":[22],"in":[23,53,207],"2015":[24],"linear":[26,56,133,138,166,206,242],"compute":[29,245],"runs":[31],"string":[34,251],"that":[35,94,180],"relies":[36],"on":[37,123,137],"knowing":[38],"the":[44,91,96,103,115,124,142,150,198,202,208,222,246,265,285],"input":[45,104],"string,":[46,68],"and":[47,61,131,146,211,228,272],"secondly,":[48],"Franek":[49,80],"showed":[52],"2017":[54],"equivalence":[57],"sorting":[59,62,74],"suffixes":[60],"inspired":[69,252],"by":[70,253],"novel":[72,195],"suffix":[73,139,144,167,260],"Baier.":[77],"In":[78,188,237],"2016,":[79],"presented":[83,108,240],"brief":[85],"overview":[86],"algorithms":[88,112,271],"computing":[90,114,141],"array":[93,248],"encodes":[95],"knowledge":[97],"string.":[105],"Among":[106],"those":[107],"were":[109,182],"well-known":[111],"array:":[117],"quadratic":[119],"in-place":[120],"based":[122,136],"iterated":[125,286],"Duval":[126,287],"factorization":[130],"algorithmic":[134],"scheme":[135],"sorting,":[140,168],"inverse":[143],"array,":[145],"applying":[147],"it":[149,216,220],"next":[151],"smaller":[152],"value":[153],"algorithm.":[154,187,288],"Duval\u2019s":[155],"works":[157],"strings":[159],"over":[160],"any":[161],"ordered":[162],"alphabet,":[163],"while":[164],"constant":[170],"or":[171],"integer":[173],"alphabet":[174],"is":[175,205,217],"required.":[176],"The":[177],"authors":[178],"at":[179],"time":[181],"not":[183],"aware":[184],"Baier\u2019s":[186,257],"2017,":[189],"our":[190],"research":[191],"group":[192],"proposed":[193,203],"array.":[200],"Though":[201],"average":[209],"case":[210],"has":[212],"O(nlog(n))":[213],"worst-case":[214],"complexity,":[215],"interesting":[218],"as":[219],"emulates":[221],"fast":[223],"Fourier":[224],"algorithm\u2019s":[225],"recursive":[226],"approach":[227],"introduces":[229],"\u03c4-reduction,":[230],"which":[231],"might":[232],"be":[233],"independent":[235],"interest.":[236],"2018,":[238],"we":[239],"Phase":[254],"I":[255],"sorting.":[261],"This":[262],"paper":[263],"presents":[264],"theoretical":[266],"analysis":[267],"these":[269],"provides":[273],"empirical":[274],"comparisons":[275],"both":[277],"their":[279],"C++":[280],"implementations":[281],"with":[282],"respect":[283]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}