A New Efficient Algorithm for Computing the Longest Common Subsequence

DOI10.1007/978-3-540-72870-2_8zbMath1137.68622OpenAlexW1602012035MaRDI QIDQ5434425

Costas S. Iliopoulos, M. Sohel Rahman

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72870-2_8

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items

Fast computation of a longest increasing subsequence and application ⋮ On the generalized constrained longest common subsequence problems ⋮ 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: A New Efficient Algorithm for Computing the Longest Common Subsequence