P. Peterlongo, N. Schnel, N. Pisanti, M. Sagot, and V. Lacroix, Identifying SNPs without a Reference Genome by comparing raw reads, SPIRE, vol.6393, pp.147-58, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00514887

G. Sacomoto, J. Kielbassa, R. Chikhi, R. Uricaru, P. Antoniou et al., KISSPLICE: de-novo calling alternative splicing events from RNA-seq data, BMC Bioinf, vol.13, issue.S-6, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00784407

R. M. Leggett and D. Maclean, Reference-free SNP detection: dealing with the data deluge, BMC Genomics, vol.15, issue.4, p.10, 2014.

Z. Iqbal, I. Turner, G. Mcvean, P. Flicek, and M. Caccamo, De novo assembly and genotyping of variants using colored de Bruijn graphs, Nat Genet, vol.44, issue.2, pp.226-258, 2012.

R. Uricaru, G. Rizk, V. Lacroix, E. Quillery, O. Plantard et al., Reference-free detection of isolated SNPs, Nuc Acids Res, vol.43, issue.2, p.11, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01083715

N. Prezza, N. Pisanti, M. Sciortino, and G. Rosone, Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 18th Workshop on Algorithms in Bioinformatics (WABI 2018), LIPIcs, vol.113, pp.3-1315, 2018.

N. Prezza, N. Pisanti, M. Sciortino, and G. Rosone, SNPs detection by eBWT positional clustering, Algoritm Mol Biol, vol.14, issue.1, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02335605

P. Peterlongo, C. Riou, E. Drezen, and C. Lemaitre, DiscoSnp++: de novo detection of small variants from raw unassembled read set(s). bioRxiv, 2017.

S. Li, R. Li, H. Li, J. Lu, Y. Li et al., SOAPindel: efficient identification of indels from short paired reads, Gen Res, vol.23, issue.1, pp.195-200, 2013.

L. Salmela and E. Rivals, LoRDEC: accurate and efficient long read error correction, Bioinformatics, vol.30, issue.24, pp.3506-3520, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01100451

L. Salmela, R. Walve, E. Rivals, and E. Ukkonen, Accurate self-correction of errors in long reads using de Bruijn graphs, Bioinformatics, vol.33, issue.6, pp.799-806, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01385006

A. Limasset, J. Flot, and P. Peterlongo, Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs, Bioinformatics, vol.36, issue.5, pp.1374-81, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01644163

C. Lemaitre, L. Ciortuz, and P. Peterlongo, Mapping-free and assembly-free discovery of inversion breakpoints from raw NGS reads, AlCoB, pp.119-149, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01063157

P. Bonizzoni, R. Dondi, G. W. Klau, Y. Pirola, N. Pisanti et al., On the minimum error correction problem for haplotype assembly in diploid and polyploid genomes, J Comput Biol, vol.23, issue.9, pp.718-754, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01388448

Y. Pirola, S. Zaccaria, R. Dondi, G. W. Klau, N. Pisanti et al., Hapcol: accurate and memory-efficient haplotype assembly from long reads, Bioinform, vol.32, issue.11, pp.1610-1617, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01225984

M. Patterson, T. Marschall, N. Pisanti, L. Van-iersel, L. Stougie et al., Weighted haplotype assembly for future-generation sequencing reads, J Comput Biol, vol.22, issue.6, pp.498-509, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01225988

E. Birmelé, P. Crescenzi, R. A. Ferreira, R. Grossi, V. Lacroix et al., Efficient Bubble Enumeration in Directed Graphs, SPIRE, vol.7608, pp.118-147, 2012.

R. M. Leggett, R. H. Ramirez-gonzalez, W. Verweij, C. G. Kawashima, Z. Iqbal et al., Identifying and Classifying Trait Linked Polymorphisms in Non-Reference Species by Walking Coloured de Bruijn Graphs, PLoS ONE, vol.8, issue.3, pp.1-11, 2013.

K. Kimura and A. Koike, Analysis of genomic rearrangements by using the Burrows-Wheeler transform of short-read data, BMC Bioinf, vol.16, p.5, 2015.

K. Kimura and A. Koike, Ultrafast SNP analysis using the Burrows-Wheeler transform of short-read data, Bioinformatics, vol.31, issue.10, pp.1577-83, 2015.

N. Philippe, M. Salson, T. Lecroq, M. Léonard, T. Commes et al., Querying large read collections in main memory: a versatile data structure, BMC Bioinf, vol.12, p.242, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00632958

N. Välimäki and E. Rivals, Scalable and Versatile k-mer Indexing for High-Throughput Sequencing Data, ISBRA, vol.7875, pp.237-285, 2013.

T. M. Kowalski, S. Grabowski, and S. Deorowicz, Indexing arbitrary-length k-mers in sequencing reads, PLoS ONE, vol.10, issue.7, 2015.

S. Mantaci, A. Restivo, and M. Sciortino, Burrows-Wheeler transform and Sturmian words, Inf Process Lett, vol.86, issue.5, pp.241-247, 2003.

R. Giancarlo, A. Restivo, and M. Sciortino, From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization, Theoret Comput Sci, vol.387, issue.3, pp.236-284, 2007.

S. Mantaci, A. Restivo, G. Rosone, M. Sciortino, and L. Versari, Measuring the clustering effect of BWT via RLE, Theor Comput Sci, vol.698, pp.79-87, 2017.

D. Kempa and T. Kociumaka, Resolution of the Burrows-Wheeler Transform Conjecture, CoRR, vol.10631, 2019.

R. Giancarlo, G. Manzini, A. Restivo, G. Rosone, and M. Sciortino, The Alternating BWT: An algorithmic perspective, Theor Comput Sci, vol.812, pp.230-273, 2020.

