Author:
Kari Lila,Mahalingam Kalpana
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Adleman, L.: Towards a mathematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California (2000)
2. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Orlando Florida (1985)
3. Blanchet-Sadri, F., Luhman, D.: Conjugacy on partial words. Theoretical Computer Science 289, 297–312 (2002)
4. Boyer, R., Moore, J.: A fast string searching algorithm. Communication of the ACM 20, 762–772 (1977)
5. Crochemore, M., Perrin, D.: Two-way string matching. Journal of Association of Computing Machinery 38, 651–675 (1991)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing Maximal Palindromes in Non-standard Matching Models;Lecture Notes in Computer Science;2024
2. HV-Palindromes in Two-Dimensional Words;International Journal of Foundations of Computer Science;2022-02-26
3. Watson-Crick Powers of a Word;Algebraic Informatics;2022
4. Watson-Crick Conjugates of Words and Languages;SSRN Electronic Journal;2022
5. Theta Palindromes in Theta Conjugates;Theory and Practice of Natural Computing;2020