Longest common subsequence problem for unoriented and cyclic strings

  title={Longest common subsequence problem for unoriented and cyclic strings},
  author={François Nicolas and Eric Rivals},
  journal={Theor. Comput. Sci.},
Given a finite set of strings X, the Longest Common Subsequence problem (LCS) consists in finding a subsequence common to all strings in X that is of maximal length. LCS is a central problem in stringology and finds broad applications in text compression, conception of error-detecting codes, or biological sequence comparison. However, in numerous contexts words represent cyclic or unoriented sequences of symbols and LCS must be generalized to consider both orientations and/or all cyclic shifts… CONTINUE READING
7 Citations
33 References
Similar Papers


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

Molecular Biology of the Cell

  • B. Alberts, D. Bray, J. Lewis, M. Raff, K. Roberts, J. D. Watson
  • Garland, New York
  • 1983
Highly Influential
7 Excerpts

The complexity of some problems on subsequences and supersequences

  • D. Maier
  • Journal of the Association for Computing…
  • 1978
Highly Influential
14 Excerpts


  • D. Sankoff
  • B. Kruskal (Eds.), Time Warps, String Edits and…
  • 1999
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…