R. Giancarlo, G. Manzini, G. Rosone, and M. Sciortino, A new class of searchable and provably highly compressible string transformations, Annual Symposium on Combinatorial Pattern Matching (CPM), LIPIcs, vol.128, 2019.

S. Giuliani, Z. Lipták, and R. Rizzi, When a dollar makes a BWT, 20th Italian Conference on Theoretical Computer Science, vol.2504, pp.20-33, 2019.

S. Mantaci, A. Restivo, G. Rosone, and M. Sciortino, A new combinatorial approach to sequence comparison, Theory Comput Syst, vol.42, issue.3, pp.411-440, 2008.

S. Mantaci, A. Restivo, and M. Sciortino, Distance measures for biological sequences: Some recent approaches, Int J Approx Reason, vol.47, issue.1, pp.109-133, 2008.

L. Yang, X. Zhang, and T. Wang, The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform, J Theor Biol, vol.262, issue.4, pp.742-751, 2010.

H. Li and R. Durbin, Fast and accurate long-read alignment with Burrows-Wheeler transform, Bioinformatics, vol.26, issue.5, pp.589-95, 2010.

A. Cox, M. Bauer, T. Jakobi, and G. Rosone, Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform, Bioinformatics, vol.28, issue.11, pp.1415-1424, 2012.

G. Rosone and M. Sciortino, The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words, The Nature of Computation. Logic, Algorithms, Applications -9th Conference on Computability in Europe, CiE 2013. Proceedings, vol.7921, pp.353-64, 2013.

A. J. Cox, F. Garofalo, G. Rosone, and M. Sciortino, Lightweight LCP construction for very large collections of strings, J Discret Algoritm, vol.37, pp.17-33, 2016.

L. Egidi, F. A. Louza, G. Manzini, and G. P. Telles, External memory BWT and LCP computation for sequence collections with applications, Algoritm Mol Biol, vol.14, issue.1, pp.6-1615, 2019.

T. Gagie, G. Manzini, and J. Sirén, Wheeler graphs: A framework for BWT-based data structures, Theor Comput Sci, vol.698, pp.67-78, 2017.

T. Gagie, G. Navarro, and N. Prezza, Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space, J ACM, vol.67, issue.1, pp.2-1254, 2020.

S. Mantaci, A. Restivo, G. Rosone, and M. Sciortino, An extension of the Burrows-Wheeler Transform, Theoret Comput Sci, vol.387, issue.3, pp.298-312, 2007.

M. J. Bauer, A. J. Cox, and G. Rosone, Lightweight algorithms for constructing and inverting the BWT of string collections, Theoret Comput Sci, vol.483, issue.0, pp.134-182, 2013.

. Bcr_lcp_gsa and . Github, GitHub repository, vol.44, 2019.

, ropebwt2. GitHub repository, vol.46, 2019.

. Beetl and . Github, , 2019.

D. D. Dolle, Z. Liu, M. Cotten, J. T. Simpson, Z. Iqbal et al., Using reference-free compressed data structures to analyze sequencing reads from thousands of human genomes, Gen Res, vol.27, issue.2, pp.300-309, 2017.

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

A. J. Cox, T. Jakobi, G. Rosone, and O. B. Schulz-trieglaff, Comparing DNA sequence collections by direct comparison of compressed text indexes, 12th Workshop on Algorithms in Bioinformatics (WABI 2012, pp.214-238, 2012.

C. Ander, O. B. Schulz-trieglaff, J. Stoye, and A. J. Cox, metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences, BMC Bioinf, vol.14, issue.5, 2013.

V. Guerrini and G. Rosone, Lightweight Metagenomic Classification via eBWT, Algorithms for Computational Biology, vol.11488, pp.112-136, 2019.

A. Restivo and G. Rosone, Balancing and clustering of words in the Burrows-Wheeler transform, Theoret Comput Sci, vol.412, issue.27, pp.3019-3051, 2011.

S. Mantaci, A. Restivo, G. Rosone, and M. Sciortino, Burrows-Wheeler Transform and Run-Length Enconding, Combinatorics on Words -11th International Conference, WORDS 2017. Proceedings, vol.10432, pp.228-267, 2017.

T. Gagie, G. Navarro, and N. Prezza, Optimal-time Text Indexing in BWT-runs Bounded Space, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '18, pp.1459-77, 2018.

N. Prezza and G. Rosone, Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), LIPIcs, vol.128, pp.7-1718, 2019.

M. Burrows and D. J. Wheeler, A Block Sorting data Compression Algorithm, Digit Syst Res Cent, 1994.

D. Adjeroh, T. Bell, and A. Mukherjee, The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 2008.

P. Ferragina, R. Giancarlo, G. Manzini, and M. Sciortino, Boosting textual compression in optimal linear time, J ACM, vol.52, issue.4, pp.688-713, 2005.

L. Janin, G. Rosone, and A. J. Cox, Adaptive reference-free compression of sequence quality scores, Bioinformatics, vol.30, issue.1, pp.24-30, 2014.

P. Krusche, L. Trigg, P. C. Boutros, C. E. Mason, M. Francisco et al., Best practices for benchmarking germline small-variant calls in human genomes, Nat Biotechnol, 20191.

S. Chandak, K. Tatwawadi, and T. Weissman, Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis, Bioinformatics, vol.34, issue.4, pp.558-67, 2017.

D. Earl, K. Bradnam, J. St-john, A. Darling, D. Lin et al., Assemblathon 1: A competitive assessment of de novo short read assembly methods, Gen Res, vol.21, issue.12, pp.2224-2265, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00637571

, Publisher's Note

, Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations