{"id":"https://openalex.org/W2977620381","doi":"https://doi.org/10.1093/bioinformatics/btz725","title":"A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment","display_name":"A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment","publication_year":2019,"publication_date":"2019-09-26","ids":{"openalex":"https://openalex.org/W2977620381","doi":"https://doi.org/10.1093/bioinformatics/btz725","mag":"2977620381","pmid":"https://pubmed.ncbi.nlm.nih.gov/31584616"},"language":"en","primary_location":{"id":"doi:10.1093/bioinformatics/btz725","doi":"https://doi.org/10.1093/bioinformatics/btz725","is_oa":false,"landing_page_url":"https://doi.org/10.1093/bioinformatics/btz725","pdf_url":null,"source":{"id":"https://openalex.org/S52395412","display_name":"Bioinformatics","issn_l":"1367-4803","issn":["1367-4803","1367-4811"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","ccf-a","cwts-core","doaj","dongbi-b","doyens","jufo-3","ki-jl-2","medline","norway-2","oarl","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bioinformatics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj","pubmed"],"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/A5100358497","display_name":"Sen Liu","orcid":"https://orcid.org/0000-0003-2230-7671","observed_orcids":["https://orcid.org/0000-0003-2230-7671","https://orcid.org/0009-0004-6405-3360"]},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sen Liu","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University , Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University , Xi\u2019an, China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100339104","display_name":"Yuping Wang","orcid":"https://orcid.org/0000-0001-6868-0004","observed_orcids":["https://orcid.org/0000-0001-6868-0004"]},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuping Wang","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University , Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University , Xi\u2019an, China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101379341","display_name":"Wuning Tong","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wuning Tong","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University , Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University , Xi\u2019an, China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063234459","display_name":"Shiwei Wei","orcid":"https://orcid.org/0000-0002-2324-4791","observed_orcids":["https://orcid.org/0000-0002-2324-4791"]},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shiwei Wei","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University , Xi\u2019an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University , Xi\u2019an, China","institution_ids":["https://openalex.org/I149594827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100339104"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":{"value":3989,"currency":"USD","value_usd":3989},"apc_paid":null,"fwci":2.472,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8976378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"36","issue":"4","first_page":"1066","last_page":"1073"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.005499999970197678,"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/T12946","display_name":"Fractal and DNA sequence analysis","score":0.0010000000474974513,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dna-sequence-alignment","display_name":"DNA sequence alignment","score":0.949999988079071},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.5299999713897705},{"id":"https://openalex.org/keywords/weighted-directed-acyclic-graph","display_name":"weighted directed acyclic graph","score":0.9279999732971191},{"id":"https://openalex.org/keywords/repeated-characters","display_name":"repeated characters","score":0.5960000157356262},{"id":"https://openalex.org/keywords/space-reduction","display_name":"space reduction","score":0.48899999260902405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.729416012763977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6565335392951965},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.6257876753807068},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.603974461555481},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.5847477912902832},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5474619269371033},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4992554187774658},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4575589597225189},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.45631206035614014},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4332270622253418},{"id":"https://openalex.org/C72802188","wikidata":"https://www.wikidata.org/wiki/Q1683352","display_name":"Smith\u2013Waterman algorithm","level":5,"score":0.42305296659469604},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4222763776779175},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42163485288619995},{"id":"https://openalex.org/C45484198","wikidata":"https://www.wikidata.org/wiki/Q827246","display_name":"Sequence alignment","level":4,"score":0.2649409770965576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16575312614440918},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.12879475951194763},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.10449308156967163},{"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/C167625842","wikidata":"https://www.wikidata.org/wiki/Q899763","display_name":"Peptide sequence","level":3,"score":0.0},{"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/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D004247","descriptor_name":"DNA","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D016415","descriptor_name":"Sequence Alignment","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017422","descriptor_name":"Sequence Analysis, DNA","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":2,"locations":[{"id":"doi:10.1093/bioinformatics/btz725","doi":"https://doi.org/10.1093/bioinformatics/btz725","is_oa":false,"landing_page_url":"https://doi.org/10.1093/bioinformatics/btz725","pdf_url":null,"source":{"id":"https://openalex.org/S52395412","display_name":"Bioinformatics","issn_l":"1367-4803","issn":["1367-4803","1367-4811"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","ccf-a","cwts-core","doaj","dongbi-b","doyens","jufo-3","ki-jl-2","medline","norway-2","oarl","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bioinformatics","raw_type":"journal-article"},{"id":"pmid:31584616","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/31584616","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bioinformatics (Oxford, England)","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2616006192","display_name":null,"funder_award_id":"2016JZ022","funder_id":"https://openalex.org/F4320324173","funder_display_name":"Natural Science Foundation of Shaanxi Province"},{"id":"https://openalex.org/G7225477396","display_name":"\u5927\u89c4\u6a21\u751f\u7269\u6570\u636e\u8ba1\u7b97\u7684\u4f18\u5316\u5efa\u6a21\u4e0e\u9ad8\u6548\u7b97\u6cd5\u7814\u7a76","funder_award_id":"61872281","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"},{"id":"https://openalex.org/F4320324173","display_name":"Natural Science Foundation of Shaanxi Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1822601978","https://openalex.org/W2003021193","https://openalex.org/W2012010763","https://openalex.org/W2023784545","https://openalex.org/W2027506564","https://openalex.org/W2040176884","https://openalex.org/W2044966609","https://openalex.org/W2068807390","https://openalex.org/W2087064593","https://openalex.org/W2095065082","https://openalex.org/W2140277987","https://openalex.org/W2141255597","https://openalex.org/W2143041118","https://openalex.org/W2162744351","https://openalex.org/W2326849382","https://openalex.org/W2560137734","https://openalex.org/W2579525752","https://openalex.org/W2586862787","https://openalex.org/W2742821174","https://openalex.org/W2806704039","https://openalex.org/W3145128584","https://openalex.org/W3151758631","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W3202152865","https://openalex.org/W3010535438","https://openalex.org/W2767793031","https://openalex.org/W3173096650","https://openalex.org/W4294931093","https://openalex.org/W4400878155","https://openalex.org/W2742821174","https://openalex.org/W2434013509","https://openalex.org/W2394452652","https://openalex.org/W4289533790"],"abstract_inverted_index":{"MOTIVATION:":[0],"Multiple":[1],"longest":[2,10],"common":[3,11],"subsequence":[4],"(MLCS)":[5],"problem":[6],"is":[7,129,165],"searching":[8],"all":[9,111],"subsequences":[12],"of":[13,42,71,102,109],"multiple":[14],"character":[15,83],"sequences.":[16,94,112],"It":[17],"appears":[18],"in":[19,37,92,188],"many":[20,75],"fields":[21],"such":[22],"as":[23],"data":[24],"mining,":[25],"DNA":[26,72],"alignment,":[27],"bioinformatics,":[28],"text":[29],"editing":[30],"and":[31,40,49,56,105,118,149,161,191,198],"so":[32],"on.":[33],"With":[34],"the":[35,44,50,69,88,93,100,107,116,157,162,177,183],"increasing":[36],"sequence":[38],"length":[39,101],"number":[41],"sequences,":[43],"existing":[45],"dynamic":[46],"programming":[47],"algorithms":[48,53,187],"dominant":[51],"point-based":[52],"become":[54],"ineffective":[55],"inefficient,":[57],"especially":[58],"for":[59,138,153],"large-scale":[60],"MLCS":[61,139,154],"problems.":[62,140,155],"RESULTS:":[63],"In":[64],"this":[65],"paper,":[66],"by":[67],"considering":[68],"characteristics":[70],"sequences":[73,103],"with":[74,167],"consecutively":[76,89],"repeated":[77,90],"characters,":[78],"we":[79,121,145],"first":[80],"design":[81],"a":[82,96,123,147],"merging":[84],"scheme":[85],"which":[86,128],"merges":[87],"characters":[91],"As":[95],"result,":[97],"it":[98],"shortens":[99],"considered":[104],"saves":[106],"space":[108,117,192],"storing":[110],"To":[113],"further":[114],"reduce":[115],"time":[119,190],"costs,":[120],"construct":[122],"weighted":[124],"directed":[125,135],"acyclic":[126,136],"graph":[127,137],"much":[130],"smaller":[131],"than":[132,182],"widely":[133],"used":[134],"Based":[141],"on":[142],"these":[143],"techniques,":[144],"propose":[146],"fast":[148],"memory":[150],"efficient":[151],"algorithm":[152,164,179],"Finally,":[156],"experiments":[158],"are":[159],"conducted":[160],"proposed":[163,178],"compared":[166,184],"several":[168],"state-of-the":[169,185],"art":[170,186],"algorithms.":[171],"The":[172],"experimental":[173],"results":[174],"show":[175],"that":[176],"performs":[180],"better":[181],"both":[189],"costs.":[193],"AVAILABILITY":[194],"AND":[195],"IMPLEMENTATION:":[196],"https://www.ncbi.nlm.nih.gov/nuccore":[197],"https://github.com/liusen1006/MLCS.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2019-10-10T00:00:00"}