{"id":"https://openalex.org/W1488241959","doi":"https://doi.org/10.1007/11925903_4","title":"All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size","display_name":"All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1488241959","doi":"https://doi.org/10.1007/11925903_4","mag":"1488241959"},"language":"en","primary_location":{"id":"doi:10.1007/11925903_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11925903_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5006548981","display_name":"Flor\u00edn Manea","orcid":"https://orcid.org/0000-0001-6094-3324"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Florin Manea","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025443239","display_name":"Carlos Mart\u0131\u0301n-Vide","orcid":"https://orcid.org/0000-0003-1670-6000"},"institutions":[{"id":"https://openalex.org/I55952717","display_name":"Universidad Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Carlos Mart\u00edn-Vide","raw_affiliation_strings":["Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain"],"affiliations":[{"raw_affiliation_string":"Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain","institution_ids":["https://openalex.org/I55952717"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055787693","display_name":"V\u00edctor Mitrana","orcid":"https://orcid.org/0000-0002-1457-8933"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I55952717","display_name":"Universidad Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES","RO"],"is_corresponding":false,"raw_author_name":"Victor Mitrana","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania","Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]},{"raw_affiliation_string":"Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain","institution_ids":["https://openalex.org/I55952717"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006548981"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1394,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95880059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7236477136611938},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.6213064193725586},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6116570234298706},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5486836433410645},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48375391960144043},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4816664457321167},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4529808759689331},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37380483746528625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3491377830505371},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21873649954795837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20992550253868103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7236477136611938},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.6213064193725586},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6116570234298706},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5486836433410645},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48375391960144043},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4816664457321167},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4529808759689331},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37380483746528625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3491377830505371},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21873649954795837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20992550253868103},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11925903_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11925903_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W22390689","https://openalex.org/W35024350","https://openalex.org/W51443600","https://openalex.org/W64579671","https://openalex.org/W1544955362","https://openalex.org/W1593993808","https://openalex.org/W2011039300","https://openalex.org/W2021416330","https://openalex.org/W2083313660","https://openalex.org/W2158365276","https://openalex.org/W2276729638","https://openalex.org/W2492317011","https://openalex.org/W2494259042","https://openalex.org/W4205872288","https://openalex.org/W4210461990","https://openalex.org/W4285719527","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W2883329459","https://openalex.org/W2060490057","https://openalex.org/W2966358819","https://openalex.org/W3089684342","https://openalex.org/W3030125579","https://openalex.org/W2299459657","https://openalex.org/W3133463035","https://openalex.org/W245150611","https://openalex.org/W1969885872","https://openalex.org/W2107287896"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}