{"id":"https://openalex.org/W4205763875","doi":"https://doi.org/10.1109/bibm52615.2021.9669334","title":"An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes","display_name":"An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes","publication_year":2021,"publication_date":"2021-12-09","ids":{"openalex":"https://openalex.org/W4205763875","doi":"https://doi.org/10.1109/bibm52615.2021.9669334"},"language":"en","primary_location":{"id":"doi:10.1109/bibm52615.2021.9669334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibm52615.2021.9669334","pdf_url":null,"source":{"id":"https://openalex.org/S4363607735","display_name":"2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","issn_l":null,"issn":null,"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5070975876","display_name":"Chengcheng Sun","orcid":"https://orcid.org/0000-0003-1122-1952"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chengcheng Sun","raw_affiliation_strings":["School of Computer Science and Technology, Shandong University, Qingdao, P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Shandong University, Qingdao, P.R.China","institution_ids":["https://openalex.org/I80143920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101836304","display_name":"Haitao Jiang","orcid":"https://orcid.org/0000-0001-6892-5200"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haitao Jiang","raw_affiliation_strings":["School of Computer Science and Technology, Shandong University, Qingdao, P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Shandong University, Qingdao, P.R.China","institution_ids":["https://openalex.org/I80143920"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I80143920"],"apc_list":null,"apc_paid":null,"fwci":1.7787,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8765625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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.9998000264167786,"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.9998000264167786,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9663000106811523,"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"}},{"id":"https://openalex.org/T10434","display_name":"Chromosomal and Genetic Variations","score":0.9642000198364258,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.715132474899292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6731058359146118},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6223253011703491},{"id":"https://openalex.org/keywords/genome","display_name":"Genome","score":0.5624149441719055},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5250311493873596},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48332974314689636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4699549674987793},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46085304021835327},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.44099369645118713},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42583420872688293},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.4242340326309204},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41965213418006897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3832246661186218},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3406325578689575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29751819372177124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27485179901123047},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.17025497555732727},{"id":"https://openalex.org/keywords/gene","display_name":"Gene","score":0.1184624433517456}],"concepts":[{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.715132474899292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6731058359146118},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6223253011703491},{"id":"https://openalex.org/C141231307","wikidata":"https://www.wikidata.org/wiki/Q7020","display_name":"Genome","level":3,"score":0.5624149441719055},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5250311493873596},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48332974314689636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4699549674987793},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46085304021835327},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.44099369645118713},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42583420872688293},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4242340326309204},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41965213418006897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3832246661186218},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3406325578689575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29751819372177124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27485179901123047},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.17025497555732727},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.1184624433517456},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bibm52615.2021.9669334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibm52615.2021.9669334","pdf_url":null,"source":{"id":"https://openalex.org/S4363607735","display_name":"2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","issn_l":null,"issn":null,"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1491688952","https://openalex.org/W1501298776","https://openalex.org/W1534995305","https://openalex.org/W1601450215","https://openalex.org/W1851214189","https://openalex.org/W2030562672","https://openalex.org/W2061135126","https://openalex.org/W2070642495","https://openalex.org/W2098704509","https://openalex.org/W2134492257","https://openalex.org/W2142096960","https://openalex.org/W2149628296","https://openalex.org/W2160389343","https://openalex.org/W2169466212","https://openalex.org/W2493340588","https://openalex.org/W2802224661","https://openalex.org/W4213205621","https://openalex.org/W6635950731","https://openalex.org/W6645791091"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2982430984","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W1989103179","https://openalex.org/W43536588"],"abstract_inverted_index":{"Computing":[0],"the":[1,28,33,41,54,58,67,73,81,92,95,110,142,156,174,183,187,195,200],"genome":[2,25],"rearrangement":[3,26],"distance":[4,43,113,198],"is":[5,114,141,179],"an":[6,118,123,150],"important":[7],"subject":[8],"in":[9,131],"computational":[10],"biology.":[11],"The":[12],"double":[13],"cut":[14],"and":[15,46,116,129,204],"join":[16],"operation(abbreviated":[17],"as":[18,72],"DCJ)":[19],"has":[20],"been":[21],"extensively":[22],"used":[23],"for":[24,56,154],"over":[27],"last":[29],"few":[30],"years.":[31],"When":[32],"genomes":[34,85,97,201],"contain":[35],"duplicate":[36,87,172],"genes":[37,88],"or":[38,89],"segments,":[39,90],"computing":[40,109,155],"DCJ":[42,68,111,158,196],"becomes":[44],"NP-hard,":[45,115],"there":[47],"are":[48],"scarcely":[49],"positive":[50],"results":[51],"besides":[52],"exploiting":[53],"algorithms":[55],"solving":[57],"minimum":[59,74],"common":[60],"string":[61],"partition":[62],"problem.":[63],"As":[64],"a":[65,99,207],"twist,":[66],"adjacency":[69,112,159,197],"distance,":[70],"defined":[71],"number":[75],"of":[76,94,126,144,176,202,210],"DCJs":[77],"to":[78,98,166],"unify":[79],"all":[80],"adjacencies":[82],"between":[83,199],"two":[84,96],"with":[86,170,206],"reveals":[91],"similarity":[93],"large":[100],"extent.":[101],"In":[102],"this":[103],"paper,":[104],"we":[105,162],"formally":[106],"show":[107],"that":[108],"present":[117],"approximation":[119,124],"algorithm,":[120],"which":[121],"guarantees":[122],"factor":[125],"$\\frac{13}{9}+\\varepsilon(\\approx":[127],"1.44+\\varepsilon)$":[128],"runs":[130],"$O\\left(\\left(n":[132],"\\cdot":[133,135],"8^{\\operatorname{logn}}\\right)^{24":[134],"7}":[136],"\\frac{1}{\\varepsilon}\\right)$":[137],"time,":[138],"where":[139],"n":[140],"length":[143],"each":[145],"genome.":[146],"We":[147],"also":[148],"design":[149],"integer":[151,188],"linear":[152,189],"programming":[153],"exact":[157],"distance.":[160],"Then,":[161],"apply":[163],"our":[164,177,192],"algorithm":[165,178,193],"simulated":[167],"genomic":[168],"data":[169],"bounded":[171],"number,":[173],"solution":[175,185],"even":[180],"better":[181],"than":[182,212],"isochronal":[184],"from":[186],"programming.":[190],"Moreover,":[191],"approximates":[194],"Human":[203],"Gorilla":[205],"real":[208],"ratio":[209],"less":[211],"1.12.":[213]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}