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
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
Reference-free SNP detection: dealing with the data deluge, BMC Genomics, vol.15, issue.4, p.10, 2014. ,
De novo assembly and genotyping of variants using colored de Bruijn graphs, Nat Genet, vol.44, issue.2, pp.226-258, 2012. ,
Reference-free detection of isolated SNPs, Nuc Acids Res, vol.43, issue.2, p.11, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01083715
Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 18th Workshop on Algorithms in Bioinformatics (WABI 2018), LIPIcs, vol.113, pp.3-1315, 2018. ,
SNPs detection by eBWT positional clustering, Algoritm Mol Biol, vol.14, issue.1, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02335605
DiscoSnp++: de novo detection of small variants from raw unassembled read set(s). bioRxiv, 2017. ,
SOAPindel: efficient identification of indels from short paired reads, Gen Res, vol.23, issue.1, pp.195-200, 2013. ,
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
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
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
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
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
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
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
Efficient Bubble Enumeration in Directed Graphs, SPIRE, vol.7608, pp.118-147, 2012. ,
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. ,
Analysis of genomic rearrangements by using the Burrows-Wheeler transform of short-read data, BMC Bioinf, vol.16, p.5, 2015. ,
Ultrafast SNP analysis using the Burrows-Wheeler transform of short-read data, Bioinformatics, vol.31, issue.10, pp.1577-83, 2015. ,
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
Scalable and Versatile k-mer Indexing for High-Throughput Sequencing Data, ISBRA, vol.7875, pp.237-285, 2013. ,
Indexing arbitrary-length k-mers in sequencing reads, PLoS ONE, vol.10, issue.7, 2015. ,
Burrows-Wheeler transform and Sturmian words, Inf Process Lett, vol.86, issue.5, pp.241-247, 2003. ,
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. ,
Measuring the clustering effect of BWT via RLE, Theor Comput Sci, vol.698, pp.79-87, 2017. ,
Resolution of the Burrows-Wheeler Transform Conjecture, CoRR, vol.10631, 2019. ,
The Alternating BWT: An algorithmic perspective, Theor Comput Sci, vol.812, pp.230-273, 2020. ,
A new class of searchable and provably highly compressible string transformations, Annual Symposium on Combinatorial Pattern Matching (CPM), LIPIcs, vol.128, 2019. ,
When a dollar makes a BWT, 20th Italian Conference on Theoretical Computer Science, vol.2504, pp.20-33, 2019. ,
A new combinatorial approach to sequence comparison, Theory Comput Syst, vol.42, issue.3, pp.411-440, 2008. ,
Distance measures for biological sequences: Some recent approaches, Int J Approx Reason, vol.47, issue.1, pp.109-133, 2008. ,
The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform, J Theor Biol, vol.262, issue.4, pp.742-751, 2010. ,
Fast and accurate long-read alignment with Burrows-Wheeler transform, Bioinformatics, vol.26, issue.5, pp.589-95, 2010. ,
Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform, Bioinformatics, vol.28, issue.11, pp.1415-1424, 2012. ,
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. ,
Lightweight LCP construction for very large collections of strings, J Discret Algoritm, vol.37, pp.17-33, 2016. ,
External memory BWT and LCP computation for sequence collections with applications, Algoritm Mol Biol, vol.14, issue.1, pp.6-1615, 2019. ,
Wheeler graphs: A framework for BWT-based data structures, Theor Comput Sci, vol.698, pp.67-78, 2017. ,
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space, J ACM, vol.67, issue.1, pp.2-1254, 2020. ,
An extension of the Burrows-Wheeler Transform, Theoret Comput Sci, vol.387, issue.3, pp.298-312, 2007. ,
Lightweight algorithms for constructing and inverting the BWT of string collections, Theoret Comput Sci, vol.483, issue.0, pp.134-182, 2013. ,
, GitHub repository, vol.44, 2019.
, ropebwt2. GitHub repository, vol.46, 2019.
, , 2019.
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.
Comparing DNA sequence collections by direct comparison of compressed text indexes, 12th Workshop on Algorithms in Bioinformatics (WABI 2012, pp.214-238, 2012. ,
metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences, BMC Bioinf, vol.14, issue.5, 2013. ,
Lightweight Metagenomic Classification via eBWT, Algorithms for Computational Biology, vol.11488, pp.112-136, 2019. ,
Balancing and clustering of words in the Burrows-Wheeler transform, Theoret Comput Sci, vol.412, issue.27, pp.3019-3051, 2011. ,
Burrows-Wheeler Transform and Run-Length Enconding, Combinatorics on Words -11th International Conference, WORDS 2017. Proceedings, vol.10432, pp.228-267, 2017. ,
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. ,
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. ,
A Block Sorting data Compression Algorithm, Digit Syst Res Cent, 1994. ,
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 2008. ,
Boosting textual compression in optimal linear time, J ACM, vol.52, issue.4, pp.688-713, 2005. ,
Adaptive reference-free compression of sequence quality scores, Bioinformatics, vol.30, issue.1, pp.24-30, 2014. ,
Best practices for benchmarking germline small-variant calls in human genomes, Nat Biotechnol, 20191. ,
Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis, Bioinformatics, vol.34, issue.4, pp.558-67, 2017. ,
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