{"id":"https://openalex.org/W2019844103","doi":"https://doi.org/10.1142/s0129054113500342","title":"BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM","display_name":"BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2019844103","doi":"https://doi.org/10.1142/s0129054113500342","mag":"2019844103"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500342","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500342","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5041822808","display_name":"Sebastian Deorowicz","orcid":"https://orcid.org/0000-0002-9496-733X"},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"education","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"SEBASTIAN DEOROWICZ","raw_affiliation_strings":["Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland","institution_ids":["https://openalex.org/I119004910"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006401571","display_name":"Agnieszka Danek","orcid":"https://orcid.org/0000-0003-1953-0880"},"institutions":[{"id":"https://openalex.org/I119004910","display_name":"Silesian University of Technology","ror":"https://ror.org/02dyjk442","country_code":"PL","type":"education","lineage":["https://openalex.org/I119004910"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"AGNIESZKA DANEK","raw_affiliation_strings":["Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland","institution_ids":["https://openalex.org/I119004910"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I119004910"],"apc_list":null,"apc_paid":null,"fwci":0.9735,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81951641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"24","issue":"08","first_page":"1281","last_page":"1298"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9984999895095825,"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/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9836000204086304,"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.9847092628479004},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.9063982367515564},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.778637170791626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6386141180992126},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6136652827262878},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5851150155067444},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5657692551612854},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5194393992424011},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34417927265167236},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3289073705673218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3166106343269348},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12674695253372192}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9847092628479004},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.9063982367515564},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.778637170791626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6386141180992126},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6136652827262878},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5851150155067444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5657692551612854},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5194393992424011},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34417927265167236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3289073705673218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3166106343269348},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12674695253372192},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113500342","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500342","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W34348666","https://openalex.org/W776417157","https://openalex.org/W1484185877","https://openalex.org/W1515150410","https://openalex.org/W1530458829","https://openalex.org/W1560893303","https://openalex.org/W1566604942","https://openalex.org/W1606755952","https://openalex.org/W1974063126","https://openalex.org/W1981409766","https://openalex.org/W1990061958","https://openalex.org/W1994790623","https://openalex.org/W1999395788","https://openalex.org/W2011839096","https://openalex.org/W2068472240","https://openalex.org/W2081933515","https://openalex.org/W2144662852","https://openalex.org/W2144884743","https://openalex.org/W2152064395","https://openalex.org/W4236298973","https://openalex.org/W4237822303","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1540010783","https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W4323338832","https://openalex.org/W3094761360"],"abstract_inverted_index":{"It":[0],"is":[1],"often":[2],"a":[3,34],"necessity":[4],"to":[5,9],"compare":[6],"some":[7],"sequences":[8],"find":[10],"out":[11],"how":[12],"similar":[13],"they":[14,63],"are.":[15],"There":[16],"are":[17,64],"many":[18],"similarity":[19],"measures":[20],"that":[21,62],"can":[22],"be":[23],"used,":[24],"e.g.,":[25],"longest":[26,36],"common":[27,37],"subsequence,":[28],"edit":[29],"distance,":[30],"sequence":[31],"alignment.":[32],"Recently":[33],"merged":[35],"subsequence":[38],"(MergedLCS)":[39],"problem":[40,55],"was":[41],"formulated":[42],"with":[43],"applications":[44],"in":[45,59],"bioinformatics.":[46],"We":[47],"propose":[48],"the":[49,53,70],"bit-parallel":[50],"algorithms":[51],"for":[52],"MergedLCS":[54],"and":[56],"evaluate":[57],"them":[58],"practice":[60],"showing":[61],"usually":[65],"tens":[66],"times":[67],"faster":[68],"than":[69],"already":[71],"published":[72],"methods.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}