Finding Frequent Subsequences in a Set of Texts

@inproceedings{Mancheron2017FindingFS,
  title={Finding Frequent Subsequences in a Set of Texts},
  author={Alban Mancheron and Jean-Emile Symphor},
  year={2017}
}
Given a set of strings, the Common Subsequence Automaton accepts all common subsequences of these strings. Such an automaton can be deduced from other automata like the Directed Acyclic Subsequence Graph or the Subsequence Automaton. In this paper, we introduce some new issues in text algorithm on the basis of Common Subsequences related problems. Firstly… CONTINUE READING