{"id":"https://openalex.org/W2054120410","doi":"https://doi.org/10.1109/bibe.2007.4375584","title":"Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings","display_name":"Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2054120410","doi":"https://doi.org/10.1109/bibe.2007.4375584","mag":"2054120410"},"language":"en","primary_location":{"id":"doi:10.1109/bibe.2007.4375584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibe.2007.4375584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 7th International Symposium on BioInformatics and BioEngineering","raw_type":"proceedings-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/A5080922483","display_name":"Marina Barsky","orcid":null},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Marina Barsky","raw_affiliation_strings":["Department of Computer Science, University of Victoria, Canada","University of Victoria, Victoria#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"University of Victoria, Victoria#TAB#","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063629937","display_name":"Ulrike Stege","orcid":"https://orcid.org/0000-0001-9466-7196"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ulrike Stege","raw_affiliation_strings":["Department of Computer Science, University of Victoria, Canada","University of Victoria, Victoria#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"University of Victoria, Victoria#TAB#","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011013528","display_name":"Alex Thomo","orcid":"https://orcid.org/0000-0002-3020-2258"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alex Thomo","raw_affiliation_strings":["Department of Computer Science, University of Victoria, Canada","University of Victoria, Victoria#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"University of Victoria, Victoria#TAB#","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033180528","display_name":"Chris Upton","orcid":"https://orcid.org/0000-0002-9019-8967"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Chris Upton","raw_affiliation_strings":["Department of Biochemistry & Microbiology, University of Victoria, Canada","Department of Biochemistry & Microbiology, University of Victoria, Canada. Email: cupton@uvic.ca"],"affiliations":[{"raw_affiliation_string":"Department of Biochemistry & Microbiology, University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Department of Biochemistry & Microbiology, University of Victoria, Canada. Email: cupton@uvic.ca","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5080922483"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":null,"apc_paid":null,"fwci":0.4692,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74747057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"644","issue":null,"first_page":"327","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9890000224113464,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9873999953269958,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9398780465126038},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7335519194602966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5864250063896179},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.5600090026855469},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5284796953201294},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5135834217071533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48380130529403687},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.45356011390686035},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4530186653137207},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4300650954246521},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36296898126602173},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.3476629853248596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3247188925743103}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9398780465126038},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7335519194602966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5864250063896179},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.5600090026855469},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5284796953201294},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5135834217071533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48380130529403687},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.45356011390686035},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4530186653137207},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4300650954246521},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36296898126602173},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.3476629853248596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3247188925743103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/bibe.2007.4375584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibe.2007.4375584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 7th International Symposium on BioInformatics and BioEngineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.584.8751","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.584.8751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://webhome.cs.uvic.ca/~thomo/papers/bibe07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1501400124","https://openalex.org/W1529615245","https://openalex.org/W1542057217","https://openalex.org/W1548604551","https://openalex.org/W1600463518","https://openalex.org/W1754581094","https://openalex.org/W1967690823","https://openalex.org/W1970026646","https://openalex.org/W2003021193","https://openalex.org/W2021487990","https://openalex.org/W2022835995","https://openalex.org/W2040176884","https://openalex.org/W2041397659","https://openalex.org/W2044030465","https://openalex.org/W2068987066","https://openalex.org/W2071184135","https://openalex.org/W2074231493","https://openalex.org/W2077383738","https://openalex.org/W2080959872","https://openalex.org/W2082630739","https://openalex.org/W2109227373","https://openalex.org/W2130200371","https://openalex.org/W2146054286","https://openalex.org/W2165654401","https://openalex.org/W2610179052","https://openalex.org/W2914364168","https://openalex.org/W3147360682","https://openalex.org/W6632492435","https://openalex.org/W6637792530","https://openalex.org/W6681537298"],"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":{"We":[0,40,94,106],"investigate":[1],"the":[2,42,56,77,91,102,117],"k-LCS":[3,92],"problem":[4,19],"that":[5,76,108],"is":[6,20,35],"finding":[7],"a":[8,61,97],"longest":[9],"common":[10],"subsequence":[11],"(LCS)":[12],"for":[13,26,31,89],"k":[14,27],"given":[15],"input":[16],"strings.":[17],"The":[18],"known":[21],"to":[22,67,79,100,126],"have":[23],"practical":[24,112],"solutions":[25],"=":[28],"2,":[29],"but":[30],"higher":[32,68,80],"dimensions":[33,81],"it":[34],"not":[36],"very":[37],"well":[38,49],"explored.":[39],"consider":[41],"algorithms":[43,74,88,110],"by":[44,132],"Miller":[45],"and":[46,59,134],"Myers":[47],"as":[48,50,113],"Wu":[51],"et":[52],"al.":[53],"which":[54],"solve":[55],"2-LCS":[57],"problem,":[58],"shed":[60],"new":[62,98],"light":[63],"on":[64],"their":[65],"generalization":[66,78],"dimensions.":[69],"First,":[70],"we":[71,85],"redesign":[72],"both":[73],"such":[75],"becomes":[82],"natural.":[83],"Then":[84],"present":[86],"our":[87,109],"solving":[90],"problem.":[93],"further":[95],"propose":[96],"approach":[99],"reduce":[101],"algorithms'":[103],"space":[104],"complexity.":[105],"demonstrate":[107],"are":[111],"they":[114],"significantly":[115],"outperform":[116],"dynamic":[118],"programming":[119],"approaches.":[120],"Our":[121],"results":[122],"stand":[123],"in":[124,129],"contrast":[125],"observations":[127],"made":[128],"previous":[130],"work":[131],"Irving":[133],"Fraser.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}