{"id":"https://openalex.org/W2068472240","doi":"https://doi.org/10.1016/s0020-0190(01)00182-x","title":"A fast and practical bit-vector algorithm for the Longest Common Subsequence problem","display_name":"A fast and practical bit-vector algorithm for the Longest Common Subsequence problem","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2068472240","doi":"https://doi.org/10.1016/s0020-0190(01)00182-x","mag":"2068472240"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(01)00182-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00182-x","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5081848578","display_name":"Maxime Crochemore","orcid":"https://orcid.org/0000-0003-1087-1419"},"institutions":[{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Maxime Crochemore","raw_affiliation_strings":["Institut Gaspard-Monge, Universit\u00e9 de Marne-la-Vall\u00e9e, F-77454 Marne-la-Vall\u00e9e Cedex 2, France"],"affiliations":[{"raw_affiliation_string":"Institut Gaspard-Monge, Universit\u00e9 de Marne-la-Vall\u00e9e, F-77454 Marne-la-Vall\u00e9e Cedex 2, France","institution_ids":["https://openalex.org/I4210152518"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"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"]},{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["Department Computer Science, King's College London, London WC2R 2LS, UK","School of Computing, Curtin University of Technology, GPO Box 1987 U, Perth 6845, Western Australia"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, King's College London, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"School of Computing, Curtin University of Technology, GPO Box 1987 U, Perth 6845, Western Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017514466","display_name":"Yoan J. Pinz\u00f3n","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":true,"raw_author_name":"Yoan J. Pinzon","raw_affiliation_strings":["Department Computer Science, King's College London, London WC2R 2LS, UK"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, King's College London, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091075947","display_name":"James F. Reid","orcid":"https://orcid.org/0000-0001-6997-2850"},"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":"James F. Reid","raw_affiliation_strings":["Department Computer Science, King's College London, London WC2R 2LS, UK","LNCIB, Area Science Park, Padriciano 99, Triesta, 34102, Italy"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, King's College London, London WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"LNCIB, Area Science Park, Padriciano 99, Triesta, 34102, Italy","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017514466"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":2.7256,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.91234546,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"80","issue":"6","first_page":"279","last_page":"285"},"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/T11567","display_name":"semigroups and automata theory","score":0.9860000014305115,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9293637871742249},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7465839982032776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6902630925178528},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5311129689216614},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.511344850063324},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4499814808368683},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4383726119995117},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4373142123222351},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.41676512360572815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3870199918746948}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9293637871742249},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7465839982032776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6902630925178528},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5311129689216614},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.511344850063324},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4499814808368683},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4383726119995117},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4373142123222351},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.41676512360572815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3870199918746948},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0020-0190(01)00182-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00182-x","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.6017","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://igm.univ-mlv.fr/~mac/REC/DOC/01-lcs_ipl.ps","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/fdf12a5f-7516-40b4-85bc-41d5082a4aa3","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=0035980874&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":"Crochemore, M, Iliopoulos, C S, Pinzon, Y J & Reid, J F 2001, 'A fast and practical bit-vector algorithm for the Longest Common Subsequence problem', INFORMATION PROCESSING LETTERS, vol. 80, no. 6, pp. 279 - 285. https://doi.org/10.1016/S0020-0190(01)00182-X","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1501400124","https://openalex.org/W1514415888","https://openalex.org/W1647671624","https://openalex.org/W1970026646","https://openalex.org/W1980038595","https://openalex.org/W1981409766","https://openalex.org/W1994790623","https://openalex.org/W2012010763","https://openalex.org/W2038268267","https://openalex.org/W2045821558","https://openalex.org/W2075760092","https://openalex.org/W2090598620","https://openalex.org/W2093513138","https://openalex.org/W2100751585","https://openalex.org/W2165654401","https://openalex.org/W2340364767","https://openalex.org/W3133279294","https://openalex.org/W4206365503","https://openalex.org/W6636915900"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}