Two algorithms for LCS consecutive suffix alignment
From MaRDI portal
Publication:2643733
DOI10.1016/J.JCSS.2007.03.004zbMATH Open1165.90668OpenAlexW1989478034MaRDI QIDQ2643733FDOQ2643733
Eugene W. Myers, Gad M. Landau, Michal Ziv-Ukelson
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
Recommendations
Cites Work
- Title not available (Why is that?)
- 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
- Incremental String Comparison
- Title not available (Why is that?)
- The longest common subsequence problem revisited
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Algorithms for the Longest Common Subsequence Problem
- Sparse dynamic programming II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Monge properties of sequence alignment
- Linear-space S-table algorithms for the longest common subsequence problem
- On almost Monge all scores matrices
- A multiobjective optimization algorithm for the weighted LCS
- Efficient all path score computations on grid graphs
- Periodic String Comparison
- Combinatorial Pattern Matching
- Title not available (Why is that?)
This page was built for publication: Two algorithms for LCS consecutive suffix alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643733)
