Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975. ,
DOI : 10.1145/360825.360855
Basic local alignment search tool, Journal of Molecular Biology, vol.215, issue.3, pp.403-410, 1990. ,
DOI : 10.1016/S0022-2836(05)80360-2
Fast and practical approximate string matching, Information Processing Letters, vol.59, issue.1, pp.21-27, 1996. ,
DOI : 10.1016/0020-0190(96)00083-X
Graphical pan-genome analysis with compressed suffix trees and the Burrows???Wheeler transform, Bioinformatics, vol.32, issue.4, pp.497-504, 2016. ,
DOI : 10.1093/bioinformatics/btv603
Algorithms on Strings, 2007. ,
DOI : 10.1017/CBO9780511546853
URL : https://hal.archives-ouvertes.fr/hal-00470109
Optimal suffix tree construction with large alphabets, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.137-143, 1997. ,
DOI : 10.1109/SFCS.1997.646102
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4336
Algorithms on Strings, Trees, and Sequences -Computer Science and Computational Biology, 1997. ,
Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage, Algorithms for Molecular Biology, vol.30, issue.1, 2016. ,
DOI : 10.1186/s13015-016-0066-8
URL : http://doi.org/10.1186/s13015-016-0066-8
Fast pattern-matching on indeterminate strings, Journal of Discrete Algorithms, vol.6, issue.1, pp.37-50, 2008. ,
DOI : 10.1016/j.jda.2006.10.003
URL : http://doi.org/10.1016/j.jda.2006.10.003
Short read alignment with populations of genomes, Bioinformatics, vol.29, issue.13, pp.361-370, 2013. ,
DOI : 10.1093/bioinformatics/btt215
Efficient Pattern Matching in Elastic-Degenerate Texts, LATA. LNCS, pp.131-142, 2017. ,
DOI : 10.1007/11809678_17
Ensembl Genomes 2016: more genomes, more complexity, .M.: Ensembl genomes 2016: more genomes, more complexity, pp.574-580, 2016. ,
DOI : 10.1093/nar/gkv1209
URL : http://doi.org/10.1093/nar/gkv1209
Fast Pattern Matching in Strings, SIAM Journal on Computing, vol.6, issue.2, pp.323-350, 1977. ,
DOI : 10.1137/0206024
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.8147
A natural encoding of genetic variation in a Burrows-Wheeler transform to enable mapping and genome inference, In: WABI. LNBI, vol.9838, pp.222-233, 2016. ,
FM-index of alignment: A compressed index for similar strings, Theoretical Computer Science, vol.638, pp.159-170, 2016. ,
DOI : 10.1016/j.tcs.2015.08.008
Faster compressed suffix trees for repetitive collections, ACM Journal of Experimental Algorithmics, vol.2188, issue.1, pp.1-138, 2016. ,
DOI : 10.1145/2851495
Flexible Pattern Matching in Strings: Practical On-line Search Algorithms for Texts and Biological Sequences, 2002. ,
DOI : 10.1017/CBO9781316135228
Building a Pan-Genome Reference for a Population, Journal of Computational Biology, vol.22, issue.5, pp.387-401, 2015. ,
DOI : 10.1089/cmb.2014.0146
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4424974
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, pp.1635-1660, 2009. ,
DOI : 10.1089/cmb.2008.0019
URL : https://hal.archives-ouvertes.fr/hal-00618073
Finding flexible patterns in a text: an application to three-dimensional molecular matching, Bioinformatics, vol.11, issue.1, pp.59-70, 1995. ,
DOI : 10.1093/bioinformatics/11.1.59
PanTools: representation, storage and exploration of pan-genomic data, Bioinformatics, vol.32, issue.17, pp.487-493, 2016. ,
DOI : 10.1093/bioinformatics/btw455
Indexing Variation Graphs, 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp.13-27, 2017. ,
DOI : 10.1137/1.9781611974768.2