Sparse LCS Common Substring Alignment

DOI10.1007/3-540-44888-8_17MaRDI QIDQ3550838zbMATH OpenOpenAlexFDO

Authors Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Sparse LCS common substring alignment
• On the common substring alignment problem
• scientific article; zbMATH DE number 1445380
• scientific article; zbMATH DE number 1305083
• Sparse Dynamic Programming for Longest Common Subsequence from Fragments
• Sublinear space algorithms for the longest common substring problem
• A linear-space algorithm for the substring constrained alignment problem
• Longest common subsequence in sublinear space
• Optimal alignments of longest common subsequences and their path properties
• Alignments and approximate string matching

Cited in

(11)

• Sparse LCS common substring alignment
• A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
• An all-substrings common subsequence algorithm
• Two algorithms for LCS consecutive suffix alignment
• On the common substring alignment problem
• LCSk: a refined similarity measure
• scientific article; zbMATH DE number 5777888 (Why is no real title available?)
• scientific article; zbMATH DE number 1445380 (Why is no real title available?)
• Combinatorial Pattern Matching
• Sparse normalized local alignment
• Non-overlapping common substrings allowing mutations

This page was built for publication: Sparse LCS Common Substring Alignment

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