Algorithms for Computing Variants of the Longest Common Subsequence Problem

DOI10.1007/11940128_41zbMath1135.68635OpenAlexW1823536187MaRDI QIDQ5459135

M. Sohel Rahman, Costas S. Iliopoulos

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_41

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

New efficient algorithms for the LCS and constrained LCS problems ⋮ A new efficient algorithm for computing the longest common subsequence

This page was built for publication: Algorithms for Computing Variants of the Longest Common Subsequence Problem