scientific article; zbMATH DE number 2119727
From MaRDI portal
Publication:4829001
zbMath1064.92017MaRDI QIDQ4829001
Gad M. Landau, Michal Ziv-Ukelson, Maxime Crochemore
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items (9)
Speeding up HMM decoding and training by exploiting sequence repetitions ⋮ Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism ⋮ Algorithms for computing variants of the longest common subsequence problem ⋮ New efficient algorithms for the LCS and constrained LCS problems ⋮ Pattern matching in pseudo real-time ⋮ A new efficient algorithm for computing the longest common subsequence ⋮ Sparse LCS common substring alignment ⋮ An improved algorithm for generalized comparison of minisatellites ⋮ Edit distance of run-length encoded strings.
This page was built for publication:
