{"id":"https://openalex.org/W2052437266","doi":"https://doi.org/10.3390/a6030485","title":"A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint","display_name":"A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint","publication_year":2013,"publication_date":"2013-08-15","ids":{"openalex":"https://openalex.org/W2052437266","doi":"https://doi.org/10.3390/a6030485","mag":"2052437266"},"language":"en","primary_location":{"id":"doi:10.3390/a6030485","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030485","pdf_url":"https://www.mdpi.com/1999-4893/6/3/485/pdf?version=1376559306","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/6/3/485/pdf?version=1376559306","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053699182","display_name":"Daxin Zhu","orcid":"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":false,"raw_author_name":"Daxin Zhu","raw_affiliation_strings":["Faculty of Mathematics & Computer Science, Quanzhou Normal University, Quanzhou 362000, China"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics & Computer Science, 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"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]},{"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":"Xiaodong Wang","raw_affiliation_strings":["Faculty of Mathematics & Computer Science, Fuzhou University, Fuzhou 350108, China","Faculty of Mathematics & Computer Science, Quanzhou Normal University, Quanzhou 362000, China"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics & Computer Science, Fuzhou University, Fuzhou 350108, China","institution_ids":["https://openalex.org/I80947539"]},{"raw_affiliation_string":"Faculty of Mathematics & Computer Science, Quanzhou Normal University, Quanzhou 362000, China","institution_ids":["https://openalex.org/I169019527"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100382658"],"corresponding_institution_ids":["https://openalex.org/I169019527","https://openalex.org/I80947539"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.4809,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75855731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"3","first_page":"485","last_page":"493"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9840999841690063,"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.9775999784469604,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9205653071403503},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8860783576965332},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7650876045227051},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6527074575424194},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5672688484191895},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5640787482261658},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5538455843925476},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5467809438705444},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5398989915847778},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5164015889167786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.503480851650238},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4144546389579773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38091975450515747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3291286826133728},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17860862612724304},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.15261641144752502}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9205653071403503},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8860783576965332},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7650876045227051},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6527074575424194},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5672688484191895},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5640787482261658},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5538455843925476},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5467809438705444},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5398989915847778},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5164015889167786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.503480851650238},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4144546389579773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38091975450515747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3291286826133728},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17860862612724304},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.15261641144752502},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a6030485","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030485","pdf_url":"https://www.mdpi.com/1999-4893/6/3/485/pdf?version=1376559306","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:eb3e820a57f940e980f27e76281a6c6c","is_oa":true,"landing_page_url":"https://doaj.org/article/eb3e820a57f940e980f27e76281a6c6c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 6, Iss 3, Pp 485-493 (2013)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/6/3/485/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a6030485","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 6; Issue 3; Pages: 485-493","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a6030485","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030485","pdf_url":"https://www.mdpi.com/1999-4893/6/3/485/pdf?version=1376559306","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.8299999833106995,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2052437266.pdf","grobid_xml":"https://content.openalex.org/works/W2052437266.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1985108724","https://openalex.org/W1999395788","https://openalex.org/W2061395657","https://openalex.org/W2085086876","https://openalex.org/W2092011338","https://openalex.org/W2094799385","https://openalex.org/W2098129242","https://openalex.org/W2098880062","https://openalex.org/W2109822297","https://openalex.org/W2912635318","https://openalex.org/W6673649612","https://openalex.org/W6674705110"],"related_works":["https://openalex.org/W4390923554","https://openalex.org/W2520870971","https://openalex.org/W1540010783","https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W4385963882","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,16,35,40,75,84,94,97,106],"string-excluding":[4],"(STR-EC)-constrained":[5],"longest":[6,41],"common":[7,42],"subsequence":[8],"(LCS)":[9],"problem,":[10],"a":[11,28,53],"generalized":[12],"LCS":[13],"problem.":[14],"For":[15],"two":[17],"input":[18],"sequences,":[19],"X":[20,46],"and":[21,47,57,65,93],"Y":[22,48],",":[23],"of":[24,32,45,96,105],"lengths":[25],"n":[26],"andmand":[27],"constraint":[29],"string,":[30],"P,":[31],"length":[33],"r,":[34],"goal":[36],"is":[37,87,100,109],"to":[38],"find":[39],"subsequence,":[43],"Z,":[44],"that":[49,70],"excludes":[50],"P":[51],"as":[52],"substring.":[54],"The":[55,102],"problem":[56,76,86],"its":[58],"solution":[59,82],"were":[60],"first":[61],"proposed":[62],"by":[63],"Chen":[64],"Chao,":[66],"but":[67],"we":[68],"found":[69],"their":[71],"algorithm":[72,99,108],"cannot":[73],"solve":[74],"correctly.":[77],"A":[78],"new":[79,98,107],"dynamic":[80],"programming":[81],"for":[83],"STR-EC-LCS":[85],"then":[88],"presented":[89],"in":[90],"this":[91],"paper,":[92],"correctness":[95],"proven.":[101],"time":[103],"complexity":[104],"O(nmr).":[110]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}