{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:55:06Z","timestamp":1725692106979},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_10","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:17:08Z","timestamp":1342649828000},"page":"145-159","source":"Crossref","is-referenced-by-count":5,"title":["Hairpin Lengthening and Shortening of Regular Languages"],"prefix":"10.1007","author":[{"given":"Florin","family":"Manea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Mercas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"10_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":"10_CR2","doi-asserted-by":"crossref","unstructured":"Castellanos, J., Mitrana, V.: Some remarks on hairpin and loop languages. In: Words, Semigroups, and Transductions 2001, pp. 47\u201358 (2001)","DOI":"10.1142\/9789812810908_0004"},{"key":"10_CR3","unstructured":"Cheptea, D., Mart\u00edn-Vide, C., Mitrana, V.: A new operation on words suggested by dna biochemistry: Hairpin completion. Transgressive Computing, 216\u2013228 (2006)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Deaton, R., Murphy, R., Garzon, M., Franceschetti, D., Stevens Jr., S.: Good encodings for DNA-based solutions to combinatorial problems. In: Proceedings of the Second Annual Meeting on DNA Based Computer. DIMACS, vol.\u00a044, pp. 247\u2013259 (1996)","DOI":"10.1090\/dimacs\/044\/20"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-18098-9_12","volume-title":"Implementation and Application of Automata","author":"V. Diekert","year":"2011","unstructured":"Diekert, V., Kopecki, S.: Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 105\u2013114. Springer, Heidelberg (2011)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2011.12.025","volume":"429","author":"V. Diekert","year":"2012","unstructured":"Diekert, V., Kopecki, S.: Language theoretical properties of hairpin formations. Theoretical Computer Science\u00a0429, 65\u201373 (2012)","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","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":"10_CR8","first-page":"684","volume-title":"Genetic Programming 1998: Proceedings of the Third Annual Conference","author":"M. Garzon","year":"1998","unstructured":"Garzon, M., Deaton, R., Nino, L., Stevens, E., Wittner, M.: Encoding genomes for DNA computing. In: Koza, J., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D., Garzon, M., Goldberg, D., Iba, H., Riolo, R. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 684\u2013690. Morgan Kaufmann, Madison (1998)"},{"issue":"3","key":"10_CR9","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. Information and Computation\u00a0209(3), 471\u2013485 (2011)","journal-title":"Information and Computation"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11505877_26","volume-title":"Developments in Language Theory","author":"L. Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, 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":"4","key":"10_CR11","first-page":"453","volume":"71","author":"L. Kari","year":"2006","unstructured":"Kari, L., Losseva, E., Konstantinidis, S., Sos\u00edk, P., Thierrin, G.: A formal language analysis of DNA hairpin structures. Fundam. Inform.\u00a071(4), 453\u2013475 (2006)","journal-title":"Fundam. Inform."},{"issue":"29","key":"10_CR12","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. Theoretical Computer Science\u00a0412(29), 3629\u20133638 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"48","key":"10_CR13","doi-asserted-by":"publisher","first-page":"4162","DOI":"10.1016\/j.tcs.2010.06.014","volume":"411","author":"F. Manea","year":"2010","unstructured":"Manea, F.: A series of algorithmic results related to the iterated hairpin completion. Theoretical Computer Science\u00a0411(48), 4162\u20134178 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"10_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 Applied Mathematics\u00a0157(9), 2143\u20132152 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-13962-8_33","volume-title":"Programs, Proofs, Processes","author":"F. Manea","year":"2010","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: Hairpin Lengthening. In: Ferreira, F., L\u00f6we, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol.\u00a06158, pp. 296\u2013306. Springer, Heidelberg (2010)"},{"key":"10_CR16","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":"10_CR17","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. Theoretical Computer Science\u00a0410(4-5), 417\u2013425 (2009)","journal-title":"Theoretical Computer Science"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: Hairpin lengthening: Language theoretic and algorithmic results. Journal of Logic and Compuation (to appear, 2012)","DOI":"10.1093\/logcom\/exs076"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1142\/S0129054101000904","volume":"12","author":"G. P\u0103un","year":"2001","unstructured":"P\u0103un, G., Rozenberg, G., Yokomori, T.: Hairpin languages. International Journal of Foundations of Computer Science\u00a012, 837\u2013847 (2001)","journal-title":"International Journal of Foundations of Computer Science"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"10_CR20","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)"},{"issue":"5469","key":"10_CR21","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(5469), 1223\u20131226 (2000)","journal-title":"Science"},{"issue":"22","key":"10_CR22","doi-asserted-by":"publisher","first-page":"6531","DOI":"10.1093\/nar\/18.22.6531","volume":"18","author":"J.G.K. Williams","year":"1990","unstructured":"Williams, J.G.K., Kubelik, A.R., Livak, K.J., Rafalski, J.A., Tingey, S.V.: DNA polymorphisms amplified by arbitrary primers are useful as genetic markers. Nucleic Acids Research\u00a018(22), 6531\u20136535 (1990)","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:17:30Z","timestamp":1556925450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}