Two algorithms for LCS consecutive suffix alignment
From MaRDI portal
Publication:2643733
DOI10.1016/j.jcss.2007.03.004zbMath1165.90668MaRDI QIDQ2643733
Gad M. Landau, Michal Ziv-Ukelson, Eugene W. Myers
Publication date: 27 August 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2007.03.004
Related Items
A multiobjective optimization algorithm for the weighted LCS, Monge properties of sequence alignment, On almost Monge all scores matrices, Efficient all path score computations on grid graphs, Periodic String Comparison
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The longest common subsequence problem revisited
- A decomposition theorem for partially ordered sets
- On the Common Substring Alignment Problem
- Sparse LCS Common Substring Alignment
- A fast algorithm for computing longest common subsequences
- Algorithms for the Longest Common Subsequence Problem
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Sparse dynamic programming II
- Incremental String Comparison