{"id":"https://openalex.org/W2044713370","doi":"https://doi.org/10.1137/080739069","title":"More Efficient Algorithms for Closest String and Substring Problems","display_name":"More Efficient Algorithms for Closest String and Substring Problems","publication_year":2009,"publication_date":"2009-10-16","ids":{"openalex":"https://openalex.org/W2044713370","doi":"https://doi.org/10.1137/080739069","mag":"2044713370"},"language":"en","primary_location":{"id":"doi:10.1137/080739069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080739069","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5100749735","display_name":"Bin Ma","orcid":"https://orcid.org/0000-0002-9223-9654"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bin Ma","raw_affiliation_strings":["binma@uwaterloo.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"binma@uwaterloo.ca#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000241520","display_name":"Xiaoming Sun","orcid":"https://orcid.org/0000-0002-0281-1670"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaoming Sun","raw_affiliation_strings":["xiaomings@tsinghua.edu.cn#TAB#"],"affiliations":[{"raw_affiliation_string":"xiaomings@tsinghua.edu.cn#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100749735"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.2627,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.98476222,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"39","issue":"4","first_page":"1432","last_page":"1443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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.9990000128746033,"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.9889000058174133,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9781000018119812,"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/substring","display_name":"Substring","score":0.9691978693008423},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6945738196372986},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6495527625083923},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6204304695129395},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6180447340011597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5975452661514282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4773254990577698},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.42921769618988037},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.42860424518585205},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.4110000431537628},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3986243009567261},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.26530104875564575},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.24880200624465942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.232685387134552},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07192617654800415}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9691978693008423},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6945738196372986},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6495527625083923},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6204304695129395},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6180447340011597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5975452661514282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4773254990577698},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.42921769618988037},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.42860424518585205},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.4110000431537628},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3986243009567261},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26530104875564575},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.24880200624465942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.232685387134552},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07192617654800415},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080739069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080739069","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.49000000953674316}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322392","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W133334320","https://openalex.org/W1542399861","https://openalex.org/W1553437522","https://openalex.org/W1557768765","https://openalex.org/W1558042394","https://openalex.org/W1559357409","https://openalex.org/W1589348829","https://openalex.org/W1599676582","https://openalex.org/W1840899162","https://openalex.org/W1854934245","https://openalex.org/W1964502706","https://openalex.org/W1979149941","https://openalex.org/W1990313671","https://openalex.org/W1991579867","https://openalex.org/W2002586473","https://openalex.org/W2006830086","https://openalex.org/W2029345527","https://openalex.org/W2044802269","https://openalex.org/W2047386086","https://openalex.org/W2062088872","https://openalex.org/W2077595184","https://openalex.org/W2085239230","https://openalex.org/W2108028389","https://openalex.org/W2122887143","https://openalex.org/W2144355282","https://openalex.org/W2159129072","https://openalex.org/W2185072563","https://openalex.org/W2913688336","https://openalex.org/W3011766368","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2070949798","https://openalex.org/W2136519138","https://openalex.org/W3022344494","https://openalex.org/W52396946","https://openalex.org/W1989944203","https://openalex.org/W3022713583","https://openalex.org/W940833654","https://openalex.org/W2978939959","https://openalex.org/W2918947454","https://openalex.org/W2044713370"],"abstract_inverted_index":{"The":[0],"closest":[1,6,28,69,116,138,153,163],"string":[2,29,35,45,70,117],"problem":[3,8,31,118,140,155],"and":[4,16,46,94],"the":[5,27,68,84,88,115,127,137,152,157,162,170],"substring":[7,41,139,154],"are":[9,54],"all":[10],"natural":[11],"theoretical":[12],"computer":[13],"science":[14],"problems":[15,53],"find":[17],"important":[18],"applications":[19],"in":[20,169],"computational":[21],"biology.":[22],"Given":[23],"n":[24],"input":[25,44],"strings,":[26],"(substring)":[30],"finds":[32],"a":[33,97,108,148],"new":[34,61,134],"within":[36],"distance":[37],"d":[38,49],"to":[39],"(a":[40],"of)":[42],"each":[43],"such":[47],"that":[48,147],"is":[50,83,119,141],"minimized.":[51],"Both":[52],"NP-complete.":[55],"In":[56],"this":[57,106],"paper":[58],"we":[59,72,145],"propose":[60],"algorithms":[62],"for":[63,114,136],"these":[64],"two":[65],"problems.":[66],"For":[67],"problem,":[71],"developed":[73],"an":[74,166],"exact":[75],"algorithm":[76,100,135],"with":[77,122],"time":[78,99,110,123],"complexity":[79,124,160],"$O(n|\\Sigma|^{O(d)})$,":[80],"where":[81],"$\\Sigma$":[82],"alphabet.":[85],"This":[86],"improves":[87],"previously":[89,128],"best":[90,129],"known":[91,130],"result":[92],"$O(nd^{O(d)})$":[93],"results":[95],"into":[96],"polynomial":[98,109],"when":[101],"$d=O(\\log":[102],"n)$.":[103],"By":[104],"using":[105],"algorithm,":[107],"approximation":[111],"scheme":[112],"(PTAS)":[113],"also":[120,142],"given":[121],"$O(n^{O(\\epsilon^{-2})})$,":[125],"improving":[126],"$O(n^{O(\\epsilon^{-2}\\log\\frac{1}{\\epsilon})})$":[131],"PTAS.":[132],"A":[133],"proposed.":[143],"Finally,":[144],"prove":[146],"restricted":[149],"version":[150],"of":[151],"has":[156],"same":[158],"parameterized":[159],"as":[161],"substring,":[164],"answering":[165],"open":[167],"question":[168],"literature.":[171]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}