Fast and accurate short read alignment with Burrows-Wheeler transform, Bioinformatics, vol.25, issue.14, pp.1754-60, 2009. ,
Fast gapped-read alignment with Bowtie 2, Nat Methods, vol.9, issue.4, pp.357-366, 2012. ,
SOAP2: an improved ultrafast tool for short read alignment, Bioinformatics, vol.25, issue.15, pp.1966-1973, 2009. ,
Opportunistic data structures with applications, FOCS, pp.390-398, 2000. ,
A block sorting data compression algorithm, 1994. ,
Analysis of genomic rearrangements by using the Burrows-Wheeler transform of short-read data, BMC Bioinform, 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. ,
Identifying SNPs without a reference genome by comparing raw reads, SPIRE, LNCS, 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 Bioinform, vol.13, issue.6, p.5, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00784407
Reference-free SNP detection: dealing with the data deluge, BMC Genom, 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. ,
Using reference-free compressed data structures to analyze, vol.13, p.13 ,
14:3 ? fast, convenient online submission ? thorough peer review by experienced researchers in your field ? rapid publication on acceptance ? support for research data, including large and complex data types ? gold Open Access which fosters wider collaboration and increased citations maximum visibility for your research: over 100M website views per year ? At BMC, research is always in progress. Learn more biomedcentral.com/submissions Ready to submit your research ? Choose BMC and benefit from: sequencing reads from thousands of human genomes, Algorithms Mol Biol, vol.27, issue.2, pp.300-309, 2017. ,
An extension of the Burrows-Wheeler transform, Theor Comput Sci, vol.387, issue.3, pp.298-312, 2007. ,
Lightweight algorithms for constructing and inverting the BWT of string collections, Theor Comput Sci, vol.483, pp.134-182, 2013. ,
, 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, WABI, LNBI, vol.7534, pp.214-238, 2012. ,
metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences, BMC Bioinform, vol.14, issue.5, p.2, 2013. ,
Querying large read collections in main memory: a versatile data structure, BMC Bioinform, vol.12, p.242, 2011. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00632958
Scalable and versatile k-mer Indexing for highthroughput sequencing data, ISBRA, LNCS, vol.7875, pp.237-285, 2013. ,
Indexing arbitrary-length k-mers in sequencing reads, PLoS ONE, vol.10, issue.7, p.133198, 2015. ,
SHREC: a short-read error correction method, Bioinformatics, vol.25, issue.17, pp.2157-63, 2009. ,
Mapping-free and assembly-free discovery of inversion breakpoints from raw NGS reads, pp.119-149, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01063157
Efficient bubble enumeration in directed graphs, SPIRE, LNCS, 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. ,
Reference-free detection of isolated SNPs, Nucl Acids Res, vol.43, issue.2, p.11, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01083715
DiscoSnp++: de novo detection of small variants from raw unassembled read set(s). bioRxiv, 2017. ,
When whole-genome alignments just won't work: kSNP v2 Software for alignment-free SNP discovery and phylogenetics of hundreds of microbial genomes, PLoS ONE, vol.8, issue.12, p.81760, 2013. ,
Detecting mutations by eBWT, WABI 2018, Leibniz international proceedings in informatics (LIPIcs), vol.113, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01925950
Suffix arrays for multiple strings: a method for on-line multiple string searches, ASIAN, LNCS, vol.1179, pp.11-22, 1996. ,
Lightweight LCP construction for very large collections of strings, J Discrete Algorithms, vol.37, pp.17-33, 2016. ,
Generalized enhanced suffix array construction in external memory, Algorithms Mol Biol, vol.12, issue.1, p.26, 2017. ,
Suffix arrays: a new method for on-line string searches, SODA, pp.319-346, 1990. ,
Lightweight BWT and LCP merging via the Gap algorithm, SPIRE, LNCS, vol.10508, pp.176-90, 2017. ,
Illumina error profiles: resolving fine-scale variation in metagenomic sequencing data, BMC Bioinform, vol.17, issue.1, p.125, 2016. ,
Inducing enhanced suffix arrays for string collections, Theor Comput Sci, vol.678, pp.22-39, 2017. ,
Fast and accurate long-read alignment with Burrows-Wheeler transform, Bioinformatics, vol.26, issue.5, pp.589-95, 2010. ,
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