{"id":"https://openalex.org/W1521375956","doi":"https://doi.org/10.1007/978-0-387-77251-6_8","title":"A Fast Longest Common Subsequence Algorithm for Biosequences Alignment","display_name":"A Fast Longest Common Subsequence Algorithm for Biosequences Alignment","publication_year":2008,"publication_date":"2008-02-25","ids":{"openalex":"https://openalex.org/W1521375956","doi":"https://doi.org/10.1007/978-0-387-77251-6_8","mag":"1521375956"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-77251-6_8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-77251-6_8","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-77251-6_8.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-77251-6_8.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100431708","display_name":"Wei Liu","orcid":"https://orcid.org/0000-0001-9475-6455"},"institutions":[{"id":"https://openalex.org/I9842412","display_name":"Nanjing University of Aeronautics and Astronautics","ror":"https://ror.org/01scyh794","country_code":"CN","type":"education","lineage":["https://openalex.org/I9842412"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Liu","raw_affiliation_strings":["Institute of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, 210093, China"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, 210093, China","institution_ids":["https://openalex.org/I9842412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112361170","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0002-6666-2483"},"institutions":[{"id":"https://openalex.org/I78978612","display_name":"Yangzhou University","ror":"https://ror.org/03tqb8s11","country_code":"CN","type":"education","lineage":["https://openalex.org/I78978612"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Chen","raw_affiliation_strings":["Department of Computer Science, Yangzhou University, 225009, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yangzhou University, 225009, China","institution_ids":["https://openalex.org/I78978612"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100431708"],"corresponding_institution_ids":["https://openalex.org/I9842412"],"apc_list":null,"apc_paid":null,"fwci":0.5326,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63071839,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"69"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9865000247955322,"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/T12029","display_name":"DNA and Biological Computing","score":0.9715999960899353,"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.9584944248199463},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.7983818054199219},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.6332933306694031},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.545253336429596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.516228437423706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5121002197265625},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.5118905305862427},{"id":"https://openalex.org/keywords/tracing","display_name":"Tracing","score":0.43939754366874695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34076064825057983},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.2918696403503418},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2775295674800873},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06890326738357544}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9584944248199463},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.7983818054199219},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.6332933306694031},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.545253336429596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.516228437423706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5121002197265625},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.5118905305862427},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.43939754366874695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34076064825057983},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.2918696403503418},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2775295674800873},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06890326738357544},{"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},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-77251-6_8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-77251-6_8","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-77251-6_8.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Federation for Information Processing","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-77251-6_8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-77251-6_8","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-77251-6_8.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321605","display_name":"Government of Jiangsu Province","ror":"https://ror.org/004svx814"},{"id":"https://openalex.org/F4320322769","display_name":"Natural Science Foundation of Jiangsu Province","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1521375956.pdf","grobid_xml":"https://content.openalex.org/works/W1521375956.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1887778146","https://openalex.org/W2029475416","https://openalex.org/W2038268267","https://openalex.org/W2055043387","https://openalex.org/W2068448872","https://openalex.org/W2074231493","https://openalex.org/W2087064593","https://openalex.org/W2087191404","https://openalex.org/W2096827683","https://openalex.org/W2109227373","https://openalex.org/W2127515417","https://openalex.org/W2145830737","https://openalex.org/W2165654401","https://openalex.org/W2165968314"],"related_works":["https://openalex.org/W4390923554","https://openalex.org/W2520870971","https://openalex.org/W4385963882","https://openalex.org/W2950594955","https://openalex.org/W4385904708","https://openalex.org/W2147602940","https://openalex.org/W1887778146","https://openalex.org/W2109822297","https://openalex.org/W3101942351","https://openalex.org/W2188128213"],"abstract_inverted_index":{"Searching":[0],"for":[1,21,88],"the":[2,12,32,35,48,59,64,67,85,95,112,115,122],"longest":[3],"common":[4],"substring":[5],"(LCS)":[6],"of":[7,11,34,69,97,104,114,117,125],"biosequences":[8],"is":[9,26,90,94,107,111,144],"one":[10],"most":[13],"important":[14],"tasks":[15],"in":[16],"Bioinformatics.":[17],"A":[18],"fast":[19],"algorithm":[20,29,137],"LCS":[22,70,116,151],"problem":[23],"named":[24],"FAST_LCS":[25,89],"presented.":[27],"The":[28],"first":[30],"seeks":[31],"successors":[33],"initial":[36],"identical":[37,49,60,98],"character":[38,61,99],"pairs":[39,50,100],"according":[40],"to":[41,45],"a":[42],"successor":[43],"table":[44],"obtain":[46],"all":[47],"and":[51,78,83,101,143,146],"their":[52],"levels.":[53],"Then":[54],"by":[55],"tracing":[56],"back":[57],"from":[58],"pair":[62],"at":[63],"largest":[65],"level,":[66],"result":[68,120,142],"can":[71,138],"be":[72],"obtained.":[73],"For":[74],"two":[75],"sequences":[76,124],"X":[77],"Y":[79],"with":[80],"lengths":[81],"n":[82],"m,":[84],"memory":[86],"required":[87],"max{8*(n+1)*8*(m*1),L},":[91],"here":[92],"L":[93],"number":[96],"time":[102],"complexity":[103],"parallel":[105,130],"implementation":[106],"O(|LCS(X,Y)|),":[108],"here,":[109],"|LCS(X,Y)|":[110],"length":[113],"X,Y.":[118],"Experimental":[119],"on":[121],"gene":[123],"tigr":[126],"database":[127],"using":[128],"MPP":[129],"computer":[131],"Shenteng":[132],"1800":[133],"shows":[134],"that":[135],"our":[136],"get":[139],"exact":[140],"correct":[141],"faster":[145],"more":[147],"efficient":[148],"than":[149],"other":[150],"algorithms.":[152]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}