Longest common subsequence problem for unoriented and cyclic strings

Abstract

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… (More)
DOI: 10.1016/j.tcs.2006.10.002

Topics

Cite this paper

@article{Nicolas2007LongestCS, title={Longest common subsequence problem for unoriented and cyclic strings}, author={François Nicolas and Eric Rivals}, journal={Theor. Comput. Sci.}, year={2007}, volume={370}, pages={1-18} }