Faster STR-EC-LCS Computation

DOI10.1007/978-3-030-38919-2_11zbMath1440.68345arXiv2001.05671OpenAlexW3004210690MaRDI QIDQ3297762

Kohei Yamada, Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Yuto Nakashima

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.05671

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (2)

Fast exact dynamic time warping on run-length encoded time series ⋮ Space-efficient STR-IC-LCS computation

Cites Work

• Quadratic-time algorithm for a string constrained LCS problem
• On the generalized constrained longest common subsequence problems
• An improved algorithm for computing the edit distance of run-length coded strings
• The constrained longest common subsequence problem
• A longest common subsequence algorithm suitable for similar text strings
• A simple algorithm for the constrained sequence problems
• A hardness result and new algorithm for the longest common palindromic subsequence problem
• A dynamic programming solution to a generalized LCS problem
• The String-to-String Correction Problem
• Faster STR-IC-LCS Computation via RLE

This page was built for publication: Faster STR-EC-LCS Computation