Algorithms for Computing Variants of the Longest Common Subsequence Problem

DOI10.1007/11940128_41MaRDI QIDQ5459135zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms for computing variants of the longest common subsequence problem
• On the generalized constrained longest common subsequence problems
• Publication:4862293
• A new efficient algorithm for computing the longest common subsequence
• An almost-linear time and linear space algorithm for the longest common subsequence problem

Cited in

(22)

• A new efficient algorithm for computing the longest common subsequence
• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• New efficient algorithms for the LCS and constrained LCS problems
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• Analysis of evolutionary algorithms for the longest common subsequence problem
• Doubly-constrained LCS and hybrid-constrained LCS problems revisited
• Extension of van der Corput algorithm to LS-sequences
• Solving longest common subsequence problems via a transformation to the maximum clique problem
• Variants of constrained longest common subsequence
• Finding the gapped longest common subsequence by incremental suffix maximum queries
• scientific article; zbMATH DE number 1617276 (Why is no real title available?)
• Hardness of longest common subsequence for sequences with bounded run-lengths
• Performance analysis of some simple heuristics for computing longest common subsequences
• Algorithms for computing variants of the longest common subsequence problem
• Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
• On the Set LCS and Set-Set LCS Problems
• Algorithms for Computing the Longest Parameterized Common Subsequence
• Generalized sequence alignment and duality
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Exemplar Longest Common Subsequence
• Constrained sequence analysis algorithms in computational biology

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

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