Abstract
A DNA string is a Watson-Crick (WK) palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping \(\theta \) is an involution that is also an antimorphism. \(\theta \)-conjugates of a word is a generalization of conjugates of a word that incorporates the notion of WK-involution \(\theta \). In this paper, we study the distribution of palindromes and Watson-Crick palindromes, also known as \(\theta \)-palindromes among both the set of conjugates and \(\theta \)-conjugates of a word w. We also consider some general properties of the set \(C_{\theta }(w)\), i.e., the set of \(\theta \)-conjugates of a word w, and characterize words w such that \(|C_{\theta }(w)|=|w|+1\), i.e., with the maximum number of elements in \(C_{\theta }(w)\). We also find the structure of words that have at least one (WK)-palindrome in \(C_{\theta }(w)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247–266 (2000)
Blanchet-Sadri, F., Luhmann, D.: Conjugacy on partial words. Theoret. Comput. Sci. 289(1), 297–312 (2002)
Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theoret. Comput. Sci. 411(3), 617–630 (2010)
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–37. Springer, Heidelberg (2006). https://doi.org/10.1007/11753681_3
Domaratzki, M.: Hairpin structures defined by DNA trajectories. Theory Comput. Syst. 44, 432–454 (2007)
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–156. Springer, Heidelberg (2006). https://doi.org/10.1007/11925903_11
Guo, C., Shallit, J., Shur, A.M.: On the combinatorics of palindromes and antipalindromes. arXiv e-prints arXiv:1503.09112, March 2015
Hopcroft, J.E., Ullman, J.D.: Formal Languages and Their Relation to Automata. Addison-Wesley Longman Inc., Boston (1969)
Kari, L., Mahalingam, K.: Watson-Crick conjugate and commutative words. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 273–283. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77962-9_29
Kari, L., Mahalingam, K.: Watson-Crick palindromes in DNA computing. Nat. Comput. 9(2), 297–316 (2010)
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–880. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77120-3_75
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–1030 (2010)
Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)
de Luca, A., Luca, A.D.: Pseudopalindrome closure operators in free monoids. Theoret. Comput. Sci. 362(1), 282–300 (2006)
Lyndon, R.C., Schützenberger, M.P.: The equation \(a^{M}=b^{N}c^{P}\) in a free group. Michigan Math. J. 9, 289–298 (1962)
Marathe, A., Condon, A., Corn, R.M.: On combinatorial DNA word design. In: DNA Based Computers (1999)
Shyr, H.: Free Monoids and Languages. Hon Min Book Company, Taichung (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Mahalingam, K., Pandoh, P., Maity, A. (2020). Theta Palindromes in Theta Conjugates. In: MartÃn-Vide, C., Vega-RodrÃguez, M.A., Yang, MS. (eds) Theory and Practice of Natural Computing. TPNC 2020. Lecture Notes in Computer Science(), vol 12494. Springer, Cham. https://doi.org/10.1007/978-3-030-63000-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-63000-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62999-1
Online ISBN: 978-3-030-63000-3
eBook Packages: Computer ScienceComputer Science (R0)