{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:26:41Z","timestamp":1743006401045,"version":"3.40.3"},"publisher-location":"India","reference-count":12,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132210375"},{"type":"electronic","value":"9788132210382"}],"license":[{"start":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:00:00Z","timestamp":1354579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:00:00Z","timestamp":1354579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-81-322-1038-2_7","type":"book-chapter","created":{"date-parts":[[2012,12,3]],"date-time":"2012-12-03T20:49:11Z","timestamp":1354567751000},"page":"75-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Application Oriented Graph Theoretical Problems with DNA Computing"],"prefix":"10.1007","author":[{"given":"Veronika","family":"Hal\u00e1sz","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Heged\u00fcs","sequence":"additional","affiliation":[]},{"given":"Istv\u00e1n","family":"Horny\u00e1k","sequence":"additional","affiliation":[]},{"given":"Benedek","family":"Nagy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Leonard M. Adleman. Molecular computation of solutions to combinatorial problems. Science 266, 1994, pp. 1021\u20131024.","DOI":"10.1126\/science.7973651"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Armen S. Asratian, Tristan M. J. Denley, and Roland H\u00e4ggkvist. Bipartite Graphs and their Applications. Cambridge University Press, New York, USA, 1998.","DOI":"10.1017\/CBO9780511984068"},{"key":"7_CR3","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si. Linked: The New Science of Networks, Perseus Publishing, 2002."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Anna Bauer-Mehren, Michael Rautschka, Ferran Sanz, and Laura I. Furlong. DisGeNET: a Cytoscape plugin to visualize, integrate, search and analyze genedisease networks. Bioinformatics 26\/22 (2010), 2924\u20132926.","DOI":"10.1093\/bioinformatics\/btq538"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10462-011-9247-5","volume":"38","author":"Hossein Eghdami and Majid Darehmiraki","year":"2012","unstructured":"Hossein Eghdami and Majid Darehmiraki. Application of DNA computing in graph theory. Artificial Intelligence Review 38, 2012, 223\u2013235","journal-title":"Artificial Intelligence Review"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0304-3975(02)00496-6","volume":"303","author":"Jean-Claude Fournier","year":"2003","unstructured":"Jean-Claude Fournier. Combinatorics of perfect matchings in plane bipartite graphs and application to tilings. Theoretical Computer Science 303, 2003, 333\u2013351.","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"L. C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1\/3, (1979), 215\u2013239.","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Richard J. Lipton. DNA solution of HARD computational problems. Science 268, 1995, pp. 542\u2013545.","DOI":"10.1126\/science.7725098"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"R. Sathyapriya, M.S. Vijayabaskar, S. Vishveshwara. Insights into protein-DNA interactions through structure network analysis. PLoS Comput Biol 4, 2008","DOI":"10.1371\/journal.pcbi.1000170"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Amos Tanay, Roded Sharan, Ron Shamir. Discovering statistically significant biclusters in gene expression data. Proceedings of the Tenth International Conference on Intelligent Systems for, Molecular Biology, 2002, pp. 136\u2013144.","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Hiroki Uejima, Masami Hagiya. Analyzing secondary structure transition paths of DNA\/RNA molecules. DNA Computing, 9th International Workshop on DNA Based Computers, Madison, USA Springer-Verlag, Berlin, Heidelberg, 2004, pp. 86\u201390.","DOI":"10.1007\/978-3-540-24628-2_10"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Katharina Anna Zweig, Michael Kaufmann. A systematic approach to the one-mode projection of bipartite graphs. Social Network Analysis and Mining 1 (2011) 187-218.","DOI":"10.1007\/s13278-011-0021-0"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1038-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T14:35:41Z","timestamp":1720708541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1038-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,4]]},"ISBN":["9788132210375","9788132210382"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1038-2_7","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2012,12,4]]},"assertion":[{"value":"4 December 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}