Eric Rivals' group
Home
News
Team
Projects
Publications
Courses
Contact
Cyclic string
Longest common subsequence problem for unoriented and cyclic strings
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 …
Cite
×