{"id":"https://openalex.org/W7143344506","doi":"https://doi.org/10.48550/arxiv.2603.26176","title":"Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements","display_name":"Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7143344506","doi":"https://doi.org/10.48550/arxiv.2603.26176"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26176","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26176","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26176","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123703469","display_name":"Ryosuke Yamano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yamano, Ryosuke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130932480","display_name":"Tetsuo Shibuya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shibuya, Tetsuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.722599983215332,"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"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.722599983215332,"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/T11269","display_name":"Algorithms and Data Compression","score":0.16300000250339508,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.043699998408555984,"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/superstring-theory","display_name":"Superstring theory","score":0.6424999833106995},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6118999719619751},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5234000086784363},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5216000080108643},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4456999897956848},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4341000020503998},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.3792000114917755}],"concepts":[{"id":"https://openalex.org/C20288","wikidata":"https://www.wikidata.org/wiki/Q1437042","display_name":"Superstring theory","level":3,"score":0.6424999833106995},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6118999719619751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6008999943733215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5965999960899353},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5234000086784363},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5216000080108643},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4456999897956848},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4341000020503998},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41600000858306885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40369999408721924},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.3792000114917755},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.3449999988079071},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26176","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26176","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26176","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26176","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5616518259048462}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,72],"Shortest":[1,41],"Common":[2,42],"Superstring":[3,43],"(SCS)":[4],"problem":[5],"is":[6,134,164],"a":[7,52,70,86,109,114,119,158,170],"fundamental":[8],"task":[9],"in":[10,29,118],"sequence":[11],"analysis.":[12],"In":[13,81],"genome":[14],"assembly,":[15],"however,":[16],"the":[17,40,62,106,125,131,149,182],"double-stranded":[18],"nature":[19],"of":[20,94,128,151],"DNA":[21,183],"implies":[22],"that":[23,55,148,162],"each":[24,58],"fragment":[25],"may":[26],"occur":[27],"either":[28,61],"its":[30,35,66],"original":[31],"orientation":[32],"or":[33,65],"as":[34,69],"reverse":[36,67],"complement.":[37],"This":[38],"motivates":[39],"with":[44],"Reverse":[45],"Complements":[46],"(SCS-RC)":[47],"problem,":[48,107],"which":[49],"asks":[50],"for":[51,57,77,181],"shortest":[53],"string":[54,63],"contains,":[56],"input":[59],"string,":[60],"itself":[64],"complement":[68],"substring.":[71],"previously":[73,144],"best-known":[74],"approximation":[75,88],"ratio":[76,93],"SCS-RC":[78,156,168],"was":[79],"$\\frac{23}{8}$.":[80],"this":[82,176],"paper,":[83],"we":[84],"present":[85],"new":[87],"algorithm":[89],"achieving":[90],"an":[91,99],"improved":[92],"$\\frac{8}{3}$.":[95],"Our":[96],"approach":[97],"computes":[98],"optimal":[100],"constrained":[101],"cycle":[102],"cover":[103],"by":[104],"reducing":[105],"via":[108],"novel":[110],"gadget":[111],"construction,":[112],"to":[113,136,155,166],"maximum-weight":[115],"perfect":[116],"matching":[117],"general":[120],"graph.":[121],"We":[122,146],"also":[123],"investigate":[124],"computational":[126],"hardness":[127,150,177],"SCS-RC.":[129],"While":[130],"decision":[132],"version":[133],"known":[135],"be":[137],"NP-complete,":[138],"no":[139],"explicit":[140],"inapproximability":[141],"results":[142],"were":[143],"established.":[145],"show":[147],"SCS":[152],"carries":[153],"over":[154],"through":[157],"polynomial-time":[159],"reduction,":[160],"implying":[161],"it":[163],"NP-hard":[165],"approximate":[167],"within":[169],"factor":[171],"better":[172],"than":[173],"$\\frac{333}{332}$.":[174],"Notably,":[175],"result":[178],"holds":[179],"even":[180],"alphabet.":[184]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-31T00:00:00"}