{"id":"https://openalex.org/W4253152196","doi":"https://doi.org/10.2991/icimm-15.2015.31","title":"An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-IC-LCS Problem","display_name":"An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-IC-LCS Problem","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W4253152196","doi":"https://doi.org/10.2991/icimm-15.2015.31"},"language":"en","primary_location":{"id":"doi:10.2991/icimm-15.2015.31","doi":"https://doi.org/10.2991/icimm-15.2015.31","is_oa":true,"landing_page_url":"https://doi.org/10.2991/icimm-15.2015.31","pdf_url":"https://download.atlantis-press.com/article/25523.pdf","source":{"id":"https://openalex.org/S4210215495","display_name":"Advances in engineering research/Advances in Engineering Research","issn_l":"2352-5401","issn":["2352-5401","2731-8079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310315540","host_organization_name":"Atlantis Press","host_organization_lineage":["https://openalex.org/P4310315540"],"host_organization_lineage_names":["Atlantis Press"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Engineering Research","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://download.atlantis-press.com/article/25523.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053699182","display_name":"Daxin Zhu","orcid":"https://orcid.org/0000-0002-8060-7368","observed_orcids":["https://orcid.org/0000-0002-8060-7368"]},"institutions":[{"id":"https://openalex.org/I169019527","display_name":"Quanzhou Normal University","ror":"https://ror.org/006ak0b38","country_code":"CN","type":"education","lineage":["https://openalex.org/I169019527"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Daxin Zhu","raw_affiliation_strings":["Quanzhou Normal University, Quanzhou 362000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Quanzhou Normal University, Quanzhou 362000, China","institution_ids":["https://openalex.org/I169019527"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100382658","display_name":"Xiaodong Wang","orcid":"https://orcid.org/0000-0002-2945-9240","observed_orcids":["https://orcid.org/0000-0002-2945-9240"]},"institutions":[{"id":"https://openalex.org/I83791580","display_name":"Fujian University of Technology","ror":"https://ror.org/03c8fdb16","country_code":"CN","type":"education","lineage":["https://openalex.org/I83791580"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaodong Wang","raw_affiliation_strings":["Fujian University of Technology, Fuzhou 350108, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fujian University of Technology, Fuzhou 350108, China","institution_ids":["https://openalex.org/I83791580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053699182"],"corresponding_institution_ids":["https://openalex.org/I169019527"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"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.9940999746322632,"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.9940999746322632,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dynamic-programming-algorithm","display_name":"dynamic programming algorithm","score":0.9549999833106995},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6769999861717224},{"id":"https://openalex.org/keywords/algorithm-correctness","display_name":"algorithm correctness","score":0.5210000276565552}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6803823113441467},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6278618574142456},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4459199607372284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29566624760627747}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2991/icimm-15.2015.31","doi":"https://doi.org/10.2991/icimm-15.2015.31","is_oa":true,"landing_page_url":"https://doi.org/10.2991/icimm-15.2015.31","pdf_url":"https://download.atlantis-press.com/article/25523.pdf","source":{"id":"https://openalex.org/S4210215495","display_name":"Advances in engineering research/Advances in Engineering Research","issn_l":"2352-5401","issn":["2352-5401","2731-8079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310315540","host_organization_name":"Atlantis Press","host_organization_lineage":["https://openalex.org/P4310315540"],"host_organization_lineage_names":["Atlantis Press"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Engineering Research","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.2991/icimm-15.2015.31","doi":"https://doi.org/10.2991/icimm-15.2015.31","is_oa":true,"landing_page_url":"https://doi.org/10.2991/icimm-15.2015.31","pdf_url":"https://download.atlantis-press.com/article/25523.pdf","source":{"id":"https://openalex.org/S4210215495","display_name":"Advances in engineering research/Advances in Engineering Research","issn_l":"2352-5401","issn":["2352-5401","2731-8079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310315540","host_organization_name":"Atlantis Press","host_organization_lineage":["https://openalex.org/P4310315540"],"host_organization_lineage_names":["Atlantis Press"],"type":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Engineering Research","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4253152196.pdf","grobid_xml":"https://content.openalex.org/works/W4253152196.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1848152589","https://openalex.org/W1990061958","https://openalex.org/W2061395657","https://openalex.org/W2085086876","https://openalex.org/W2094799385","https://openalex.org/W2098880062","https://openalex.org/W2162744351","https://openalex.org/W4319054686"],"related_works":["https://openalex.org/W2473383634","https://openalex.org/W1864671232","https://openalex.org/W2950830699","https://openalex.org/W2578478057","https://openalex.org/W2414123003","https://openalex.org/W2577457156","https://openalex.org/W2061395657","https://openalex.org/W2400763030","https://openalex.org/W4394654192","https://openalex.org/W1999395788"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,66],"consider":[4],"a":[5],"generalized":[6,80],"longest":[7,81],"common":[8,82],"subsequence":[9,83],"problem,":[10],"in":[11],"which":[12],"two":[13,29,42,57],"constraining":[14,58],"sequences":[15,31,44,59],"of":[16,27,35,48,60,86],"length":[17,34,61],"s":[18,62],"and":[19,32,46,51,54,63],"t":[20,64],"must":[21,38],"be":[22,39],"included":[23],"as":[24],"the":[25,28,33,36,41,55,78,87],"subsequences":[26],"main":[30],"result":[37],"maximal.For":[40],"input":[43],"X":[45],"Y":[47],"lengths":[49],"n":[50],"m":[52],",":[53,65],"given":[56],"present":[67],"an":[68],")":[69],"(nmst":[70],"O":[71],"time":[72],"dynamic":[73],"programming":[74],"algorithm":[75,89],"for":[76],"solving":[77],"new":[79,88],"problem.The":[84],"correctness":[85],"is":[90],"proved.":[91]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2022-05-12T00:00:00"}