{"id":"https://openalex.org/W1967690823","doi":"https://doi.org/10.1007/s10878-006-9020-x","title":"RNA multiple structural alignment with longest common subsequences","display_name":"RNA multiple structural alignment with longest common subsequences","publication_year":2006,"publication_date":"2006-11-02","ids":{"openalex":"https://openalex.org/W1967690823","doi":"https://doi.org/10.1007/s10878-006-9020-x","mag":"1967690823"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-006-9020-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-006-9020-x","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/A5035977878","display_name":"Sergey Bereg","orcid":"https://orcid.org/0000-0002-2866-6766"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sergey Bereg","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083-0688, USA","University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083-0688, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035384293","display_name":"Marcin Kubica","orcid":"https://orcid.org/0000-0002-8256-7726"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Kubica","raw_affiliation_strings":["Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland","Warsaw University"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Warsaw University","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061843884","display_name":"Tomasz Wale\u0144","orcid":"https://orcid.org/0000-0002-7369-3309"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz Wale\u0144","raw_affiliation_strings":["Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland","Warsaw University"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Warsaw University","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070925973","display_name":"Binhai Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I23732399","display_name":"Montana State University","ror":"https://ror.org/02w0trx84","country_code":"US","type":"education","lineage":["https://openalex.org/I23732399","https://openalex.org/I4210126032"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Binhai Zhu","raw_affiliation_strings":["Department of Computer Science, Montana State University, Bozeman, MT, 59717-3880, USA","Montana State Univ"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Montana State University, Bozeman, MT, 59717-3880, USA","institution_ids":["https://openalex.org/I23732399"]},{"raw_affiliation_string":"Montana State Univ","institution_ids":["https://openalex.org/I23732399"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035977878"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.6771,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.66300465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"2","first_page":"179","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":1.0,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9986000061035156,"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/T11482","display_name":"RNA modifications and cancer","score":0.9937999844551086,"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.9186028242111206},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8067554235458374},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.7442165017127991},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7297208905220032},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6242210268974304},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6079989075660706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5958763360977173},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.5657120943069458},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5329300761222839},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5145453810691833},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4881032407283783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.414956271648407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4047059416770935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24006488919258118}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9186028242111206},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8067554235458374},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7442165017127991},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7297208905220032},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6242210268974304},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6079989075660706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5958763360977173},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.5657120943069458},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5329300761222839},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5145453810691833},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4881032407283783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.414956271648407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4047059416770935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24006488919258118},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-006-9020-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-006-9020-x","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:13:y:2007:i:2:d:10.1007_s10878-006-9020-x","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-006-9020-x","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W142215251","https://openalex.org/W1526127001","https://openalex.org/W1529279241","https://openalex.org/W1542426682","https://openalex.org/W1608492704","https://openalex.org/W1916412816","https://openalex.org/W1974063126","https://openalex.org/W1990169993","https://openalex.org/W1999395788","https://openalex.org/W2003021193","https://openalex.org/W2010260400","https://openalex.org/W2025763720","https://openalex.org/W2040176884","https://openalex.org/W2045486252","https://openalex.org/W2054931730","https://openalex.org/W2069992928","https://openalex.org/W2085239230","https://openalex.org/W2087064593","https://openalex.org/W2092046673","https://openalex.org/W2123241418","https://openalex.org/W2158771361","https://openalex.org/W2170709884","https://openalex.org/W3004540582","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W4225868058","https://openalex.org/W1746697883","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":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}