Publication:2970219
From MaRDI portal
zbMath1399.68317MaRDI QIDQ2970219
Sebastian Deorowicz, Joanna Obstój
Publication date: 29 March 2017
string matching; sequence alignment; longest common subsequence; sparse dynamic programming; constrained longest common subsequence
68W32: Algorithms on strings
Related Items
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion, Constrained sequence analysis algorithms in computational biology, A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint, A dynamic programming solution to a generalized LCS problem, An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints