SNPs detection by eBWT positional clustering

[1]  Giovanna Rosone,et al.  Detecting Mutations by eBWT , 2018, WABI.

[2]  S. Hoffmann,et al.  Generalized enhanced suffix array construction in external memory , 2017, Algorithms for Molecular Biology.

[3]  Pierre Peterlongo,et al.  DiscoSnp++: de novo detection of small variants from raw unassembled read set(s) , 2017, bioRxiv.

[4]  Giovanni Manzini,et al.  Lightweight BWT and LCP Merging via the Gap Algorithm , 2017, SPIRE.

[5]  Guilherme P. Telles,et al.  Inducing enhanced suffix arrays for string collections , 2017, Theor. Comput. Sci..

[6]  Zamin Iqbal,et al.  Using reference-free compressed data structures to analyze sequencing reads from thousands of human genomes , 2016, bioRxiv.

[7]  Umer Zeeshan Ijaz,et al.  Illumina error profiles: resolving fine-scale variation in metagenomic sequencing data , 2016, BMC Bioinformatics.

[8]  Giovanna Rosone,et al.  Lightweight LCP construction for very large collections of strings , 2016, J. Discrete Algorithms.

[9]  Asako Koike,et al.  Analysis of genomic rearrangements by using the Burrows-Wheeler transform of short-read data , 2015, BMC Bioinformatics.

[10]  Gabor T. Marth,et al.  A global reference for human genetic variation , 2015, Nature.

[11]  Asako Koike,et al.  Ultrafast SNP analysis using the Burrows-Wheeler transform of short-read data , 2015, Bioinform..

[12]  Tomasz Marek Kowalski,et al.  Indexing Arbitrary-Length k-Mers in Sequencing Reads , 2015, PloS one.

[13]  Rayan Chikhi,et al.  Reference-free detection of isolated SNPs , 2014, Nucleic acids research.

[14]  Pierre Peterlongo,et al.  Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads , 2014, AlCoB.

[15]  Richard M Leggett,et al.  Reference-free SNP detection: dealing with the data deluge , 2014, BMC Genomics.

[16]  Barry G. Hall,et al.  When Whole-Genome Alignments Just Won't Work: kSNP v2 Software for Alignment-Free SNP Discovery and Phylogenetics of Hundreds of Microbial Genomes , 2013, PloS one.

[17]  Sarah Legge,et al.  Conservation of the Patchily Distributed and Declining Purple-Crowned Fairy-Wren (Malurus coronatus coronatus) across a Vast Landscape: The Need for a Collaborative Landscape-Scale Approach , 2013, PloS one.

[18]  Niko Välimäki,et al.  Scalable and Versatile k-mer Indexing for High-Throughput Sequencing Data , 2013, ISBRA.

[19]  Jens Stoye,et al.  metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences , 2013, BMC Bioinformatics.

[20]  Giovanna Rosone,et al.  Lightweight algorithms for constructing and inverting the BWT of string collections , 2013, Theor. Comput. Sci..

[21]  Zamin Iqbal,et al.  Identifying and Classifying Trait Linked Polymorphisms in Non-Reference Species by Walking Coloured de Bruijn Graphs , 2013, PloS one.

[22]  Roberto Grossi,et al.  Efficient Bubble Enumeration in Directed Graphs , 2012, SPIRE.

[23]  Giovanna Rosone,et al.  Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes , 2012, WABI.

[24]  Marie-France Sagot,et al.  Theme: Computational Biology and Bioinformatics Computational Sciences for Biology, Medicine and the Environment , 2012 .

[25]  Steven L Salzberg,et al.  Fast gapped-read alignment with Bowtie 2 , 2012, Nature Methods.

[26]  G. McVean,et al.  De novo assembly and genotyping of variants using colored de Bruijn graphs , 2011, Nature Genetics.

[27]  Nuno A. Fonseca,et al.  Assemblathon 1: a competitive assessment of de novo short read assembly methods. , 2011, Genome research.

[28]  T. Lecroq,et al.  Querying large read collections in main memory: a versatile data structure , 2011, BMC Bioinformatics.

[29]  Marie-France Sagot,et al.  Identifying SNPs without a Reference Genome by Comparing Raw Reads , 2010, SPIRE.

[30]  Richard Durbin,et al.  Fast and accurate long-read alignment with Burrows–Wheeler transform , 2010, Bioinform..

[31]  Siu-Ming Yiu,et al.  SOAP2: an improved ultrafast tool for short read alignment , 2009, Bioinform..

[32]  Antonio Restivo,et al.  An extension of the Burrows-Wheeler Transform , 2007, Theor. Comput. Sci..

[33]  Giovanni Manzini,et al.  Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[34]  Fei Shi,et al.  Suffix Arrays for Multiple Strings: A Method for On-Line Multiple String Searches , 1996, ASIAN.

[35]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[36]  B. Schmidt,et al.  SHREC: a short-read error correction method , 2009, Bioinform..

[37]  Claude-Alain H. Roten,et al.  Fast and accurate short read alignment with Burrows–Wheeler transform , 2009, Bioinform..