{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T04:29:12Z","timestamp":1660969752600},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,8,30]],"date-time":"2015-08-30T00:00:00Z","timestamp":1440892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s11265-015-1027-z","type":"journal-article","created":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T05:23:23Z","timestamp":1440825803000},"page":"389-400","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Heuristic Search Space Generation for Maximum Clique Problem Inspired in Biomolecular Filtering"],"prefix":"10.1007","volume":"83","author":[{"given":"Nelson E.","family":"Ord\u00f3\u00f1ez-Guill\u00e9n","sequence":"first","affiliation":[]},{"given":"Israel M.","family":"Mart\u00ednez-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,30]]},"reference":[{"issue":"11","key":"1027_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M. (1994). Molecular Computation of Solutions to Combinatorial Problems. Science, 266(11), 1021\u20131024.","journal-title":"Science"},{"issue":"5210","key":"1027_CR2","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R Lipton","year":"1995","unstructured":"Lipton, R. (1995). DNA Solution of Hard Computational Problems. Science, 268(5210), 542\u2013545.","journal-title":"Science"},{"issue":"5337","key":"1027_CR3","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q Ouyang","year":"1997","unstructured":"Ouyang, Q., Kaplan, P.D., Liu, S., & Libchaber, A. (1997). DNA Solution of the Maximal Clique Problem. Science, 278(5337), 446\u2013449.","journal-title":"Science"},{"issue":"4","key":"1027_CR4","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1089\/cmb.1998.5.615","volume":"5","author":"S Roweis","year":"1998","unstructured":"Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., & et al. (1998). A sticker based model for DNA computation. Journal of Computational Biology, 5(4), 615\u2013629.","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"1027_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1089\/cmb.1998.5.255","volume":"5","author":"L Smith","year":"1998","unstructured":"Smith, L., Corn, R., Condon, A., Lagally, M., Frutos, A., Liu, Q., & et al. (1998). A surface-based approach to DNA computation. Journal of Computational Biology, 5(2), 255\u2013267.","journal-title":"Journal of Computational Biology"},{"issue":"6693","key":"1027_CR6","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E Winfree","year":"1998","unstructured":"Winfree, E., Liu, F., Wenzler, L.A., & Seeman, N.A. (1998). Design and self-assembly of two-dimensional DNA crystals. Nature, 394(6693), 539\u2013544.","journal-title":"Nature"},{"issue":"5469","key":"1027_CR7","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K Sakamoto","year":"2000","unstructured":"Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & other (2000). Molecular Computation by DNA Hairpin Formation. Science, 288(5469), 1223\u20131226.","journal-title":"Science"},{"issue":"5","key":"1027_CR8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s002360050125","volume":"35","author":"L Kari","year":"1998","unstructured":"Kari, L., Paun, G., Rozenberg, G., Salomaa, A., & Yu, S. (1998). DNA computing, sticker systems, and universality . Acta Informatica, 35(5), 401\u2013420.","journal-title":"Acta Informatica"},{"issue":"3","key":"1027_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0010-4655(02)00270-9","volume":"144","author":"K-H Zimmermann","year":"2002","unstructured":"Zimmermann, K.-H. (2002). Efficient DNA sticker algorithms for NP-complete graph problems. Computer Physics Communications, 144(3), 297\u2013309.","journal-title":"Computer Physics Communications"},{"key":"1027_CR10","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Jim\u00e9nez, M.J., & Sancho-Caparrini, F. (2002). Solving knapsack problems in a sticker based model. In Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing (pp. 161\u2013171): Springer.","DOI":"10.1007\/3-540-48017-X_15"},{"issue":"3","key":"1027_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.jpdc.2008.06.014","volume":"69","author":"IM Mart\u00ednez-P\u00e9rez","year":"2009","unstructured":"Mart\u00ednez-P\u00e9rez, I.M., & Zimmermann, K.-H. (2009). Parallel bioinspired algorithms for NP complete graph problems. Journal of Parallel and Distributed Computing, 69(3), 221\u2013229.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"1027_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s11265-008-0322-3","volume":"58","author":"IM Mart\u00ednez-P\u00e9rez","year":"2008","unstructured":"Mart\u00ednez-P\u00e9rez, I.M., Brandt, W., Wild, M., & Zimmermann, K.-H (2008). Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures. Journal of Signal Processing Systems, 58(2), 117\u2013124.","journal-title":"Journal of Signal Processing Systems"},{"issue":"6","key":"1027_CR13","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/j.amc.2009.07.051","volume":"215","author":"C Alonso Sanchez","year":"2009","unstructured":"Alonso Sanchez, C., & Soma, N.Y. (2009). A Polynomial-time DNA Computing Solution for the Bin-Packing Problem. Applied Mathematics and Computation, 215(6), 2055\u20132062.","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"1027_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.biosystems.2008.09.007","volume":"95","author":"M Darehmiraki","year":"2009","unstructured":"Darehmiraki, M. (2009). A new solution for maximal clique problem based sticker model. Biosystems, 95(2), 145\u2013149.","journal-title":"Biosystems"},{"issue":"6","key":"1027_CR15","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.tcs.2009.07.031","volume":"411","author":"X Liu","year":"2010","unstructured":"Liu, X., Yang, X., Li, S., & Ding, Y. (2010). Solving the minimum bisection problem using a biologically inspired computational model. Theoretical Computer Science, 411(6), 888\u2013896.","journal-title":"Theoretical Computer Science"},{"issue":"17","key":"1027_CR16","doi-asserted-by":"crossref","first-page":"3581","DOI":"10.1016\/j.ins.2011.04.026","volume":"181","author":"M Razzazi","year":"2011","unstructured":"Razzazi, M., & Roayaei, M. (2011). Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems. Information Sciences, 181(17), 3581\u20133600.","journal-title":"Information Sciences"},{"key":"1027_CR17","unstructured":"Yuxing Y., Qingsheng L., & Jilan M. (2008). DNA Algorithms of Two Kinds of Full Permutation Problem Based on Sticker Model. In Computational Intelligence and Industrial Application PACIIA Pacific-Asia Workshop, (Vol. 1 pp. 252\u2013255)."},{"key":"1027_CR18","doi-asserted-by":"crossref","unstructured":"Arnold, M.C. (2011). An improved DNA-sticker addition algorithm and its application to logarithmic arithmetic. In DNA Computing and Molecular Programming, (Vol. 6937 pp. 34\u201348).","DOI":"10.1007\/978-3-642-23638-9_6"},{"key":"1027_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., & Trick, M.A. (Eds.) (1996). Cliques, Coloring, and Satisfiability . DIMACS Series in Discr. Math. and Theoret. Comput. Sci., Vol. 26.","DOI":"10.1090\/dimacs\/026"},{"issue":"2","key":"1027_CR20","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2013","unstructured":"Batsyn, M., Goldengorin, B., Maslov, E., & Pardalos, P.M. (2013). Improvements to MCS algorithm for the maximum clique problem. Journal of Combinatorial Optimization, 27(2), 397\u2013416.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1027_CR21","doi-asserted-by":"crossref","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., & Wakatsuki, M. (2010). A simple and faster branch-and-bound algorithm for finding a maximum clique. In M. Rahman, & S. Fujita (Eds.), WALCOM: Algorithms and Computation. Lecture Notes in Computer Science, (Vol. 5942 pp. 191\u2013203).","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"1027_CR22","doi-asserted-by":"crossref","unstructured":"Karp, R. (1972). Reducibility among combinatorial problems. In R. Miller, & J. Thatcher (Eds.) Complexity of Computer Computations (pp. 85\u2013103): Plenum Press.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1027_CR23","unstructured":"Hastad, J. (1996). Clique is hard to approximate within n 1\u2212\ud835\udf16 .. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science.IEEE (pp. 627\u2013636)."},{"key":"1027_CR24","doi-asserted-by":"crossref","unstructured":"Johnson, D.J., & Trick, M.A. (eds.) (1996). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. Workshop.","DOI":"10.1090\/dimacs\/026"},{"key":"1027_CR25","doi-asserted-by":"crossref","unstructured":"Rodionov, A., Bezginov, A., Rose, J., & Tillier, ERM (2011). A new, fast algorithm for detecting protein coevolution using maximum compatible cliques. Algorithms for Molecular Biology, 6(17).","DOI":"10.1186\/1748-7188-6-17"},{"key":"1027_CR26","doi-asserted-by":"crossref","unstructured":"Ion, A., Carreira, J., & Sminchisescu, C. (2011). Image segmentation by figure-ground composition into maximal cliques. In The 13th International Conference on Computer Vision, 6-13 November, Barcelona, Spain.","DOI":"10.1109\/ICCV.2011.6126486"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-015-1027-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-015-1027-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-015-1027-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:16:35Z","timestamp":1567124195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-015-1027-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,30]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["1027"],"URL":"https:\/\/doi.org\/10.1007\/s11265-015-1027-z","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,30]]}}}