{"id":"https://openalex.org/W2109227373","doi":"https://doi.org/10.1109/spire.2000.878178","title":"A survey of longest common subsequence algorithms","display_name":"A survey of longest common subsequence algorithms","publication_year":2002,"publication_date":"2002-11-07","ids":{"openalex":"https://openalex.org/W2109227373","doi":"https://doi.org/10.1109/spire.2000.878178","mag":"2109227373"},"language":"en","primary_location":{"id":"doi:10.1109/spire.2000.878178","doi":"https://doi.org/10.1109/spire.2000.878178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spire.2000.878178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5078536084","display_name":"Lasse Bergroth","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"L. Bergroth","raw_affiliation_strings":["Department of Computer Science, University of Turku, Turku, Finland","Dept. of Comput. Sci., Turku Univ., Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Turku Univ., Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013089741","display_name":"Harri Hakonen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"H. Hakonen","raw_affiliation_strings":["Department of Computer Science, University of Turku, Turku, Finland","Dept. of Comput. Sci., Turku Univ., Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Turku Univ., Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090584872","display_name":"Timo Raita","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"T. Raita","raw_affiliation_strings":["Department of Computer Science, University of Turku, Turku, Finland","Dept. of Comput. Sci., Turku Univ., Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Turku Univ., Finland","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I155660961"],"apc_list":null,"apc_paid":null,"fwci":2.9904,"has_fulltext":false,"cited_by_count":655,"citation_normalized_percentile":{"value":0.9264932,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"48"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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.0,"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","display_name":"longest common subsequence","score":0.9990000128746033},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.7710000276565552},{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.45100000500679016},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.574999988079071},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.7440000176429749},{"id":"https://openalex.org/keywords/execution-time","display_name":"execution time","score":0.7279999852180481},{"id":"https://openalex.org/keywords/data-structures","display_name":"data structures","score":0.656000018119812}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.8872236013412476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7517200708389282},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7155430316925049},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6330389976501465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5744994282722473},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.44450920820236206},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4367635250091553},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43542158603668213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.375021368265152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16781941056251526},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07836753129959106},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0712634027004242},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/spire.2000.878178","doi":"https://doi.org/10.1109/spire.2000.878178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spire.2000.878178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W10539125","https://openalex.org/W938539187","https://openalex.org/W1526009719","https://openalex.org/W1529615245","https://openalex.org/W1567669771","https://openalex.org/W1602643665","https://openalex.org/W1937857347","https://openalex.org/W1969214222","https://openalex.org/W1970026646","https://openalex.org/W1992904575","https://openalex.org/W1998241318","https://openalex.org/W2010260400","https://openalex.org/W2012010763","https://openalex.org/W2015292449","https://openalex.org/W2021487990","https://openalex.org/W2023784545","https://openalex.org/W2026097868","https://openalex.org/W2027506564","https://openalex.org/W2038268267","https://openalex.org/W2040176884","https://openalex.org/W2041650430","https://openalex.org/W2044459110","https://openalex.org/W2045594551","https://openalex.org/W2054882906","https://openalex.org/W2055043387","https://openalex.org/W2069893028","https://openalex.org/W2070474244","https://openalex.org/W2071184135","https://openalex.org/W2082630739","https://openalex.org/W2093513138","https://openalex.org/W2130200371","https://openalex.org/W2162744351","https://openalex.org/W2165654401","https://openalex.org/W2610179052","https://openalex.org/W2611477341","https://openalex.org/W2993945890"],"related_works":["https://openalex.org/W1746697883","https://openalex.org/W3022573534","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":{"The":[0,29],"aim":[1],"of":[2,11,31,39,90,103,120,123],"this":[3,96,101],"paper":[4,114],"is":[5,97],"to":[6,56,109],"give":[7],"a":[8,59,117],"comprehensive":[9],"comparison":[10],"well-known":[12],"longest":[13],"common":[14],"subsequence":[15],"algorithms":[16],"(for":[17],"two":[18],"input":[19],"strings)":[20],"and":[21,69,79],"study":[22],"their":[23],"behaviour":[24],"in":[25,51],"various":[26],"application":[27],"environments.":[28],"performance":[30,122],"the":[32,37,40,46,52,66,76,82,88,91,98,110,113,121,124],"methods":[33,63],"depends":[34,85],"heavily":[35],"on":[36,87],"properties":[38],"problem":[41],"instance":[42],"as":[43,45],"well":[44],"supporting":[47],"data":[48],"structures":[49],"used":[50],"implementation.":[53],"We":[54],"want":[55],"make":[57],"also":[58],"clear":[60],"distinction":[61],"between":[62],"that":[64],"determine":[65],"actual":[67],"lcs":[68],"those":[70],"calculating":[71],"only":[72,116],"its":[73],"length,":[74],"since":[75],"execution":[77],"time":[78,100],"more":[80,126],"importantly,":[81],"space":[83],"demand":[84],"crucially":[86],"type":[89],"task.":[92],"To":[93],"our":[94],"knowledge,":[95],"first":[99],"kind":[102],"survey":[104],"has":[105],"been":[106],"done.":[107],"Due":[108],"page":[111],"limits,":[112],"gives":[115],"coarse":[118],"overview":[119],"algorithms;":[125],"detailed":[127],"studies":[128],"are":[129],"reported":[130],"elsewhere.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":28},{"year":2024,"cited_by_count":34},{"year":2023,"cited_by_count":26},{"year":2022,"cited_by_count":23},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":34},{"year":2019,"cited_by_count":36},{"year":2018,"cited_by_count":42},{"year":2017,"cited_by_count":31},{"year":2016,"cited_by_count":35},{"year":2015,"cited_by_count":44},{"year":2014,"cited_by_count":34},{"year":2013,"cited_by_count":42},{"year":2012,"cited_by_count":43}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-10T00:00:00"}