{"id":"https://openalex.org/W2066474882","doi":"https://doi.org/10.1109/icsmc.2010.5641888","title":"A heuristic algorithm based on Lagrangian relaxation for the closest string problem","display_name":"A heuristic algorithm based on Lagrangian relaxation for the closest string problem","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2066474882","doi":"https://doi.org/10.1109/icsmc.2010.5641888","mag":"2066474882"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2010.5641888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5641888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/143685/1/j.cor.2011.06.005.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010738368","display_name":"Shunji Tanaka","orcid":"https://orcid.org/0000-0002-0181-743X"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shunji Tanaka","raw_affiliation_strings":["Department of Electrical Engineering, Kyoto University, Kyoto, Japan","Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, 615-8510, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, 615-8510, Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010738368"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":0.4655,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73951084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5280","issue":null,"first_page":"2780","last_page":"2786"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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":0.9986000061035156,"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.9944999814033508,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.989799976348877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7919804453849792},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5440775752067566},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5047124624252319},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4967342019081116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49556100368499756},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48552989959716797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4782516062259674},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4503093361854553},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4436969459056854},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4196881353855133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3781529366970062}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7919804453849792},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5440775752067566},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5047124624252319},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4967342019081116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49556100368499756},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48552989959716797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4782516062259674},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4503093361854553},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4436969459056854},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4196881353855133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3781529366970062},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icsmc.2010.5641888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5641888","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.kulib.kyoto-u.ac.jp:2433/143685","is_oa":true,"landing_page_url":"http://hdl.handle.net/2433/143685","pdf_url":"https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/143685/1/j.cor.2011.06.005.pdf","source":{"id":"https://openalex.org/S4306401454","display_name":"Kyoto University Research Information Repository (Kyoto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I22299242","host_organization_name":"Kyoto University","host_organization_lineage":["https://openalex.org/I22299242"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:repository.kulib.kyoto-u.ac.jp:2433/143685","is_oa":true,"landing_page_url":"http://hdl.handle.net/2433/143685","pdf_url":"https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/143685/1/j.cor.2011.06.005.pdf","source":{"id":"https://openalex.org/S4306401454","display_name":"Kyoto University Research Information Repository (Kyoto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I22299242","host_organization_name":"Kyoto University","host_organization_lineage":["https://openalex.org/I22299242"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2066474882.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1482000113","https://openalex.org/W1491693718","https://openalex.org/W1542399861","https://openalex.org/W1563332361","https://openalex.org/W1568657452","https://openalex.org/W1599676582","https://openalex.org/W1796373563","https://openalex.org/W1854934245","https://openalex.org/W1979149941","https://openalex.org/W1986798565","https://openalex.org/W2001912652","https://openalex.org/W2044713370","https://openalex.org/W2047386086","https://openalex.org/W2077595184","https://openalex.org/W2083491745","https://openalex.org/W2100230937","https://openalex.org/W2106486441","https://openalex.org/W2114951958","https://openalex.org/W2115393313","https://openalex.org/W2144355282","https://openalex.org/W4236055811"],"related_works":["https://openalex.org/W2224940485","https://openalex.org/W2168643831","https://openalex.org/W2075514833","https://openalex.org/W2381791171","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2366189044","https://openalex.org/W2365741636","https://openalex.org/W4237964977","https://openalex.org/W2011733276"],"abstract_inverted_index":{"The":[0,41],"closest":[1],"string":[2,17],"problem":[3,53,66],"that":[4,18],"arises":[5],"in":[6],"both":[7],"computational":[8],"biology":[9],"and":[10,106],"coding":[11],"theory":[12],"is":[13,44,97],"to":[14,45,51,63,71],"find":[15],"a":[16,25,78,86,94,101,107],"minimizes":[19],"the":[20,47,52,65,75,89,114,117],"maximum":[21],"Hamming":[22],"distance":[23],"from":[24,85],"given":[26],"set":[27],"of":[28,74,88,116],"strings.":[29,76],"This":[30,60],"study":[31],"proposes":[32],"an":[33,56],"efficient":[34],"heuristic":[35,95],"algorithm":[36,96],"for":[37],"this":[38],"NP-hard":[39],"problem.":[40,59],"key":[42],"idea":[43],"apply":[46],"Lagrangian":[48,102],"relaxation":[49],"technique":[50],"formulated":[54],"as":[55],"integer":[57],"programming":[58],"enables":[61],"us":[62],"decompose":[64],"into":[67],"trivial":[68],"subproblems":[69],"corresponding":[70],"each":[72],"position":[73],"Furthermore,":[77],"feasible":[79],"solution":[80,87],"can":[81],"be":[82],"easily":[83],"obtained":[84],"relaxation.":[90],"Based":[91],"on":[92],"this,":[93],"constructed":[98],"by":[99],"combining":[100],"multiplier":[103],"adjustment":[104],"procedure":[105],"tabu":[108],"search.":[109],"Numerical":[110],"experiments":[111],"will":[112],"show":[113],"effectiveness":[115],"proposed":[118],"algorithm.":[119]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}