Semi-local string comparison: algorithmic techniques and applications
From MaRDI portal
Publication:942990
DOI10.1007/s11786-007-0033-3zbMath1158.68054OpenAlexW3101942351MaRDI QIDQ942990
Publication date: 8 September 2008
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-007-0033-3
Related Items (19)
Faster subsequence recognition in compressed strings ⋮ Longest common rollercoasters ⋮ A faster reduction of the dynamic time warping distance to the longest increasing subsequence length ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Finding top-\(k\) longest palindromes in substrings ⋮ A fast algorithm for multiplying min-sum permutations ⋮ Monge properties of sequence alignment ⋮ Longest bordered and periodic subsequences ⋮ An almost quadratic time algorithm for sparse spliced alignment ⋮ Unnamed Item ⋮ Efficient all path score computations on grid graphs ⋮ Unnamed Item ⋮ Dynamic edit distance table under a general weighted cost function ⋮ Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition ⋮ On almost Monge all scores matrices ⋮ An algorithm for solving the longest increasing circular subsequence problem ⋮ Unnamed Item ⋮ Periodic String Comparison ⋮ Fast distance multiplication of unit-Monge matrices
This page was built for publication: Semi-local string comparison: algorithmic techniques and applications