J. J. Hébrard and M. Crochemore, Calcul de la distance par les sous-mots, RAIRO - Theoretical Informatics and Applications, vol.20, issue.4, pp.441-456
DOI : 10.1051/ita/1986200404411

R. Baeza-yates, Searching subsequences, Theoretical Computer Science, vol.78, issue.2, pp.363-376
DOI : 10.1016/0304-3975(91)90358-9

URL : http://doi.org/10.1016/0304-3975(91)90358-9

Z. Troní?ek and B. Melichar, Directed Acyclic Subsequence Graph, Proceedings of the Prague Stringology Club Workshop '98, pp.107-118

M. Crochemore, B. Melichar, and Z. Troní?ek, Directed acyclic subsequence graph???Overview, Journal of Discrete Algorithms, vol.1, issue.3-4, pp.3-4
DOI : 10.1016/S1570-8667(03)00029-7

URL : http://doi.org/10.1016/s1570-8667(03)00029-7

H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa, Online construction of subsequence automata for multiple texts, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp.146-152
DOI : 10.1109/SPIRE.2000.878190

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation
DOI : 10.1145/568438.568455

A. Mancheron and J. Symphor, Finding Frequent Subsequences in a Set of Texts, Submitted to the 16 th Symposium on Foundation on Computer Theoretical Sciences (fcts)
URL : https://hal.archives-ouvertes.fr/inria-00257561