{"id":"https://openalex.org/W3002773628","doi":"https://doi.org/10.4230/lipics.cpm.2020.25","title":"Chaining with Overlaps Revisited","display_name":"Chaining with Overlaps Revisited","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3002773628","doi":"https://doi.org/10.4230/lipics.cpm.2020.25","mag":"3002773628"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12150","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.25","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043558409","display_name":"Veli M\u00e4kinen","orcid":"https://orcid.org/0000-0003-4454-1493"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"M\u00e4kinen, Veli","raw_affiliation_strings":["Department of Computer Science, University of Helsinki, Finland","University of Helsinki, Helsinki, Finland"],"raw_orcid":"https://orcid.org/0000-0003-4454-1493","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]},{"raw_affiliation_string":"University of Helsinki, Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082939519","display_name":"Kristoffer Sahlin","orcid":"https://orcid.org/0000-0001-7378-2320"},"institutions":[{"id":"https://openalex.org/I161593684","display_name":"Stockholm University","ror":"https://ror.org/05f0yaq80","country_code":"SE","type":"education","lineage":["https://openalex.org/I161593684"]},{"id":"https://openalex.org/I2800139495","display_name":"Science for Life Laboratory","ror":"https://ror.org/04ev03g22","country_code":"SE","type":"facility","lineage":["https://openalex.org/I2800139495"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sahlin, Kristoffer","raw_affiliation_strings":["Department of Mathematics, Science for Life Laboratory, Stockholm University, Sweden","Stockholm University"],"raw_orcid":"https://orcid.org/0000-0001-7378-2320","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Science for Life Laboratory, Stockholm University, Sweden","institution_ids":["https://openalex.org/I2800139495"]},{"raw_affiliation_string":"Stockholm University","institution_ids":["https://openalex.org/I161593684"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01470418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"12","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9972000122070312,"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.9864000082015991,"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/correctness","display_name":"Correctness","score":0.8715839982032776},{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.809563159942627},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6377707123756409},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5755213499069214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5612244606018066},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5403419137001038},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5076519250869751},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4994690418243408},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.49344602227211},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.47482094168663025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4568127393722534},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45360785722732544},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43830594420433044},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40932387113571167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3629416823387146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35383301973342896},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10596418380737305},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08742508292198181}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8715839982032776},{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.809563159942627},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6377707123756409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5755213499069214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5612244606018066},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5403419137001038},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5076519250869751},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4994690418243408},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.49344602227211},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.47482094168663025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4568127393722534},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45360785722732544},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43830594420433044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40932387113571167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3629416823387146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35383301973342896},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10596418380737305},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08742508292198181},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:12150","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:helda.helsinki.fi:10138/340722","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/340722","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},{"id":"pmh:oai:arXiv.org:2001.06864","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.06864","pdf_url":"https://arxiv.org/pdf/2001.06864","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3002773628","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2001.06864.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:DiVA.org:su-189814","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-189814","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.2001.06864","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2001.06864","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.cpm.2020.25","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"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":"ConferencePaper"},{"id":"mag:3037077253","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2020/12150/pdf/LIPIcs-CPM-2020-25.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306417913","display_name":"Combinatorial Pattern Matching","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Combinatorial Pattern Matching","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:12150","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W180909918","https://openalex.org/W1520134085","https://openalex.org/W1970962303","https://openalex.org/W1984940291","https://openalex.org/W1990061958","https://openalex.org/W2047570770","https://openalex.org/W2950886133"],"related_works":["https://openalex.org/W3037077253","https://openalex.org/W3126902103","https://openalex.org/W2950147910","https://openalex.org/W2748854225","https://openalex.org/W1914953948","https://openalex.org/W2134478093","https://openalex.org/W3184303019","https://openalex.org/W153899650","https://openalex.org/W2051017380","https://openalex.org/W2062257519","https://openalex.org/W1969148345","https://openalex.org/W2180461927","https://openalex.org/W3102176745","https://openalex.org/W1513315626","https://openalex.org/W1590822864","https://openalex.org/W3173034715","https://openalex.org/W1548483724","https://openalex.org/W100178094","https://openalex.org/W3119899051","https://openalex.org/W2020626990"],"abstract_inverted_index":{"Chaining":[0],"algorithms":[1,40],"aim":[2],"to":[3,41,65,95,109,172],"form":[4],"a":[5,13,31,60,68,97,166],"semi-global":[6],"alignment":[7],"of":[8,15,30,51,87,100,114,136,152],"two":[9],"sequences":[10],"based":[11],"on":[12,22,59,103,111,125],"set":[14],"anchoring":[16],"local":[17],"alignments":[18],"as":[19,150],"input.":[20],"Depending":[21],"the":[23,27,49,63,106,112,115,132,156,173],"optimization":[24],"criteria":[25],"and":[26,76,91,142],"exact":[28,129],"definition":[29,99,135],"chain,":[32],"there":[33],"are":[34,147],"several":[35],"$O(n":[36,121,159],"\\log":[37,160],"n)$":[38,123,161],"time":[39,124],"solve":[42],"this":[43,55],"problem":[44],"optimally,":[45],"where":[46],"$n$":[47],"is":[48],"number":[50],"input":[52],"anchors.":[53],"In":[54],"paper,":[56],"we":[57],"focus":[58],"formulation":[61,71],"allowing":[62],"anchors":[64,126,146],"overlap":[66],"in":[67,120],"chain.":[69],"This":[70],"was":[72],"studied":[73,175],"by":[74,128,140],"Shibuya":[75,141],"Kurochin":[77,143],"(WABI":[78],"2003),":[79],"but":[80],"their":[81,93],"algorithm":[82,94,117,157],"comes":[83],"with":[84,170],"no":[85],"proof":[86],"correctness.":[88],"We":[89,163],"revisit":[90],"modify":[92],"consider":[96],"strict":[98],"precedence":[101,137],"relation":[102,138],"anchors,":[104],"adding":[105],"required":[107],"derivation":[108],"convince":[110],"correctness":[113],"resulting":[116],"that":[118],"runs":[119],"\\log^2":[122],"formed":[127],"matches.":[130],"With":[131],"more":[133],"relaxed":[134],"considered":[139],"or":[144],"when":[145],"non-nested":[148],"such":[149],"matches":[151],"uniform":[153],"length":[154],"($k$-mers),":[155],"takes":[158],"time.":[162],"also":[164],"establish":[165],"connection":[167],"between":[168],"chaining":[169],"overlaps":[171],"widely":[174],"longest":[176],"common":[177],"subsequence":[178],"(LCS)":[179],"problem.":[180]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}