{"id":"https://openalex.org/W7110420924","doi":"https://doi.org/10.4230/lipics.cpm.2025.13","title":"Doubly-Periodic String Comparison","display_name":"Doubly-Periodic String Comparison","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110420924","doi":"https://doi.org/10.4230/lipics.cpm.2025.13"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23107","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.13/LIPIcs.CPM.2025.13.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.13/LIPIcs.CPM.2025.13.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gaevoy, Nikita","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gaevoy, Nikita","raw_affiliation_strings":["Department of Mathematics and Computer Science, St. Petersburg State University, Russia; The Faculty of Data and Decision Sciences, Technion, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, St. Petersburg State University, Russia; The Faculty of Data and Decision Sciences, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Zolotov, Boris","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Zolotov, Boris","raw_affiliation_strings":["Department of Mathematics and Computer Science, St. Petersburg State University, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, St. Petersburg State University, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tiskin, Alexander","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Tiskin, Alexander","raw_affiliation_strings":["Department of Mathematics and Computer Science, St. Petersburg State University, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, St. Petersburg State University, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75391369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6703000068664551,"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.6703000068664551,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.1703999936580658,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.015799999237060547,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7314000129699707},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6485999822616577},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5390999913215637},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4537000060081482},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4036000072956085},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.3944000005722046},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.3840000033378601},{"id":"https://openalex.org/keywords/period-length","display_name":"Period length","score":0.383899986743927},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.3140999972820282}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7314000129699707},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6485999822616577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5514000058174133},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5390999913215637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4844000041484833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46209999918937683},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4537000060081482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4242999851703644},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4036000072956085},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C2910820772","wikidata":"https://www.wikidata.org/wiki/Q184743","display_name":"Period length","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.3140999972820282},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C13052355","wikidata":"https://www.wikidata.org/wiki/Q5152399","display_name":"Commentz-Walter algorithm","level":4,"score":0.30160000920295715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.2761000096797943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27469998598098755},{"id":"https://openalex.org/C120241303","wikidata":"https://www.wikidata.org/wiki/Q3503302","display_name":"Periodic sequence","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23107","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.13/LIPIcs.CPM.2025.13.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23107","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.13/LIPIcs.CPM.2025.13.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110420924.pdf","grobid_xml":"https://content.openalex.org/works/W7110420924.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,56,90,167],"longest":[1,24],"common":[2],"subsequence":[3,29],"(LCS)":[4],"problem":[5,17],"is":[6,27,42,65,92,160],"a":[7,12,28,131,134,143,161],"fundamental":[8],"algorithmic":[9],"problem.":[10],"Given":[11,126],"pair":[13],"of":[14,22,38,50,61,123,133,136,142,145,184,194],"strings,":[15],"the":[16,20,23,35,62,80,95,100,105,148,173,192],"asks":[18],"for":[19,79,99],"length":[21,137,146],"string":[25],"that":[26,129],"in":[30,71,108,152],"both":[31,49,85],"input":[32,51,63,86,127,186],"strings.":[33],"Among":[34],"many":[36],"relatives":[37],"this":[39,72,112],"problem,":[40,102],"there":[41],"its":[43],"natural":[44],"version":[45],"where":[46,58,84],"one":[47,60,180],"or":[48],"strings":[52,64,87,128,187],"have":[53],"periodic":[54,66,185],"structure.":[55],"case":[57,83],"only":[59],"has":[67,169],"been":[68,170],"considered":[69],"before;":[70],"work,":[73],"we":[74,110],"develop":[75],"an":[76,140],"efficient":[77],"algorithm":[78,91,150,168],"more":[81],"difficult":[82],"are":[88,130],"periodic.":[89],"based":[93],"on":[94],"existing":[96,165],"algebraic":[97],"framework":[98,113],"LCS":[101],"developed":[103],"by":[104,172,176],"third":[106],"author;":[107,175],"particular,":[109],"extend":[111],"to":[114],"dealing":[115],"with":[116,188],"affine":[117],"(i.e.":[118],"doubly-infinite":[119],"periodic)":[120],"permutations":[121],"instead":[122],"finite":[124],"ones.":[125],"k-repeat":[132],"period":[135,144],"m":[138],"and":[139],"\ud835\udcc1-repeat":[141],"n,":[147],"resulting":[149],"runs":[151],"time":[153],"O(mn+n":[154],"log":[155,157],"n":[156],"k),":[158],"which":[159],"substantial":[162],"improvement":[163],"over":[164],"approaches.":[166],"implemented":[171],"first":[174],"running":[177],"his":[178],"code,":[179],"can":[181],"process":[182],"pairs":[183],"lengths":[189],"far":[190],"beyond":[191],"reach":[193],"all":[195],"known":[196],"alternative":[197],"algorithms.":[198]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-08T00:00:00"}