Longest common subsequence from fragments via sparse dynamic programming

DOI10.1007/3-540-68530-8_7MaRDI QIDQ4252024zbMATH OpenFDO

Authors Brenda S. Baker, R. Giancarlo

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68530-8_7

zbMATH Keywords

sparse dynamic programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Recommendations

• Sparse Dynamic Programming for Longest Common Subsequence from Fragments
• The longest common subsequence problem revisited
• An almost-linear time and linear space algorithm for the longest common subsequence problem
• scientific article; zbMATH DE number 432798

Cited in

(8)

• Sparse LCS common substring alignment
• Sparse long blocks and the micro-structure of the longuest common subsequences
• An efficient algorithm for the longest common palindromic subsequence problem
• On the reconstruction of optimal solutions in methods of dynamic programming for the sequence analysis
• Sparse LCS Common Substring Alignment
• LCS Approximation via Embedding into Local Non-repetitive Strings
• Sparse Dynamic Programming for Longest Common Subsequence from Fragments
• LCS approximation via embedding into locally non-repetitive strings

This page was built for publication: Longest common subsequence from fragments via sparse dynamic programming

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