{"id":"https://openalex.org/W2372042166","doi":null,"title":"A New DNA Computing\u2032s Algorithm for 3-Dimensional Matching Problem Based on Divide and Conquer Strategy","display_name":"A New DNA Computing\u2032s Algorithm for 3-Dimensional Matching Problem Based on Divide and Conquer Strategy","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2372042166","mag":"2372042166"},"language":"en","primary_location":{"id":"mag:2372042166","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-DZXU201008017.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306500319","display_name":"Dianzi xuebao","issn_l":"0372-2112","issn":["0372-2112"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-40","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Dianzi xuebao","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5017557124","display_name":"Zhibang Yang","orcid":"https://orcid.org/0009-0005-1523-5253","observed_orcids":["https://orcid.org/0009-0005-1523-5253"]},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhibang Yang","raw_affiliation_strings":["School of Computer and Communications, Hunan University, Changsha Hunan 410082, China)"],"raw_orcid":"https://orcid.org/0009-0005-1523-5253","affiliations":[{"raw_affiliation_string":"School of Computer and Communications, Hunan University, Changsha Hunan 410082, China)","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017557124"],"corresponding_institution_ids":["https://openalex.org/I16609230"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28106312,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dna-computing","display_name":"DNA computing","score":0.9980000257492065},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.878000020980835},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.9070000052452087},{"id":"https://openalex.org/keywords/spatial-efficiency","display_name":"space efficiency","score":0.5199999809265137},{"id":"https://openalex.org/keywords/error-tolerance","display_name":"error tolerance","score":0.7070000171661377},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.4449999928474426}],"concepts":[{"id":"https://openalex.org/C82047324","wikidata":"https://www.wikidata.org/wiki/Q177126","display_name":"DNA computing","level":3,"score":0.9522824287414551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6034403443336487},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5712897181510925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5585501790046692},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5379219055175781},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44540491700172424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3013317584991455},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.1142524778842926},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2372042166","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-DZXU201008017.htm","pdf_url":null,"source":{"id":"https://openalex.org/S4306500319","display_name":"Dianzi xuebao","issn_l":"0372-2112","issn":["0372-2112"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-40","russia-white-list-3"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Dianzi xuebao","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1995990573","https://openalex.org/W2017283514","https://openalex.org/W2165762773","https://openalex.org/W2283456265","https://openalex.org/W2369900433","https://openalex.org/W3002029028","https://openalex.org/W2619655363","https://openalex.org/W2349612376","https://openalex.org/W2085191844","https://openalex.org/W2369585560"],"abstract_inverted_index":{"At":[0],"present,it":[1],"is":[2,34,58,64,76,119],"how":[3],"to":[4,24,115,125,133],"decrease":[5],"the":[6,15,22,26,45,51,55,67,99,126,141],"DNA":[7,18,27,40,68,73,81,101,146],"volume":[8,28],"that":[9],"plays":[10],"an":[11],"important":[12],"role":[13],"in":[14,47],"development":[16],"of":[17,29,54,83,106],"computing.In":[19],"this":[20],"paper,for":[21],"objective":[23],"reduce":[25],"3-Dimensional":[30,107,138],"Matching":[31,108,139],"Problem":[32,109],"which":[33],"a":[35,71,78],"famous":[36],"NP-complete":[37],"problem,an":[38],"improved":[39],"computing":[41,69],"model":[42,49,57],"based":[43],"on":[44],"operations":[46],"Adleman-Lipton\u2032s":[48],"and":[50,62,70,98,122,136],"solution":[52],"space":[53],"sticker-based":[56],"put":[59],"forward.Then,the":[60],"divide":[61],"comquer":[63],"introduced":[65],"into":[66],"new":[72,117],"computing\u2032s":[74,147],"algorithm":[75,118],"proposed.In":[77],"computer":[79],"simulation,the":[80],"strands":[82],"maximum":[84],"number":[85],"required":[86],"was":[87,91,96,103],"O(1.414n),the":[88],"time":[89],"complexity":[90],"O(15\u00d7n+30\u00d7q),the":[92],"test":[93],"tube":[94],"complesity":[95],"O(1)":[97],"longest":[100],"strand":[102],"O(15n/2+45q).Hence,the":[104],"scale":[105],"may":[110],"be":[111,131],"enlarged":[112],"from":[113],"67":[114],"134.This":[116],"highly":[120],"space-efficient":[121],"error-tolerant":[123],"compared":[124],"conventional":[127],"brute-force":[128],"searching,and":[129],"can":[130,143],"scaled-up":[132],"solve":[134],"large":[135],"hard":[137],"Problem.By":[140],"approach,we":[142],"also":[144],"show":[145],"vast":[148],"potentials":[149],"for":[150],"resolving":[151],"NP":[152],"problems.":[153]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}