C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, Fast subsequence matching in time-series databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, ser. SIGMOD '94, pp.419-429, 1994.

C. Sander and R. Schneider, Database of homology-derived protein structures and the structural meaning of sequence alignment, Proteins: Structure, Function, and Genetics, vol.4, issue.1, pp.56-68, 1991.
DOI : 10.1002/prot.340090107

C. Chothia and M. Gerstein, Protein evolution. how far can sequences diverge, Nature, vol.6617, issue.385, pp.579-581, 1997.

Q. Yang and H. H. Zhang, Web-log mining for predictive web caching, IEEE Transactions on Knowledge and Data Engineering, vol.15, 2003.

J. Serrà, H. Kantz, X. Serra, and R. G. Andrzejak, Predictability of Music Descriptor Time Series and its Application to Cover Song Detection, IEEE Transactions on Audio, Speech, and Language Processing, vol.20, issue.2, pp.514-525, 2012.
DOI : 10.1109/TASL.2011.2162321

C. Leslie, E. Eskin, and W. S. Noble, THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION, Biocomputing 2002, pp.564-575, 2002.
DOI : 10.1142/9789812799623_0053

T. Xiong, S. Wang, Q. Jiang, and J. Z. Huang, A New Markov Model for Clustering Categorical Sequences, 2011 IEEE 11th International Conference on Data Mining, pp.854-863, 2011.
DOI : 10.1109/ICDM.2011.13

V. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Physics Doklady, vol.10, issue.8, pp.707-710, 1966.

J. Herranz, J. Nin, and M. Sole, Optimal Symbol Alignment Distance: A New Distance for Sequences of Symbols, IEEE Transactions on Knowledge and Data Engineering, vol.23, issue.10, pp.1541-1554, 2011.
DOI : 10.1109/TKDE.2010.190

E. Keogh, Exact indexing of dynamic time warping, Proceedings of the 28th international conference on Very Large Data Bases, ser. VLDB '02. VLDB Endowment, pp.406-417, 2002.

H. Wang and Z. Lin, A Novel Algorithm for Counting All Common Subsequences, 2007 IEEE International Conference on Granular Computing (GRC 2007)
DOI : 10.1109/GrC.2007.112

S. Wodak and J. Janin, Structural basis of macromolecular recognition, Adv Protein Chem, vol.61, pp.9-73, 2002.
DOI : 10.1016/S0065-3233(02)61001-0

D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, vol.18, issue.6, pp.341-343, 1975.
DOI : 10.1145/360825.360861

N. Linial and N. Nisan, Approximate Inclusion-Exclusion, Combinatorica, vol.8, issue.4, pp.349-365, 1990.
DOI : 10.1007/BF02128670
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.4000

J. Oncina and M. Sebban, Learning stochastic edit distance: Application in handwritten character recognition, Pattern Recognition, vol.39, issue.9, pp.1575-1587, 2006.
DOI : 10.1016/j.patcog.2006.03.011
URL : https://hal.archives-ouvertes.fr/hal-00114106

F. Muzaffar, B. Mohsin, F. Naz, and L. F. Jawed, DSP Implementation of Voice Recognition Using Dynamic Time Warping Algorithm, 2005 Student Conference on Engineering Sciences and Technology, pp.1-7, 2005.
DOI : 10.1109/SCONEST.2005.4382877

M. J. Sequeira, ADMIT, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, 2002.
DOI : 10.1145/775047.775103

M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, and E. J. Keogh, Indexing multidimensional time-series with support for multiple distance measures, pp.216-225, 2003.

C. Elzinga, S. Rahmann, and H. Wang, Algorithms for subsequence combinatorics, Theoretical Computer Science, vol.409, issue.3, pp.394-404, 2008.
DOI : 10.1016/j.tcs.2008.08.035

R. Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing

X. Yan, J. Han, and R. Afshar, CloSpan: Mining: Closed Sequential Patterns in Large Datasets, SDM, pp.166-177, 2003.
DOI : 10.1137/1.9781611972733.15