Combinatorial Pattern Matching
From MaRDI portal
Publication:5315326
DOI10.1007/B98377zbMath1103.68134MaRDI QIDQ5315326
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items (5)
LCS\(k\): a refined similarity measure ⋮ Efficient algorithms for finding interleaving relationship between sequences ⋮ Efficient merged longest common subsequence algorithms for similar sequences ⋮ Semi-local longest common subsequences in subquadratic time ⋮ A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
This page was built for publication: Combinatorial Pattern Matching
