{"id":"https://openalex.org/W2011154456","doi":"https://doi.org/10.1145/2347583.2347591","title":"Quick-MLCS","display_name":"Quick-MLCS","publication_year":2012,"publication_date":"2012-06-27","ids":{"openalex":"https://openalex.org/W2011154456","doi":"https://doi.org/10.1145/2347583.2347591","mag":"2011154456"},"language":"en","primary_location":{"id":"doi:10.1145/2347583.2347591","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2347583.2347591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering","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/A5029941048","display_name":"Majid Sazvar","orcid":null},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Majid Sazvar","raw_affiliation_strings":["Ferdowsi University of Mashhad, Mashhad, Iran"],"affiliations":[{"raw_affiliation_string":"Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000670364","display_name":"Mahmoud Naghibzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mahmoud Naghibzadeh","raw_affiliation_strings":["Ferdowsi University of Mashhad, Mashhad, Iran"],"affiliations":[{"raw_affiliation_string":"Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054049469","display_name":"Nayyereh Saadati","orcid":"https://orcid.org/0000-0002-4589-8091"},"institutions":[{"id":"https://openalex.org/I165560825","display_name":"Mashhad University of Medical Sciences","ror":"https://ror.org/04sfka033","country_code":"IR","type":"education","lineage":["https://openalex.org/I165560825"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Nayyereh Saadati","raw_affiliation_strings":["Mashhad University of Medical Sciences, Mashhad, Iran"],"affiliations":[{"raw_affiliation_string":"Mashhad University of Medical Sciences, Mashhad, Iran","institution_ids":["https://openalex.org/I165560825"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029941048"],"corresponding_institution_ids":["https://openalex.org/I86958956"],"apc_list":null,"apc_paid":null,"fwci":1.2844,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82722913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9915000200271606,"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/sorting","display_name":"Sorting","score":0.6848167777061462},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6840416193008423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5544353723526001},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5498403310775757},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5334084033966064},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.531541109085083},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.506311297416687},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.4511623978614807},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44330668449401855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40543219447135925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24424028396606445}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6848167777061462},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6840416193008423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5544353723526001},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5498403310775757},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5334084033966064},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.531541109085083},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.506311297416687},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.4511623978614807},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44330668449401855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40543219447135925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24424028396606445},{"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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2347583.2347591","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2347583.2347591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W189234309","https://openalex.org/W1501400124","https://openalex.org/W1602643665","https://openalex.org/W2001976285","https://openalex.org/W2003021193","https://openalex.org/W2012010763","https://openalex.org/W2023784545","https://openalex.org/W2027506564","https://openalex.org/W2031198307","https://openalex.org/W2034581970","https://openalex.org/W2040176884","https://openalex.org/W2044966609","https://openalex.org/W2069992928","https://openalex.org/W2087064593","https://openalex.org/W2098148110","https://openalex.org/W2109227373","https://openalex.org/W2133090982","https://openalex.org/W2141255597","https://openalex.org/W2143041118","https://openalex.org/W2162744351","https://openalex.org/W2753176400"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W170643605","https://openalex.org/W1999879627","https://openalex.org/W4295189757","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168","https://openalex.org/W2170721049"],"abstract_inverted_index":{"Finding":[0],"the":[1,39,56,69,79,91,111,124,127,137],"longest":[2],"common":[3],"subsequence":[4],"(LCS)":[5],"of":[6,35,59,68,117,126],"multiple":[7,60],"strings":[8],"is":[9,64,76,98,134],"a":[10,33,52,85,105],"well-known":[11],"problem":[12,28],"that":[13,123],"has":[14,29,43],"many":[15],"applications":[16],"in":[17,131],"various":[18,47],"fields,":[19],"such":[20],"as":[21],"computational":[22,25],"biology":[23],"and":[24,37,83,119],"genomics.":[26],"This":[27,49],"been":[30,44],"studied":[31],"by":[32],"number":[34],"researchers":[36],"over":[38],"years,":[40],"its":[41],"complexity":[42],"improved":[45],"from":[46],"aspects.":[48],"paper":[50],"presents":[51],"new":[53],"algorithm":[54,75,108,130],"for":[55],"general":[57],"case":[58],"LCS":[61],"(MLCS)":[62],"which":[63],"based":[65],"on":[66,78],"one":[67],"fastest":[70,138],"existing":[71,139],"algorithms.":[72],"The":[73,95,115],"proposed":[74,129],"founded":[77],"dominant":[80,92,103,112],"point":[81],"approach":[82],"uses":[84],"linear":[86,107],"sorting":[87,102],"technique":[88],"to":[89],"minimize":[90,110],"points":[93,113],"set.":[94,114],"main":[96],"idea":[97],"that,":[99],"after":[100],"linearly":[101],"points,":[104],"one-pass":[106],"can":[109],"results":[116],"theoretical":[118],"experimental":[120],"evaluations":[121],"indicate":[122],"efficiency":[125],"newly":[128],"different":[132],"scenarios":[133],"better":[135],"than":[136],"algorithm.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}