{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:13:54Z","timestamp":1784528034406,"version":"3.55.0"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1093\/logcom\/exs076","type":"journal-article","created":{"date-parts":[[2013,1,5]],"date-time":"2013-01-05T01:38:05Z","timestamp":1357349885000},"page":"987-1009","source":"Crossref","is-referenced-by-count":6,"title":["Hairpin lengthening: language theoretic and algorithmic results"],"prefix":"10.1093","volume":"25","author":[{"given":"Florin","family":"Manea","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2013,1,3]]},"reference":[{"key":"2015072400400129000_25.4.987.1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1175-1"},{"key":"2015072400400129000_25.4.987.2","doi-asserted-by":"crossref","unstructured":"Castellanos J. Mitrana V. Some remarks on hairpin and loop languages. In: Ito M. Paun G. Yu S. , editors. Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin. World Scientific; 2001. p. 47-59.","DOI":"10.1142\/9789812810908_0004"},{"key":"2015072400400129000_25.4.987.3","unstructured":"Cheptea D. Martin-Vide C. Mitrana V. A new operation on words suggested by DNA biochemistry: hairpin completion. In: Dumas J. -G. , editor. Proceedings of Transgressive Computing 2006: a Conference in Honor of Jean Della Dora. University of Granada, Spain; 2006. p. 216-228."},{"key":"2015072400400129000_25.4.987.4","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. R . Introduction to Algorithms. MIT Press; 1990."},{"key":"2015072400400129000_25.4.987.5","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: Landweber L. Baum E. , editors. DNA Based Computers II. The American Mathematical Society; 1998. p. 247-258. DIMACS Series, vol. 44.","DOI":"10.1090\/dimacs\/044\/20"},{"key":"2015072400400129000_25.4.987.6","doi-asserted-by":"crossref","unstructured":"Diekert V. Kopecki S. Complexity results and the growths of hairpin completions of regular languages (Extended Abstract). In: Domaratzki M. Salomaa K. , editors. Implementation and Application of Automata - 15th International Conference, CIAA 2010. Berlin Heidelberg: Springer; 2010. p. 105-114. LNCS 6482.","DOI":"10.1007\/978-3-642-18098-9_12"},{"key":"2015072400400129000_25.4.987.7","doi-asserted-by":"crossref","unstructured":"Diekert V. Kopecki S. Mitrana V. On the hairpin completion of regular languages. In: Leucker M. Morgan C. , editors. Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium. Berlin Heidelberg: Springer; 2009. p. 170-184. LNCS 5684.","DOI":"10.1007\/978-3-642-03466-4_11"},{"key":"2015072400400129000_25.4.987.8","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9086-6"},{"key":"2015072400400129000_25.4.987.9","unstructured":"Garzon M. Deaton R. Nino L. F. Stevens S. E. Jr. Wittner M. Genome encoding for DNA computing. In: Koza J. R. Banzhaf W. Chellapilla K. Deb K. Dorigo M. Fogel D. B. Garzon M. H. Goldberg D. E. Iba H. Riolo R. L. , editors. Genetic Programming 1998: Proceedings of the Third Annual Conference. 1998. p. 684-690."},{"key":"2015072400400129000_25.4.987.10","doi-asserted-by":"crossref","unstructured":"Kari L. Konstantinidis S. Sosik P. Thierrin G. On hairpin-free words and languages. In: de Felice C. Restivo A. , editors. Developments in Language Theory, 9th International Conference, DLT 2005. Berlin Heidelberg: Springer; 2005. p. 296-307. LNCS 3572.","DOI":"10.1007\/11505877_26"},{"key":"2015072400400129000_25.4.987.11","doi-asserted-by":"crossref","unstructured":"Kari L. Losseva E. Konstantinidis S. Sosik P. Thierrin G. A formal language analysis of DNA hairpin structures. Fundam. Inform. 2006;71:453-475.","DOI":"10.1007\/11753681_12"},{"key":"2015072400400129000_25.4.987.12","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"2015072400400129000_25.4.987.13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.009"},{"key":"2015072400400129000_25.4.987.14","unstructured":"Knuth D. E. The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley; 1968."},{"key":"2015072400400129000_25.4.987.15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.022"},{"key":"2015072400400129000_25.4.987.16","doi-asserted-by":"crossref","unstructured":"Manea F. Mart\u00edn-Vide C. Mitrana V. Hairpin lengthening. In: Ferreira F. L\u00f6we B. Mayordomo E. Mendes Gomes L. , editors. Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010. Berlin Heidelberg: Springer; 2010. p. 296-306. LNCS 6158.","DOI":"10.1007\/978-3-642-13962-8_33"},{"key":"2015072400400129000_25.4.987.17","doi-asserted-by":"crossref","unstructured":"Manea F. Mitrana V. Hairpin completion versus hairpin reduction. In: Cooper S. B. L\u00f6we B. Sorbi A. , editors. Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007. Berlin Heidelberg: Springer; 2007. p. 532-541. LNCS 4497.","DOI":"10.1007\/978-3-540-73001-9_55"},{"key":"2015072400400129000_25.4.987.18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.049"},{"key":"2015072400400129000_25.4.987.19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.014"},{"key":"2015072400400129000_25.4.987.20","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054101000904"},{"key":"2015072400400129000_25.4.987.21","doi-asserted-by":"crossref","unstructured":"Rozenberg G. Salomaa A. , editors. Handbook of Formal Languages, 3 volumes. Springer; 1997.","DOI":"10.1007\/978-3-642-59126-6"},{"key":"2015072400400129000_25.4.987.22","doi-asserted-by":"publisher","DOI":"10.1126\/science.288.5469.1223"},{"key":"2015072400400129000_25.4.987.23","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)80007-X"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/25\/4\/987\/5146575\/exs076.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:08:13Z","timestamp":1562544493000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exs076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,3]]},"references-count":23,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,7,24]]},"published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.1093\/logcom\/exs076"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exs076","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,3]]}}}