{"id":"https://openalex.org/W2088055539","doi":"https://doi.org/10.1142/s0129054105003674","title":"ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS","display_name":"ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2088055539","doi":"https://doi.org/10.1142/s0129054105003674","mag":"2088055539"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003674","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003674","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5072963545","display_name":"Abdullah N. Arslan","orcid":"https://orcid.org/0000-0002-3979-6371"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ABDULLAH N. ARSLAN","raw_affiliation_strings":["Department of Computer Science, University of Vermont, Burlington, VT 05405, USA","Department of Computer Science, University of Vermont, Burlington, VT 05405 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Vermont, Burlington, VT 05405, USA","institution_ids":["https://openalex.org/I111236770"]},{"raw_affiliation_string":"Department of Computer Science, University of Vermont, Burlington, VT 05405 USA","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026125535","display_name":"\u00d6mer E\u011fecio\u01e7lu","orcid":"https://orcid.org/0000-0002-6070-761X"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"\u00d6MER E\u011eECIO\u011eLU","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, Santa Barbara, CA 93106, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, Santa Barbara, CA 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072963545"],"corresponding_institution_ids":["https://openalex.org/I111236770"],"apc_list":null,"apc_paid":null,"fwci":7.4587,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.97094096,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"06","first_page":"1099","last_page":"1109"},"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.9872000217437744,"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/T11567","display_name":"semigroups and automata theory","score":0.983299970626831,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9648729562759399},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.8807764649391174},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.8539301156997681},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7661807537078857},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6234093308448792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5516659617424011},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4603552222251892},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4302116334438324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36644405126571655}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9648729562759399},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8807764649391174},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.8539301156997681},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7661807537078857},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6234093308448792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5516659617424011},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4603552222251892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4302116334438324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36644405126571655},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003674","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003674","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1970026646","https://openalex.org/W1974063126","https://openalex.org/W1999395788","https://openalex.org/W2012010763","https://openalex.org/W2038268267","https://openalex.org/W2109227373","https://openalex.org/W2162744351","https://openalex.org/W2165654401"],"related_works":["https://openalex.org/W1540010783","https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W4389489786","https://openalex.org/W2152064395","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W3094761360"],"abstract_inverted_index":{"Given":[0],"strings":[1],"S":[2,5,17,20,35,38,79,83],"1":[3,18,36,80],",":[4,7,81,85],"2":[6,21,39,63,65,84],"and":[8,19,37,72,82],"P,":[9,78],"the":[10,52,56,59,75,94,97,101,120],"constrained":[11],"longest":[12,30],"common":[13,31],"subsequence":[14,32,106],"problem":[15,57,98],"for":[16],"with":[22],"respect":[23],"to":[24,27,67],"P":[25,42,111],"is":[26,112,130],"find":[28],"a":[29,44,88,105,115],"lcs":[33,102],"of":[34,55,77,90,96],"which":[40,50],"contains":[41,104],"as":[43],"subsequence.":[45],"We":[46],"present":[47],"an":[48,125],"algorithm":[49,126],"improves":[51],"time":[53,128],"complexity":[54,129],"from":[58,110],"previously":[60],"known":[61],"O(rn":[62],"m":[64,73],")":[66],"O(rnm)":[68],"where":[69],"r,":[70],"n,":[71],"are":[74],"lengths":[76],"respectively.":[86],"As":[87],"generalization":[89],"this,":[91],"we":[92,123],"extend":[93],"definition":[95],"so":[99],"that":[100],"sought":[103],"whose":[107,127],"edit":[108],"distance":[109],"less":[113],"than":[114],"given":[116],"parameter":[117],"d.":[118],"For":[119],"latter":[121],"problem,":[122],"propose":[124],"O(drnm).":[131]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}