{"id":"https://openalex.org/W2019404372","doi":"https://doi.org/10.1137/060673898","title":"Closest Substring Problems with Small Distances","display_name":"Closest Substring Problems with Small Distances","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2019404372","doi":"https://doi.org/10.1137/060673898","mag":"2019404372"},"language":"en","primary_location":{"id":"doi:10.1137/060673898","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060673898","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/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["dmarx@cs.bme.hu#TAB#"],"affiliations":[{"raw_affiliation_string":"dmarx@cs.bme.hu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0246,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.96493058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"38","issue":"4","first_page":"1382","last_page":"1410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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.9988999962806702,"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.9950000047683716,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.992900013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8771085739135742},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.814105749130249},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.76936936378479},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7408913373947144},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.6343176960945129},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6218154430389404},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5901547074317932},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4345826804637909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3850390613079071},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34435003995895386},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.25778424739837646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17452290654182434}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8771085739135742},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.814105749130249},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.76936936378479},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7408913373947144},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6343176960945129},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6218154430389404},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5901547074317932},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4345826804637909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3850390613079071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34435003995895386},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25778424739837646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17452290654182434},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/060673898","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060673898","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1518026427","https://openalex.org/W1964541472","https://openalex.org/W1972853793","https://openalex.org/W1979149941","https://openalex.org/W1995725694","https://openalex.org/W2028903194","https://openalex.org/W2030893020","https://openalex.org/W2034206030","https://openalex.org/W2044802269","https://openalex.org/W2047386086","https://openalex.org/W2048869777","https://openalex.org/W2053743126","https://openalex.org/W2061496873","https://openalex.org/W2062088872","https://openalex.org/W2075723156","https://openalex.org/W2077595184","https://openalex.org/W2106304690","https://openalex.org/W2157827214"],"related_works":["https://openalex.org/W2185072563","https://openalex.org/W2062088872","https://openalex.org/W3209439553","https://openalex.org/W2051304374","https://openalex.org/W4286787697","https://openalex.org/W1505605100","https://openalex.org/W3043769852","https://openalex.org/W4308670360","https://openalex.org/W2950721324","https://openalex.org/W4200187525"],"abstract_inverted_index":{"We":[0,57],"study":[1],"two":[2,59],"pattern":[3],"matching":[4],"problems":[5],"that":[6,38,61,187,209,217,254,260,279,299],"are":[7,23,198,212],"motivated":[8],"by":[9],"applications":[10],"in":[11,164,214,222,275],"computational":[12],"biology.":[13],"In":[14],"the":[15,26,80,101,114,188,215,218,223,244,247,252,273,280,300],"Closest":[16,107],"Substring":[17,108],"problem":[18,109,189,248,301],"k":[19,197,284],"strings":[20],"$s_1,\\dots,":[21],"s_k$":[22],"given,":[24],"and":[25,72,78,88,131,147,159,177,196,316],"task":[27],"is":[28,51,96,110,190,243,261,286,302],"to":[29,63,229,233,271],"find":[30],"a":[31,43,203,258,277],"string":[32,40],"s":[33],"of":[34,46,70,104,118,205,220,246,251,262,282],"length":[35,47],"L":[36,48],"such":[37,276],"each":[39,255],"$s_i$":[41,256],"has":[42,257],"consecutive":[44],"substring":[45,259],"whose":[49],"distance":[50,263],"at":[52,264,287],"most":[53,265,288],"d":[54,71,195,266],"from":[55,113,124,267,310],"s.":[56],"present":[58],"algorithms":[60,81,211],"aim":[62],"be":[64,227],"efficient":[65],"for":[66,74],"small":[67],"fixed":[68],"values":[69],"k:":[73],"some":[75,238],"functions":[76],"f":[77],"g,":[79],"have":[82,270],"running":[83,224],"time":[84,225,295],"$f(d)\\cdot":[85],"n^{O(\\log":[86],"d)}$":[87],"$g(d,k)\\cdot":[89],"n^{O(\\log\\log":[90],"k)}$,":[91],"respectively.":[92],"The":[93,106],"second":[94],"algorithm":[95],"based":[97],"on":[98],"connections":[99],"with":[100],"extremal":[102],"combinatorics":[103],"hypergraphs.":[105],"also":[111],"investigated":[112],"parameterized":[115],"complexity":[116],"point":[117],"view.":[119],"Answering":[120],"an":[121,292,307],"open":[122,308],"question":[123,309],"[P.":[125],"A.":[126,128],"Evans,":[127],"D.":[129],"Smith,":[130],"H.":[132],"T.":[133],"Wareham,":[134],"Theoret.":[135],"Comput.":[136,165],"Sci.,":[137],"306":[138],"(2003),":[139,182],"pp.":[140,153,171,183,322],"407\u2013430,":[141],"M.":[142],"R.":[143,148,160,175,312,317],"Fellows,":[144,313],"J.":[145,155,157,173,314],"Gramm,":[146,156,174,315],"Niedermeier,":[149,161,176,318],"Combinatorica,":[150,319],"26":[151,320],"(2006),":[152,321],"141\u2013167,":[154],"Guo,":[158],"Lecture":[162],"Notes":[163],"Sci.":[166],"2751,":[167],"Springer,":[168],"Berlin,":[169],"2003,":[170],"195\u2013209,":[172],"P.":[178],"Rossmanith,":[179],"Algorithmica,":[180],"37":[181],"25\u201342],":[184],"we":[185,269,297],"show":[186,298],"W[1]-hard":[191],"even":[192],"if":[193],"both":[194],"parameters.":[199],"It":[200],"follows":[201],"as":[202],"consequence":[204],"this":[206],"hardness":[207],"result":[208],"our":[210],"optimal":[213],"sense":[216],"exponent":[219],"n":[221],"cannot":[226],"improved":[228],"$o(\\log":[230,234],"d)$":[231],"or":[232],"\\log":[235],"k)$":[236],"(modulo":[237],"complexity-theoretic":[239],"assumptions).":[240],"Consensus":[241],"Patterns":[242],"variant":[245],"where,":[249],"instead":[250],"requirement":[253],"s,":[268],"select":[272],"substrings":[274],"way":[278],"average":[281],"these":[283],"distances":[285],"$\\delta$.":[289],"By":[290],"giving":[291],"$f(\\delta)\\cdot":[293],"n^9$":[294],"algorithm,":[296],"fixed-parameter":[303],"tractable.":[304],"This":[305],"answers":[306],"[M.":[311],"141\u2013167].":[323]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}