{"id":"https://openalex.org/W3129096272","doi":"https://doi.org/10.1145/3443279.3443311","title":"An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence","display_name":"An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence","publication_year":2020,"publication_date":"2020-12-18","ids":{"openalex":"https://openalex.org/W3129096272","doi":"https://doi.org/10.1145/3443279.3443311","mag":"3129096272"},"language":"en","primary_location":{"id":"doi:10.1145/3443279.3443311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3443279.3443311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International Conference on Natural Language Processing and Information Retrieval","raw_type":"proceedings-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/A5100329016","display_name":"Xuan Wang","orcid":"https://orcid.org/0000-0002-7586-5741"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xuan Wang","raw_affiliation_strings":["School of Computer Science and Technology, Donghua University, Shanghai, CHINA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Donghua University, Shanghai, CHINA","institution_ids":["https://openalex.org/I181326427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036666786","display_name":"Ziyang Chen","orcid":"https://orcid.org/0000-0002-9361-0240"},"institutions":[{"id":"https://openalex.org/I146613903","display_name":"Shanghai Lixin University of Accounting and Finance","ror":"https://ror.org/02g81yf77","country_code":"CN","type":"education","lineage":["https://openalex.org/I146613903"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chen Ziyang","raw_affiliation_strings":["School of Information Management, Shanghai Lixin University of Accounting and Finance, Shanghai, CHINA"],"affiliations":[{"raw_affiliation_string":"School of Information Management, Shanghai Lixin University of Accounting and Finance, Shanghai, CHINA","institution_ids":["https://openalex.org/I146613903"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058737918","display_name":"Zhai Lusha","orcid":null},"institutions":[{"id":"https://openalex.org/I39333907","display_name":"Yanshan University","ror":"https://ror.org/02txfnf15","country_code":"CN","type":"education","lineage":["https://openalex.org/I39333907"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhai Lusha","raw_affiliation_strings":["School of Information Science and Engineering, Yanshan University Qinghuangdao, CHINA"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering, Yanshan University Qinghuangdao, CHINA","institution_ids":["https://openalex.org/I39333907"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100329016"],"corresponding_institution_ids":["https://openalex.org/I181326427"],"apc_list":null,"apc_paid":null,"fwci":0.1326,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58059755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9697999954223633,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9628999829292297,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/subsequence","display_name":"Subsequence","score":0.7401206493377686},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6675272583961487},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6392152309417725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6318436861038208},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6157970428466797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6145051717758179},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5944011211395264},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4722535014152527},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44454336166381836},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4270900785923004},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.42112353444099426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3097715973854065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2998586893081665}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7401206493377686},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6675272583961487},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6392152309417725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6318436861038208},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6157970428466797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6145051717758179},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5944011211395264},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4722535014152527},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44454336166381836},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4270900785923004},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.42112353444099426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3097715973854065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2998586893081665},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3443279.3443311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3443279.3443311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International Conference on Natural Language Processing and Information Retrieval","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2911711548","display_name":null,"funder_award_id":"61602401,61873337","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1970026646","https://openalex.org/W2027506564","https://openalex.org/W2041650430","https://openalex.org/W2098607715","https://openalex.org/W2140277987","https://openalex.org/W2143041118","https://openalex.org/W2165654401","https://openalex.org/W2434013509"],"related_works":["https://openalex.org/W2389167168","https://openalex.org/W2289394377","https://openalex.org/W1974063126","https://openalex.org/W2125120904","https://openalex.org/W2131191265","https://openalex.org/W776417157","https://openalex.org/W1540010783","https://openalex.org/W2014626504","https://openalex.org/W2144884743","https://openalex.org/W2375943101"],"abstract_inverted_index":{"Finding":[0],"the":[1,46,72,77,90,95,104,113,121,125,129,133,138,144,150,156,169],"multiple":[2],"longest":[3],"common":[4,86],"subsequence(MLCS)":[5],"and":[6,24,149],"other":[7],"derived":[8],"problems":[9,107],"belong":[10],"to":[11,31,43,111,142,155],"NP-hard":[12],"problems,":[13],"which":[14,70,102],"is":[15],"especially":[16],"used":[17],"in":[18,38,52,84,124],"comparing":[19],"files,":[20],"comparison":[21],"of":[22,48,76,81,92,127,135,146,159,171],"DNA":[23],"protein":[25],"sequences.":[26,119],"An":[27],"efficient":[28],"method":[29],"applicable":[30],"solve":[32],"top-k":[33,161],"MLCS":[34,106],"has":[35],"been":[36],"proposed":[37,68],"this":[39],"paper.":[40],"It":[41],"implements":[42],"quickly":[44],"find":[45],"LCS":[47],"all":[49],"k":[50],"sequences":[51,56,136],"a":[53],"given":[54],"n":[55],"with":[57],"less":[58],"space":[59],"occupation.":[60],"To":[61],"reduce":[62],"retrieval":[63],"time,":[64,123],"SF_MLCS":[65],"algorithm":[66,99,152,158],"was":[67,100,140,153],"firstly,":[69],"improve":[71],"hash":[73],"storage":[74],"structure":[75,145],"direct":[78,130],"successor":[79,131],"nodes":[80],"matching":[82,147],"points":[83],"irredundant":[85],"subsequence":[87],"graph.":[88],"On":[89],"basis":[91],"it,":[93],"introducing":[94],"divide-and-conquer":[96],"strategy,":[97],"DC_MLCS":[98,151],"proposed,":[101],"divided":[103],"whole":[105],"into":[108],"several":[109],"subproblems,":[110],"meet":[112],"requirement":[114],"for":[115],"longer":[116],"or":[117],"long-scale":[118],"At":[120],"same":[122],"process":[126],"solving":[128],"nodes,":[132],"number":[134],"satisfying":[137],"conditions":[139],"limited":[141],"change":[143],"points,":[148],"extended":[154],"DC_MLCS+":[157],"finding":[160],"LCS.":[162],"Experiments":[163],"based":[164],"on":[165],"real":[166],"datasets":[167],"verify":[168],"efficiency":[170],"our":[172],"algorithm.":[173]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}