{"id":"https://openalex.org/W7224082015","doi":"https://doi.org/10.82444/warw.34831980","title":"Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios","display_name":"Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios","publication_year":2026,"publication_date":"2026-10-28","ids":{"openalex":"https://openalex.org/W7224082015","doi":"https://doi.org/10.82444/warw.34831980"},"language":"en","primary_location":{"id":"doi:10.82444/warw.34831980","doi":"https://doi.org/10.82444/warw.34831980","is_oa":true,"landing_page_url":"https://doi.org/10.82444/warw.34831980","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},"volume":null,"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.82444/warw.34831980","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007064425","display_name":"Matthias Englert","orcid":"https://orcid.org/0000-0002-8859-7731","observed_orcids":["https://orcid.org/0000-0002-8859-7731"]},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthias Englert","raw_affiliation_strings":["University of Warwick"],"raw_orcid":"https://orcid.org/0000-0002-8859-7731","affiliations":[{"raw_affiliation_string":"University of Warwick","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031365316","display_name":"Nicolaos Matsakis","orcid":"https://orcid.org/0000-0002-0386-749X","observed_orcids":["https://orcid.org/0000-0002-0386-749X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolaos Matsakis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022904512","display_name":"Pavel Vesel\u00fd","orcid":"https://orcid.org/0000-0003-1169-7934","observed_orcids":["https://orcid.org/0000-0003-1169-7934"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavel Vesely","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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.85136516,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6499000191688538,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6499000191688538,"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/T11269","display_name":"Algorithms and Data Compression","score":0.3452000021934509,"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/T12288","display_name":"Optimization and Search Problems","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/approximation-algorithms","display_name":"approximation algorithms","score":0.8769999742507935},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.7590000033378601},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.675000011920929},{"id":"https://openalex.org/keywords/constant-factor-approximation","display_name":"constant-factor approximation","score":0.6679999828338623},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6179999709129333}],"concepts":[{"id":"https://openalex.org/C20288","wikidata":"https://www.wikidata.org/wiki/Q1437042","display_name":"Superstring theory","level":3,"score":0.8765000104904175},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6801000237464905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.660099983215332},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6093999743461609},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5501000285148621},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.489300012588501},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4115999937057495},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.3522000014781952},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.2973000109195709},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.82444/warw.34831980","doi":"https://doi.org/10.82444/warw.34831980","is_oa":true,"landing_page_url":"https://doi.org/10.82444/warw.34831980","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"doi:10.82444/warw.34831980.v1","doi":"https://doi.org/10.82444/warw.34831980.v1","is_oa":true,"landing_page_url":"https://doi.org/10.82444/warw.34831980.v1","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"doi:10.82444/warw.34831980","doi":"https://doi.org/10.82444/warw.34831980","is_oa":true,"landing_page_url":"https://doi.org/10.82444/warw.34831980","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W6929346149","https://openalex.org/W7098050223","https://openalex.org/W7206150774","https://openalex.org/W6948200500","https://openalex.org/W7203900625","https://openalex.org/W1482447760","https://openalex.org/W2091254169","https://openalex.org/W7214164278","https://openalex.org/W1488861257","https://openalex.org/W2411613359"],"abstract_inverted_index":{"In":[0,72],"the":[1,22,46,86,111,128,146],"Shortest":[2,28,129],"Superstring":[3,29,130],"problem,":[4],"we":[5,13,125],"are":[6,14,38],"given":[7],"a":[8,17,58,73,92,135],"set":[9],"of":[10,25,54,114,137],"strings":[11,53],"and":[12,33,63,80,94,104],"asking":[15],"for":[16,40],"common":[18],"superstring,":[19],"which":[20,49],"has":[21],"minimum":[23],"number":[24],"characters.":[26],"The":[27],"problem":[30],"is":[31,45,70,91,116],"NP-hard":[32],"several":[34],"constant-factor":[35],"approximation":[36,112],"algorithms":[37],"known":[39],"it.":[41],"Of":[42],"particular":[43],"interest":[44],"Greedy":[47,69,90,115],"algorithm,":[48],"repeatedly":[50],"merges":[51],"two":[52],"maximum":[55],"overlap":[56],"until":[57],"single":[59],"string":[60],"remains.":[61],"Tarhio":[62],"Ukkonen":[64],"(TCS":[65],"1988)":[66],"conjectured":[67],"that":[68,85,110,127],"2-approximate.":[71],"seminal":[74],"work,":[75],"Blum,":[76],"Jiang,":[77],"Li,":[78],"Tromp,":[79],"Yannakakis":[81],"(STOC":[82],"1991)":[83],"proved":[84],"superstring":[87],"computed":[88],"by":[89,102,154],"4-approximation,":[93],"this":[95],"upper":[96],"bound":[97],"was":[98],"improved":[99],"to":[100],"3.5":[101],"Kaplan":[103],"Shafrir":[105],"(IPL":[106],"2005).":[107],"We":[108],"show":[109],"guarantee":[113],"at":[117],"most":[118],"\u221a":[119,138],"67+2":[120],"3":[121],"\u2248":[122,141],"3.396.":[123],"Furthermore,":[124],"prove":[126],"can":[131],"be":[132],"approximated":[133],"within":[134],"factor":[136],"67+14":[139],"9":[140],"2.466,":[142],"improving":[143],"slightly":[144],"upon":[145],"currently":[147],"best":[148],"2":[149],"11":[150],"23":[151],"-approximation":[152],"algorithm":[153],"Mucha":[155],"(SODA":[156],"2013).":[157]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2026-10-29T00:00:00"}