{"id":"https://openalex.org/W1602012035","doi":"https://doi.org/10.1007/978-3-540-72870-2_8","title":"A New Efficient Algorithm for Computing the Longest Common Subsequence","display_name":"A New Efficient Algorithm for Computing the Longest Common Subsequence","publication_year":2007,"publication_date":"2007-06-25","ids":{"openalex":"https://openalex.org/W1602012035","doi":"https://doi.org/10.1007/978-3-540-72870-2_8","mag":"1602012035"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-72870-2_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72870-2_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5029174615","display_name":"M. Sohel Rahman","orcid":"https://orcid.org/0000-0001-9419-6478"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. Sohel Rahman","raw_affiliation_strings":["Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London WC2R 2LS, England","Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England#TAB#"],"affiliations":[{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England#TAB#","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107931257","display_name":"Costas S. Iliopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London WC2R 2LS, England","Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England#TAB#"],"affiliations":[{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England#TAB#","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029174615"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.5067,"has_fulltext":false,"cited_by_count":112,"citation_normalized_percentile":{"value":0.98951683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"82","last_page":"90"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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":0.9998000264167786,"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.9535999894142151,"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.9434000253677368,"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.9586365222930908},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6817890405654907},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.592184841632843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5691689848899841},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.48787474632263184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4828806221485138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44388291239738464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4261401295661926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36298662424087524}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9586365222930908},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6817890405654907},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.592184841632843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5691689848899841},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.48787474632263184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4828806221485138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44388291239738464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4261401295661926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36298662424087524},{"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":3,"locations":[{"id":"doi:10.1007/978-3-540-72870-2_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72870-2_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/3412a96d-5e07-4407-b322-bb904ebecb26","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=38149023339&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rahman, M S, Iliopoulos, C S, Kao, M Y (ed.) & Li, X Y (ed.) 2007, A new efficient algorithm for computing the longest common subsequence. in Algorithmic Aspects in Information and Management, Proceedings. vol. 4508 LNCS, LECTURE NOTES IN COMPUTER SCIENCE, BERLIN, pp. 82 - 90, 3rd International Conference on Algorithmic Aspects in Information and Management, Portland, OR, 1/01/2007.","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/a7c795be-c0a9-4d9a-a63b-175ada61de0d","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/a7c795be-c0a9-4d9a-a63b-175ada61de0d","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rahman , M S & Iliopoulos , C S 2007 , A New Efficient Algorithm for computing the Longest Common Subsequence . in M-Y Kao & X-Y Li (eds) , Algorithmic Aspects in Information and Management : Proceedings of the Third International Conference, AAIM 2007 . N/A edn , vol. N/A , Lecture Notes in Computer Science , vol. 4508 , Berlin and New York , pp. 82-90 . https://doi.org/10.1007/978-3-540-72870-2_8","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W806430740","https://openalex.org/W1489582159","https://openalex.org/W1823536187","https://openalex.org/W1970026646","https://openalex.org/W1974671004","https://openalex.org/W1979109797","https://openalex.org/W1999395788","https://openalex.org/W2010260400","https://openalex.org/W2012010763","https://openalex.org/W2015292449","https://openalex.org/W2027506564","https://openalex.org/W2040176884","https://openalex.org/W2041650430","https://openalex.org/W2055043387","https://openalex.org/W2062202510","https://openalex.org/W2073544604","https://openalex.org/W2088055539","https://openalex.org/W2091822872","https://openalex.org/W2109227373","https://openalex.org/W2130200371","https://openalex.org/W2137120608","https://openalex.org/W2145838433","https://openalex.org/W2152506638","https://openalex.org/W2162744351","https://openalex.org/W2295860335","https://openalex.org/W2363970847","https://openalex.org/W2996186646"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":19}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}