{"id":"https://openalex.org/W7163925230","doi":"https://doi.org/10.4230/lipics.cpm.2026.15","title":"Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements","display_name":"Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163925230","doi":"https://doi.org/10.4230/lipics.cpm.2026.15"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25941","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.15/LIPIcs.CPM.2026.15.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":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.15/LIPIcs.CPM.2026.15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119712286","display_name":"Ryosuke Yamano","orcid":null},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]},{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yamano, Ryosuke","raw_affiliation_strings":["Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Japan","Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan"],"raw_orcid":"https://orcid.org/0009-0002-1683-5179","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I4210098918"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043159528","display_name":"Tetsuo Shibuya","orcid":"https://orcid.org/0000-0003-1514-5766"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shibuya, Tetsuo","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1514-5766","affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I4210098918"]}]}],"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":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.92853549,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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.20239999890327454,"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.20239999890327454,"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.15330000221729279,"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/T12029","display_name":"DNA and Biological Computing","score":0.09790000319480896,"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.847599983215332},{"id":"https://openalex.org/keywords/superstring-theory","display_name":"Superstring theory","score":0.7204999923706055},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.650600016117096},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5637000203132629},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42579999566078186},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4023999869823456},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.3562999963760376}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.847599983215332},{"id":"https://openalex.org/C20288","wikidata":"https://www.wikidata.org/wiki/Q1437042","display_name":"Superstring theory","level":3,"score":0.7204999923706055},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.650600016117096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5864999890327454},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4657999873161316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.428600013256073},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42579999566078186},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3343999981880188},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.3248000144958496},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C22820288","wikidata":"https://www.wikidata.org/wiki/Q9050568","display_name":"String metric","level":4,"score":0.30869999527931213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2815999984741211},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.2567000091075897},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25941","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.15/LIPIcs.CPM.2026.15.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"},{"id":"doi:10.4230/lipics.cpm.2026.15","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.15","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25941","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.15/LIPIcs.CPM.2026.15.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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163925230.pdf","grobid_xml":"https://content.openalex.org/works/W7163925230.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,61],"Shortest":[1,27],"Common":[2,28],"Superstring":[3,29],"(SCS)":[4],"problem":[5,30],"asks":[6],"for":[7,41,65,116,126,187,210,222],"the":[8,26,46,59,66,80,86,90,99,103,117,127,148,165,172,184,188,193,203,213,218],"shortest":[9],"string":[10,47],"that":[11,144,164],"contains":[12],"each":[13,42],"of":[14,18,58,109,167,207],"a":[15,21,56,70,138,153],"given":[16],"set":[17],"strings":[19,87],"as":[20,55],"substring.":[22],"Its":[23],"reverse-complement":[24,128,149,173],"variant,":[25,95],"with":[31,137,212],"Reverse":[32],"Complements":[33],"(SCS-RC),":[34],"naturally":[35],"arises":[36],"in":[37],"bioinformatics":[38],"applications,":[39],"where":[40],"input":[43],"string,":[44],"either":[45],"itself":[48],"or":[49],"its":[50,93],"reverse":[51,198],"complement":[52],"must":[53],"appear":[54],"substring":[57],"superstring.":[60],"well-known":[62],"MGREEDY":[63,134,168],"algorithm":[64,215],"standard":[67,118,189],"SCS":[68,190],"constructs":[69],"superstring":[71],"by":[72,162,197],"first":[73,204],"computing":[74],"an":[75],"optimal":[76],"cycle":[77],"cover":[78],"on":[79],"overlap":[81],"graph":[82],"and":[83,106,141,169,177],"then":[84],"concatenating":[85],"corresponding":[88],"to":[89,135,147,171,191],"cycles,":[91],"while":[92],"refined":[94],"TGREEDY,":[96],"further":[97],"improves":[98],"approximation":[100,208],"ratio.":[101],"Although":[102],"original":[104],"4-":[105],"3-approximation":[107],"bounds":[108],"these":[110,160],"algorithms":[111],"have":[112],"been":[113,124],"successively":[114],"improved":[115],"SCS,":[119],"no":[120],"such":[121],"progress":[122],"has":[123],"made":[125],"setting.":[129],"A":[130],"previous":[131],"study":[132],"extended":[133],"SCS-RC":[136],"4-approximation":[139],"guarantee":[140],"briefly":[142],"suggested":[143],"extending":[145],"TGREEDY":[146,170],"setting":[150,174],"could":[151],"achieve":[152,175],"3-approximation.":[154],"In":[155],"this":[156,223],"work,":[157],"we":[158],"strengthen":[159],"results":[161,201],"proving":[163],"extensions":[166],"3.75-":[176],"2.875-approximation":[178],"ratios,":[179],"respectively.":[180],"Our":[181],"analysis":[182],"extends":[183],"classical":[185],"proofs":[186],"handle":[192],"bidirectional":[194],"overlaps":[195],"introduced":[196],"complements.":[199],"These":[200],"provide":[202],"formal":[205],"improvement":[206],"guarantees":[209],"SCS-RC,":[211],"2.875-approximate":[214],"currently":[216],"representing":[217],"best":[219],"known":[220],"bound":[221],"problem.":[224]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}