Publisher
Springer Nature Singapore
Reference19 articles.
1. Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247–266 (2000). https://doi.org/10.1006/jagm.2000.1120
2. Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992). https://doi.org/10.1145/135239.135243
3. Boroujeni, M., Ehsani, S., Ghodsi, M., Hajiaghayi, M., Seddighin, S.: Approximating edit distance in truly subquadratic time: quantum and mapreduce. J. ACM 68(3) (2021). https://doi.org/10.1145/3456807
4. Lecture Notes in Computer Science;D Cantone,2023
5. Cantone, D., Faro, S., Pavone, A., Viola, C.: Longest common substring and longest palindromic substring in $$\tilde{O}(\sqrt{n})$$ time. CoRR, abs/2309.01250 (2023). arXiv:2309.01250
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Quantum Cyclic Rotation Gate;SN Computer Science;2024-08-27