Two Algorithms for LCS Consecutive Suffix Alignment

@inproceedings{Landau2004TwoAF,
  title={Two Algorithms for LCS Consecutive Suffix Alignment},
  author={Gad M. Landau and Eugene W. Myers and Michal Ziv-Ukelson},
  booktitle={CPM},
  year={2004}
}
The problem of aligning two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence similarity problem is the incremental string comparison problem, denoted Consecutive Suffix Alignment, which is, given two strings A and B, to compute the alignment solution of each suffix of A versus B. Here, we present two solutions to the Consecutive Suffix Alignment Problem under the LCS (Longest Common Subsequence… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 16 references

String Editing and Longest Common Subsequences

Handbook of Formal Languages • 1997
View 3 Excerpts
Highly Influenced

Ziv - Ukelson , On the common substring alignment problem

G. M. Landau, M.
Journal of Algorithms • 2000

Ziv - Ukelson , On the shared substring alignment problem

G. M. Landau, M.
Proc . Symposium On Discrete Algorithms • 1998

Similar Papers

Loading similar papers…