Author:
Barker Laura,Fleischmann Pamela,Harwardt Katharina,Manea Florin,Nowotka Dirk
Publisher
Springer International Publishing
Reference37 articles.
1. Bringman, K., Künnemann, M.: Multivariate fine-grained complexity of longest common subsequence. In: Proceedings of the SODA 2018, pp. 1216–1235. SIAM (2018)
2. Chen, H.Z.Q., Kitaev, S., Mütze, T., Sun, B.Y.: On universal partial words. Electron. Notes Discrete Math. 61, 231–237 (2017)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
4. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)
5. Lecture Notes in Computer Science;JD Day,2019
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Simon's congruence pattern matching;Theoretical Computer Science;2024-05
2. On the Piecewise Complexity of Words and Periodic Words;Lecture Notes in Computer Science;2024
3. Existential Definability over the Subword Ordering;Logical Methods in Computer Science;2023-12-21
4. Absent Subsequences in Words;Fundamenta Informaticae;2023-10-26
5. On Simon's congruence closure of a string;Theoretical Computer Science;2023-09