{"id":"https://openalex.org/W2109063488","doi":"https://doi.org/10.1142/s0129054103002096","title":"A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE","display_name":"A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2109063488","doi":"https://doi.org/10.1142/s0129054103002096","mag":"2109063488"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103002096","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002096","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/A5020126431","display_name":"Evgeny Dantsin","orcid":"https://orcid.org/0000-0002-8753-0279"},"institutions":[{"id":"https://openalex.org/I102101047","display_name":"Roosevelt University","ror":"https://ror.org/020vmqv16","country_code":"US","type":"education","lineage":["https://openalex.org/I102101047"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"EVGENY DANTSIN","raw_affiliation_strings":["School of Computer Science, Roosevelt University, 430 S. Michigan Ave., Chicago, IL 60605, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Roosevelt University, 430 S. Michigan Ave., Chicago, IL 60605, USA","institution_ids":["https://openalex.org/I102101047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089677759","display_name":"Alexander Wolpert","orcid":"https://orcid.org/0000-0002-1921-9403"},"institutions":[{"id":"https://openalex.org/I102101047","display_name":"Roosevelt University","ror":"https://ror.org/020vmqv16","country_code":"US","type":"education","lineage":["https://openalex.org/I102101047"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ALEXANDER WOLPERT","raw_affiliation_strings":["School of Computer Science, Roosevelt University, 430 S. Michigan Ave., Chicago, IL 60605, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Roosevelt University, 430 S. Michigan Ave., Chicago, IL 60605, USA","institution_ids":["https://openalex.org/I102101047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102101047"],"apc_list":null,"apc_paid":null,"fwci":0.228,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.53950169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"05","first_page":"933","last_page":"951"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","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/T12029","display_name":"DNA and Biological Computing","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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9983000159263611,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.7791070938110352},{"id":"https://openalex.org/keywords/dna-computing","display_name":"DNA computing","score":0.7046329379081726},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6575134992599487},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5926315784454346},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5391872525215149},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5357500910758972},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.5138990879058838},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.44079530239105225},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43727079033851624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38981306552886963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32308220863342285},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.11574256420135498},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.08503898978233337}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7791070938110352},{"id":"https://openalex.org/C82047324","wikidata":"https://www.wikidata.org/wiki/Q177126","display_name":"DNA computing","level":3,"score":0.7046329379081726},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6575134992599487},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5926315784454346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5391872525215149},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5357500910758972},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.5138990879058838},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.44079530239105225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43727079033851624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38981306552886963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32308220863342285},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.11574256420135498},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.08503898978233337},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054103002096","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002096","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.5430","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.5430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.roosevelt.edu/wolpert/DW-IJFCS.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W184024035","https://openalex.org/W1577360993","https://openalex.org/W1593993808","https://openalex.org/W1994801990","https://openalex.org/W2027603534","https://openalex.org/W2037375334","https://openalex.org/W2155372306","https://openalex.org/W2395938105","https://openalex.org/W2608489430","https://openalex.org/W4213041895","https://openalex.org/W4242889986","https://openalex.org/W4253598477"],"related_works":["https://openalex.org/W2045826397","https://openalex.org/W2327776271","https://openalex.org/W2065896142","https://openalex.org/W2585670853","https://openalex.org/W2043435342","https://openalex.org/W2085484366","https://openalex.org/W1777291824","https://openalex.org/W3037437009","https://openalex.org/W2108530105","https://openalex.org/W2109063488"],"abstract_inverted_index":{"One":[0],"of":[1,48,60],"the":[2,58],"most":[3],"serious":[4],"problems":[5],"in":[6,103],"DNA":[7,12,17,61,71],"computing":[8],"is":[9,43,51,102],"that":[10,74,82,95],"basic":[11],"operations":[13,21,37,62],"are":[14],"faulty.":[15],"Many":[16],"computation":[18,72],"models":[19,34],"use":[20,35],"based":[22],"on":[23],"annealing":[24],"and":[25,63,90],"magnetic-beads":[26],"separation":[27],"which":[28],"sometimes":[29],"produce":[30],"undesirable":[31],"results.":[32],"Some":[33],"reliable":[36],"only":[38],"but":[39],"their":[40,64],"computational":[41,65,93],"power":[42],"too":[44],"weak.":[45],"The":[46],"purpose":[47],"this":[49,84,100],"paper":[50],"to":[52],"find":[53],"a":[54,69],"good":[55],"trade-off":[56],"between":[57],"robustness":[59],"power.":[66],"We":[67,80],"present":[68],"robust":[70],"model":[73,85,101],"can":[75,86,96],"solve":[76,87],"computationally":[77],"hard":[78],"problems.":[79],"prove":[81],"(i)":[83],"PSPACE-complete":[88],"problems,":[89],"(ii)":[91],"any":[92],"problem":[94],"be":[97],"solved":[98],"with":[99],"PSPACE.":[104]},"counts_by_year":[{"year":2018,"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"}