Subsequence matching and LCS with segment number constraints

DOI10.1007/978-3-031-92935-9_9MaRDI QIDQ6902117zbMATH OpenFDO

Authors Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_9

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A longest common subsequence algorithm suitable for similar text strings
• Algorithms on Strings
• Algorithms on Strings, Trees and Sequences
• Edit distance with block deletions
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast Pattern Matching in Strings
• Longest \((k]\)-tuple common substrings
• Subsequences with generalised gap constraints: upper and lower complexity bounds
• The fine-grained complexity of episode matching
• The String-to-String Correction Problem
• Time-space-optimal string matching
• Two-way string-matching

Cited in

(3)

• Fast algorithms for window accumulated subsequence matching problem
• Longest double-bounded \((k]\)-tuple common substrings
• Longest \((k]\)-tuple common substrings with interval length constraints

This page was built for publication: Subsequence matching and LCS with segment number constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902117)