G. Bernardini, P. Gawrychowski, N. Pisanti, S. P. Pissis, and G. Rosone, Even faster elastic-degenerate string matching via fast matrix multiplication, 46th International Colloquium on Automata, Languages and Programming, vol.132, pp.1-16, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02298621

, Computational pangenomics: status, promises and challenges, The Computational Pan-Genomics Consortium, vol.19, pp.118-135, 2018.

L. Huang, V. Popic, and S. Batzoglou, Short read alignment with populations of genomes, Bioinformatics, vol.29, issue.13, pp.361-370, 2013.

P. Bille, G. M. Landau, R. Raman, K. Sadakane, S. R. Satti et al., Random access to grammar-compressed strings and trees, SIAM J. Comput, vol.44, issue.3, pp.513-539, 2015.

T. Gagie, P. Gawrychowski, and S. J. Puglisi, Faster approximate pattern matching in compressed repetitive texts, Algorithms and Computation -22nd International Symposium, vol.7074, pp.653-662, 2011.

G. Navarro, Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, vol.7643, pp.274-279, 2012.

S. Wandelt and U. Leser, String searching in referentially compressed genomes, KDIR 2012 -Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, pp.95-102, 2012.

T. Gagie and S. J. Puglisi, Searching and indexing genomic databases via kernelization, Frontiers in Bioengineering and Biotechnology, vol.3, p.12, 2015.

C. Barton, C. Liu, and S. P. Pissis, On-line pattern matching on uncertain sequences and applications, Combinatorial Optimization and Applications -10th International Conference, vol.10043, pp.547-562, 2016.

T. Kociumaka, S. P. Pissis, and J. Radoszewski, Pattern matching and consensus problems on weighted sequences and profiles, vol.64, p.12, 2016.

C. S. Iliopoulos, R. Kundu, and S. P. Pissis, Efficient pattern matching in elastic-degenerate texts, Language and Automata Theory and Applications -11th International Conference, vol.10168, pp.131-142, 2017.

K. R. Abrahamson, Generalized string matching, SIAM J. Comput, vol.16, issue.6, pp.1039-1051, 1987.

M. Crochemore, C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter et al., Covering problems for partial words and for indeterminate strings, Theor. Comput. Sci, vol.698, pp.25-39, 2017.

C. S. Iliopoulos and J. Radoszewski, Truly subquadratic-time extension queries and periodicity detection in strings with uncertainties, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, vol.54, p.12, 2016.

N. Pisanti, H. Soldano, M. Carpentier, and J. Pothier, A relational extension of the notion of motifs: Application to the common 3d protein substructures searching problem, Journal of Computational Biology, vol.16, issue.12, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00618073

H. Soldano, A. Viari, and M. Champesme, Searching for flexible repeated patterns using a non-transitive similarity relation, Pattern Recognition Letters, vol.16, issue.3, pp.233-246, 1995.

M. Alzamel, L. A. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos et al., Degenerate string comparison and applications, 18th International Workshop on Algorithms in Bioinformatics, WABI 2018, vol.113, p.14, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01964706

, The 1000 Genomes Project Consortium, A global reference for human genetic variation, Nature, vol.526, issue.7571, pp.68-74, 2015.

S. P. Pissis and A. Retha, Dictionary matching in elastic-degenerate texts with applications in searching VCF files on-line, 17th International Symposium on Experimental Algorithms, SEA 2018, vol.103, p.14, 2018.

J. Holub, W. F. Smyth, and S. Wang, Fast pattern-matching on indeterminate strings, J. Discrete Algorithms, vol.6, issue.1, pp.37-50, 2008.

R. Rahn, D. Weese, and K. Reinert, Journaled string treea scalable data structure for analyzing thousands of similar genomes on your laptop, Bioinformatics, vol.30, issue.24, pp.3499-3505, 2014.

S. Maciuca, C. Del-ojo, G. Elias, and Z. Mcvean, A natural encoding of genetic variation in a burrows-wheeler transform to enable mapping and genome inference, Algorithms in Bioinformatics -16th International Workshop, WABI 2016, vol.9838, pp.222-233, 2016.

J. Sirén, Indexing variation graphs, Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, pp.13-27, 2017.

J. C. Na, H. Kim, S. Min, H. Park, T. Lecroq et al., Fm-index of alignment with gaps, Theor. Comput. Sci, vol.710, pp.148-157, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01894852

R. A. Baeza-yates and C. H. Perleberg, Fast and practical approximate string matching, Inf. Process. Lett, vol.59, issue.1, pp.21-27, 1996.

S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, Basic local alignment search tool, Journal of Molecular Biology, vol.215, issue.3, pp.403-410, 1990.

R. Grossi, C. S. Iliopoulos, C. Liu, N. Pisanti, S. P. Pissis et al., On-line pattern matching on similar texts, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, vol.78, p.14, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01526650

K. Aoyama, Y. Nakashima, T. I. , S. Inenaga, H. Bannai et al., Faster online elastic degenerate string matching, Annual Symposium on Combinatorial Pattern Matching, CPM 2018, vol.105, pp.1-9, 2018.

A. Cis-lak, S. Grabowski, and J. Holub, Sopang: online text searching over a pan-genome, Bioinformatics, vol.34, issue.24, pp.4290-4292, 2018.

M. Rautiainen, V. Makinen, and T. Marschall, Bit-parallel sequence-to-graph alignment

G. Bernardini, N. Pisanti, S. P. Pissis, and G. Rosone, Pattern matching on elastic-degenerate text with errors, String Processing and Information Retrieval -24th International Symposium, vol.10508, pp.74-90, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01673585

D. Gusfield, Algorithms on strings, trees, and sequences, 1997.

G. M. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp.220-230, 1986.

M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. ACM, vol.31, issue.3, pp.538-544, 1984.

M. Farach, Optimal suffix tree construction with large alphabets, 38th Annual Symposium on Foundations of Computer Science, FOCS '97, pp.137-143, 1997.