{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:25Z","timestamp":1725466645734},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_38","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"428-439","source":"Crossref","is-referenced-by-count":1,"title":["Hairpin Completion with Bounded Stem-Loop"],"prefix":"10.1007","author":[{"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kayoko","family":"Shikishima-Tsuji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Cheptea, D., Mart\u00edn-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: Hairpin completion. Trans. Comput., 216\u2013228 (2006)"},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","volume":"183","author":"A. Luca de","year":"1997","unstructured":"de Luca, A.: Sturmian words: Structure, combinatorics, and their arithmetics. Theor. Comput. Sci.\u00a0183(1), 45\u201382 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"38_CR3","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"A. Luca de","year":"2006","unstructured":"de Luca, A., De Luca, A.: Pseudopalindrome closure operators in free monoids. Theor. Comput. Sci.\u00a0362(1-3), 282\u2013300 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-03466-4_11","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"V. Diekert","year":"2009","unstructured":"Diekert, V., Kopecki, S., Mitrana, V.: On the Hairpin Completion of Regular Languages. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 170\u2013184. Springer, Heidelberg (2009)"},{"key":"38_CR5","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"38_CR6","first-page":"441","volume":"23","author":"S. Horv\u00e1th","year":"1987","unstructured":"Horv\u00e1th, S., Karhum\u00e4ki, J., Kleijn, J.: Results concerning palindromicity. J. Inf. Process. Cybern.\u00a023, 441\u2013451 (1987)","journal-title":"J. Inf. Process. Cybern."},{"issue":"3","key":"38_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ic.2010.11.014","volume":"209","author":"M. Ito","year":"2011","unstructured":"Ito, M., Leupold, P., Manea, F., Mitrana, V.: Bounded hairpin completion. Inf. Comput.\u00a0209(3), 471\u2013485 (2011)","journal-title":"Inf. Comput."},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-27660-6_28","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"L. Kari","year":"2012","unstructured":"Kari, L., Kopecki, S., Seki, S.: Iterated Hairpin Completions of Non-crossing Words. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 337\u2013348. Springer, Heidelberg (2012)"},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11047-009-9131-2","volume":"9","author":"L. Kari","year":"2010","unstructured":"Kari, L., Mahalingam, K.: Watson\u2013Crick palindromes in DNA computing. Nat. Comput.\u00a09(2), 297\u2013316 (2010)","journal-title":"Nat. Comput."},{"issue":"29","key":"38_CR10","doi-asserted-by":"publisher","first-page":"3629","DOI":"10.1016\/j.tcs.2011.03.009","volume":"412","author":"S. Kopecki","year":"2011","unstructured":"Kopecki, S.: On iterated hairpin completion. Theor. Comput. Sci.\u00a0412(29), 3629\u20133638 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press (1962\/1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Mahalingam, K., Subramanian, K.G.: Palindromic completion of a word. In: BIC-TA, pp. 1459\u20131465. IEEE (2010)","DOI":"10.1109\/BICTA.2010.5645281"},{"issue":"3","key":"38_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G. Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. Journal of the ACM\u00a022(3), 346\u2013351 (1975)","journal-title":"Journal of the ACM"},{"issue":"9","key":"38_CR14","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. Discrete Appl. Math.\u00a0157(9), 2143\u20132152 (2009)","journal-title":"Discrete Appl. Math."},{"key":"38_CR15","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":"5","key":"38_CR16","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1142\/S0129054110007593","volume":"21","author":"F. Manea","year":"2010","unstructured":"Manea, F., Mitrana, V., Yokomori, T.: Some remarks on the hairpin completion. Int. J. Found. Comput. Sci.\u00a021(5), 859\u2013872 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Paun, G., Rozenberg, G., Yokomori, T.: Hairpin languages. Int. J. Found. Comput. Sci., 837\u2013847 (2001)","DOI":"10.1142\/S0129054101000904"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:40Z","timestamp":1620128500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}