Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings
From MaRDI portal
Publication:2971148
DOI10.1007/978-3-319-51963-0_28zbMath1444.68311arXiv1609.03668OpenAlexW2520870971MaRDI QIDQ2971148
Shunsuke Inenaga, Yoshiaki Matsuoka, Kazuyuki Narisawa, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara, Hideo Bannai, Masatoshi Kurihara, Diptarama
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.03668
Related Items (1)
Cites Work
- Unnamed Item
- LCS\(k\): a refined similarity measure
- Order-preserving indexing
- A linear time algorithm for consecutive permutation pattern matching
- A fast algorithm for order-preserving pattern matching
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- Order-preserving matching
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Longest Common Separable Pattern Among Permutations
- Algorithms on Strings, Trees and Sequences
- Inducing the LCP-Array
- Dynamic LCA Queries on Trees
This page was built for publication: Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings