Ho, Cheng-Han; Yang, Chang-Biau The longest almost increasing subsequence problem with sliding windows. (English) Zbl 07872196 Theor. Comput. Sci. 1005, Article ID 114639, 9 p. (2024). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Bannai, Hideo; I., Tomohiro; Kociumaka, Tomasz; Köppl, Dominik; Puglisi, Simon J. Computing longest Lyndon subsequences and longest common Lyndon subsequences. (English) Zbl 07823156 Algorithmica 86, No. 3, 735-756 (2024). MSC: 68Wxx 05Cxx × Cite Format Result Cite Review PDF Full Text: DOI OA License
Bannai, Hideo; I, Tomohiro; Kociumaka, Tomasz; Köppl, Dominik; Puglisi, Simon J. Computing longest (common) Lyndon subsequences. (English) Zbl 07577695 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 128-142 (2022). MSC: 68Rxx 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bhuiyan, Mohammad Tawhidul Hasan; Alam, Muhammad Rashed; Rahman, M. Sohel Computing the longest common almost-increasing subsequence. (English) Zbl 1537.68220 Theor. Comput. Sci. 930, 157-178 (2022). MSC: 68W32 × Cite Format Result Cite Review PDF Full Text: DOI