{"id":"https://openalex.org/W3211845283","doi":"https://doi.org/10.1145/3519935.3520001","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":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3211845283","doi":"https://doi.org/10.1145/3519935.3520001","mag":"3211845283"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520001","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","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/A5007064425","display_name":"Matthias Englert","orcid":"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":true,"raw_author_name":"Matthias Englert","raw_affiliation_strings":["University of Warwick, UK"],"affiliations":[{"raw_affiliation_string":"University of Warwick, UK","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"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolaos Matsakis","raw_affiliation_strings":["n.n., n.n"],"affiliations":[{"raw_affiliation_string":"n.n., n.n","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022904512","display_name":"Pavel Vesel\u00fd","orcid":"https://orcid.org/0000-0003-1169-7934"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Vesel\u00fd","raw_affiliation_strings":["Charles University in Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Charles University in Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007064425"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.78319528,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69214247,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"317","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9947999715805054,"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.9842000007629395,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/superstring-theory","display_name":"Superstring theory","score":0.8939327001571655},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6131711602210999},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6116341352462769},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5881320834159851},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47828325629234314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4547244608402252},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4206656217575073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40020260214805603},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39252761006355286}],"concepts":[{"id":"https://openalex.org/C20288","wikidata":"https://www.wikidata.org/wiki/Q1437042","display_name":"Superstring theory","level":3,"score":0.8939327001571655},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6131711602210999},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6116341352462769},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5881320834159851},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47828325629234314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4547244608402252},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4206656217575073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40020260214805603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39252761006355286},{"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/C116674579","wikidata":"https://www.wikidata.org/wiki/Q193442","display_name":"Supersymmetry","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3519935.3520001","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:164501","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W56066823","https://openalex.org/W140110130","https://openalex.org/W322125272","https://openalex.org/W610283090","https://openalex.org/W938539187","https://openalex.org/W1488861257","https://openalex.org/W1534895432","https://openalex.org/W1547966682","https://openalex.org/W1989048084","https://openalex.org/W2011039300","https://openalex.org/W2022630275","https://openalex.org/W2035314514","https://openalex.org/W2036145579","https://openalex.org/W2037050365","https://openalex.org/W2061753037","https://openalex.org/W2076047621","https://openalex.org/W2080721852","https://openalex.org/W2090223576","https://openalex.org/W2091254169","https://openalex.org/W2101468281","https://openalex.org/W2102403605","https://openalex.org/W2102706148","https://openalex.org/W2111953579","https://openalex.org/W2113212473","https://openalex.org/W2122132398","https://openalex.org/W2130200244","https://openalex.org/W2134761228","https://openalex.org/W2158420218","https://openalex.org/W2167197687","https://openalex.org/W2468861611","https://openalex.org/W2886476296","https://openalex.org/W2950973021","https://openalex.org/W6947970972"],"related_works":["https://openalex.org/W3110381201","https://openalex.org/W2100866734","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W189401716","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2898570308","https://openalex.org/W2544904580"],"abstract_inverted_index":{"In":[0],"the":[1,22,46,79],"Shortest":[2,28],"Superstring":[3,29],"problem,":[4,74],"we":[5,13],"are":[6,14,38],"given":[7],"a":[8,17,58],"set":[9],"of":[10,25,54],"strings":[11,53],"and":[12,33,81],"asking":[15],"for":[16,40,72],"common":[18],"superstring,":[19],"which":[20,49],"has":[21,75],"minimum":[23],"number":[24],"characters.":[26],"The":[27,62],"problem":[30],"is":[31,45,82],"NP-hard":[32],"several":[34],"constant-factor":[35],"approximation":[36,70],"algorithms":[37,71],"known":[39],"it.":[41],"Of":[42],"particular":[43],"interest":[44],"GREEDY":[47,63],"algorithm,":[48,64],"repeatedly":[50],"merges":[51],"two":[52],"maximum":[55],"overlap":[56],"until":[57],"single":[59],"string":[60],"remains.":[61],"being":[65],"simpler":[66],"than":[67],"other":[68],"well-performing":[69],"this":[73],"attracted":[76],"attention":[77],"since":[78],"1980s":[80],"commonly":[83],"used":[84],"in":[85],"practical":[86],"applications.":[87]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}