Sparse LCS Common Substring Alignment
From MaRDI portal
Publication:3550838
DOI10.1007/3-540-44888-8_17zbMath1279.68369OpenAlexW1600947984MaRDI QIDQ3550838
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
Related Items
LCS\(k\): a refined similarity measure ⋮ Two algorithms for LCS consecutive suffix alignment ⋮ A space efficient algorithm for the longest common subsequence in \(k\)-length substrings