{"id":"https://openalex.org/W3207899146","doi":"https://doi.org/10.5220/0010830200003117","title":"On Solving the Minimum Common String Partition Problem by Decision Diagrams","display_name":"On Solving the Minimum Common String Partition Problem by Decision Diagrams","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W3207899146","doi":"https://doi.org/10.5220/0010830200003117","mag":"3207899146"},"language":"en","primary_location":{"id":"doi:10.5220/0010830200003117","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0010830200003117","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0010830200003117","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080226886","display_name":"Milo\u0161 Chrom\u00fd","orcid":"https://orcid.org/0000-0002-5357-1304"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Milo\u0161 Chrom\u00fd","raw_affiliation_strings":["Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz, Altenberger Stra\u00dfe 69, 4040 Linz, Austria, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz, Altenberger Stra\u00dfe 69, 4040 Linz, Austria, --- Select a Country ---","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030387525","display_name":"Markus Sinnl","orcid":"https://orcid.org/0000-0003-1439-8702"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Markus Sinnl","raw_affiliation_strings":["Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz, Altenberger Stra\u00dfe 69, 4040 Linz, Austria, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz, Altenberger Stra\u00dfe 69, 4040 Linz, Austria, --- Select a Country ---","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00570113,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"177","last_page":"184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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.9990000128746033,"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.9976999759674072,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9886000156402588,"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/substring","display_name":"Substring","score":0.6967947483062744},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5877571105957031},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5733903050422668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5732869505882263},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5205029845237732},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.509110152721405},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4272235631942749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35759732127189636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3513621687889099},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34486544132232666},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.1969415545463562},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15688994526863098}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.6967947483062744},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5877571105957031},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5733903050422668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5732869505882263},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5205029845237732},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.509110152721405},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4272235631942749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35759732127189636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3513621687889099},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34486544132232666},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.1969415545463562},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15688994526863098},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0010830200003117","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0010830200003117","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0010830200003117","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0010830200003117","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7400000095367432,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W150391644","https://openalex.org/W1567328788","https://openalex.org/W1594263046","https://openalex.org/W1597445688","https://openalex.org/W1750715882","https://openalex.org/W1899797054","https://openalex.org/W1990061958","https://openalex.org/W2003021193","https://openalex.org/W2083491745","https://openalex.org/W2896836699","https://openalex.org/W2963677182","https://openalex.org/W2963690181","https://openalex.org/W3000553024","https://openalex.org/W3017347807","https://openalex.org/W3096862630"],"related_works":["https://openalex.org/W1549987457","https://openalex.org/W2025912669","https://openalex.org/W1977789739","https://openalex.org/W2014615094","https://openalex.org/W1597445688","https://openalex.org/W2047470742","https://openalex.org/W2351778335","https://openalex.org/W1977957904","https://openalex.org/W2497180562","https://openalex.org/W2379495598"],"abstract_inverted_index":{"In":[0,70],"the":[1,22,28,31,34,75,107,111],"Minimum":[2],"Common":[3],"String":[4],"Partition":[5],"Problem":[6],"(MCSP),":[7],"we":[8,16,73],"are":[9],"given":[10],"two":[11],"strings":[12],"on":[13,88,117],"input,":[14],"and":[15,45,51,81,109,115,128],"want":[17],"to":[18,102,106],"partition":[19],"both":[20],"into":[21],"same":[23],"collection":[24],"of":[25,30,113,134],"substrings,":[26],"minimizing":[27],"number":[29],"substrings":[32],"in":[33,42],"partition.":[35],"This":[36],"combinatorial":[37],"optimization":[38],"problem":[39],"has":[40],"applications":[41],"computational":[43],"biology":[44],"is":[46,129],"NP-hard.":[47],"Many":[48],"different":[49],"heuristic":[50,104,132],"exact":[52,84],"methods":[53],"exist":[54],"for":[55,91,131],"this":[56,71],"problem,":[57],"such":[58],"as":[59,77],"a":[60,78,96],"Greedy":[61],"approach,":[62],"Ant":[63],"Colony":[64],"Optimization,":[65],"or":[66],"Integer":[67],"Linear":[68],"Programming.":[69],"paper,":[72],"formulate":[74],"MCSP":[76,108],"Dynamic":[79],"Program":[80],"develop":[82],"an":[83],"solution":[85,114,133],"algorithm":[86],"based":[87],"Decision":[89,98],"Diagrams":[90],"it.":[92],"We":[93],"also":[94],"introduce":[95],"restricted":[97],"Diagram":[99],"that":[100],"allows":[101],"compute":[103],"solutions":[105],"compare":[110],"quality":[112],"runtime":[116],"instances":[118],"from":[119],"literature":[120],"with":[121],"existing":[122],"approaches.":[123],"Our":[124],"approach":[125],"scales":[126],"well":[127],"suitable":[130],"large-scale":[135],"instances.":[136]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}