Sparse Dynamic Programming for Longest Common Subsequence from Fragments

DOI10.1006/JAGM.2002.1214MaRDI QIDQ4538080zbMATH OpenOpenAlexFDO

Authors Brenda S. Baker, R. Giancarlo

Publication date 11 July 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2002.1214

zbMATH Keywords

sparse dynamic programming

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1305083
• The longest common subsequence problem revisited
• New algorithms for the LCS problem
• Fast linear-space computations of longest common subsequences
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems

Cited in

(10)

• Sparse LCS Common Substring Alignment
• Periodicity and Repetitions in Parameterized Strings
• On the reconstruction of optimal solutions in methods of dynamic programming for the sequence analysis
• Sparse LCS common substring alignment
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
• scientific article; zbMATH DE number 432798 (Why is no real title available?)
• Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
• Efficient algorithms for finding interleaving relationship between sequences
• Periodicity and repetitions in parameterized strings

This page was built for publication: Sparse Dynamic Programming for Longest Common Subsequence from Fragments

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