{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:03:14Z","timestamp":1764133394245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030629991"},{"type":"electronic","value":"9783030630003"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-63000-3_12","type":"book-chapter","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:03:23Z","timestamp":1606694603000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Theta Palindromes in Theta Conjugates"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2418-0512","authenticated-orcid":false,"given":"Kalpana","family":"Mahalingam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5267-7820","authenticated-orcid":false,"given":"Palak","family":"Pandoh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9215-1388","authenticated-orcid":false,"given":"Anuran","family":"Maity","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,30]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jagm.2000.1120","volume":"37","author":"A Amir","year":"2000","unstructured":"Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247\u2013266 (2000)","journal-title":"J. Algorithms"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(01)00278-X","volume":"289","author":"F Blanchet-Sadri","year":"2002","unstructured":"Blanchet-Sadri, F., Luhmann, D.: Conjugacy on partial words. Theoret. Comput. Sci. 289(1), 297\u2013312 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.tcs.2009.09.037","volume":"411","author":"E Czeizler","year":"2010","unstructured":"Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoret. Comput. Sci. 411(3), 617\u2013630 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11753681_3","volume-title":"DNA Computing","author":"M Daley","year":"2006","unstructured":"Daley, M., McQuillan, I.: On computational properties of template-guided DNA recombination. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 27\u201337. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11753681_3"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/s00224-007-9086-6","volume":"44","author":"M Domaratzki","year":"2007","unstructured":"Domaratzki, M.: Hairpin structures defined by DNA trajectories. Theory Comput. Syst. 44, 432\u2013454 (2007)","journal-title":"Theory Comput. Syst."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11925903_11","volume-title":"DNA Computing","author":"MH Garzon","year":"2006","unstructured":"Garzon, M.H., Phan, V., Roy, S., Neel, A.J.: In search of optimal codes for DNA computing. In: Mao, C., Yokomori, T. (eds.) DNA 2006. LNCS, vol. 4287, pp. 143\u2013156. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11925903_11"},{"key":"12_CR7","unstructured":"Guo, C., Shallit, J., Shur, A.M.: On the combinatorics of palindromes and antipalindromes. arXiv e-prints arXiv:1503.09112, March 2015"},{"key":"12_CR8","volume-title":"Formal Languages and Their Relation to Automata","author":"JE Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal Languages and Their Relation to Automata. Addison-Wesley Longman Inc., Boston (1969)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-77962-9_29","volume-title":"DNA Computing","author":"L Kari","year":"2008","unstructured":"Kari, L., Mahalingam, K.: Watson-Crick conjugate and commutative words. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 273\u2013283. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77962-9_29"},{"issue":"2","key":"12_CR10","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-Crick palindromes in DNA computing. Nat. Comput. 9(2), 297\u2013316 (2010)","journal-title":"Nat. Comput."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/978-3-540-77120-3_75","volume-title":"Algorithms and Computation","author":"O Lipsky","year":"2007","unstructured":"Lipsky, O., Porat, B., Porat, E., Shalom, B.R., Tzur, A.: Approximate string matching with swap and mismatch. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 869\u2013880. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77120-3_75"},{"issue":"9","key":"12_CR12","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1016\/j.ic.2010.04.001","volume":"208","author":"O Lipsky","year":"2010","unstructured":"Lipsky, O., Porat, B., Porat, E., Riva Shalom, B., Tzur, A.: String matching with up to $$k$$ swaps and mismatches. Inf. Comput. 208(9), 1020\u20131030 (2010)","journal-title":"Inf. Comput."},{"key":"12_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"A de Luca","year":"2006","unstructured":"de Luca, A., Luca, A.D.: Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362(1), 282\u2013300 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"RC Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation $$a^{M}=b^{N}c^{P}$$ in a free group. Michigan Math. J. 9, 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Marathe, A., Condon, A., Corn, R.M.: On combinatorial DNA word design. In: DNA Based Computers (1999)","DOI":"10.1090\/dimacs\/054\/07"},{"key":"12_CR17","volume-title":"Free Monoids and Languages","author":"H Shyr","year":"2001","unstructured":"Shyr, H.: Free Monoids and Languages. Hon Min Book Company, Taichung (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63000-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:05:30Z","timestamp":1606694730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63000-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030629991","9783030630003"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63000-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taoyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/tpnc2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"An invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}