{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:00Z","timestamp":1725558780856},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139611"},{"type":"electronic","value":"9783642139628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_33","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"296-306","source":"Crossref","is-referenced-by-count":3,"title":["Hairpin Lengthening"],"prefix":"10.1007","author":[{"given":"Florin","family":"Manea","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s00224-004-1175-1","volume":"39","author":"P. Bottoni","year":"2006","unstructured":"Bottoni, P., Labella, A., Manca, V., Mitrana, V.: Superposition based on Watson-Crick-like complementarity. Theory of Computing Systems\u00a039(4), 503\u2013524 (2006)","journal-title":"Theory of Computing Systems"},{"key":"33_CR2","unstructured":"Cheptea, D., Martin-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: hairpin completion. In: Proc. Transgressive Computing, pp. 216\u2013228 (2006)"},{"key":"33_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.R.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Deaton, R., Murphy, R., Garzon, M., Franceschetti, D.R., Stevens, S.E.: Good encodings for DNA-based solutions to combinatorial problems. In: Proc. of DNA-based computers II. DIMACS Series, vol.\u00a044, pp. 247\u2013258 (1998)","DOI":"10.1090\/dimacs\/044\/20"},{"key":"33_CR5","unstructured":"Garzon, M., Deaton, R., Nino, L.F., Stevens Jr., S.E., Wittner, M.: Genome encoding for DNA computing. In: Proc. Third Genetic Programming Conference, Madison, MI, pp. 684\u2013690 (1998)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06, 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/11505877_26","volume-title":"Developments in Language Theory","author":"L. Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sosik, P., Thierrin, G.: On hairpin-free words and languages. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 296\u2013307. Springer, Heidelberg (2005)"},{"issue":"9","key":"33_CR8","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1016\/j.dam.2007.09.022","volume":"157","author":"F. Manea","year":"2009","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: On some algorithmic problems regarding the hairpin completion. Discr. App. Math.\u00a0157(9), 2143\u20132152 (2009)","journal-title":"Discr. App. Math."},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-540-73001-9_55","volume-title":"Computation and Logic in the Real World","author":"F. Manea","year":"2007","unstructured":"Manea, F., Mitrana, V.: Hairpin completion versus hairpin reduction. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, pp. 532\u2013541. Springer, Heidelberg (2007)"},{"issue":"4-5","key":"33_CR10","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.tcs.2008.09.049","volume":"410","author":"F. Manea","year":"2009","unstructured":"Manea, F., Mitrana, V., Yokomori, T.: Two complementary operations inspired by the DNA hairpin formation: completion and reduction. Theor. Comput. Sci.\u00a0410(4-5), 417\u2013425 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR11","unstructured":"Manea, F.: A series of algorithmic results related to the iterated hairpin completion (submitted)"},{"key":"33_CR12","doi-asserted-by":"publisher","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., Hagiya, M.: Molecular computation by DNA hairpin formation. Science\u00a0288, 1223\u20131226 (2000)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:52Z","timestamp":1619785012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}