We show how positional markers can be used to encode genetic variation within a Burrows-Wheeler Transform (BWT), and use this to construct a generalisation of the traditional “reference genome”, incorporating known variation within a species. Our goal is to support the inference of the closest mosaic of previously known sequences to the genome(s) under analysis. Our scheme results in an increased alphabet size, and by using a wavelet tree encoding of the BWT we reduce the performance impact on rank operations. We give a specialised form of the backward search that allows variation-aware exact matching. We implement this, and demonstrate the cost of constructing an index of the whole human genome with 8 million genetic variants is 25GB of RA...
DNA sequencing technologies keep getting faster and cheaper leading to massive availability of entir...
In this thesis, I study the problem of genome inference from short-read DNA sequencing data, with th...
Motivation: The Burrows–Wheeler transform (BWT) is the foundation of many algorithms for compression...
We show how positional markers can be used to encode genetic variation within a Burrows-Wheeler Tran...
Abstract We present a generalization of the positional Burrows–Wheeler transform, or PBWT, to genome...
MOTIVATION: The variation graph toolkit (VG) represents genetic variation as a graph. Although each ...
The variation graph toolkit (VG) represents genetic variation as a graph. Each path in the graph is ...
Motivation: Over the last few years, methods based on suffix arrays using the Burrows–Wheeler Transf...
We are rapidly approaching the point where we have sequenced millions of human genomes. There is a p...
Understanding genomic structural variation such as inversions and translocations is a key challenge ...
Reference genomes guide our interpretation of DNA sequence data. However, conventional linear refere...
Understanding genomic structural variation such as inversions and translocations is a key challenge ...
Background: In [Prezza et al., AMB 2019], a new reference-free and alignment-free framework for the ...
Cox AJ, Bauer MJ, Jakobi T, Rosone G. Large-scale compression of genomic sequence databases with the...
Abstract. With the recent advances in DNA sequencing, it is now possible to have complete genomes of...
DNA sequencing technologies keep getting faster and cheaper leading to massive availability of entir...
In this thesis, I study the problem of genome inference from short-read DNA sequencing data, with th...
Motivation: The Burrows–Wheeler transform (BWT) is the foundation of many algorithms for compression...
We show how positional markers can be used to encode genetic variation within a Burrows-Wheeler Tran...
Abstract We present a generalization of the positional Burrows–Wheeler transform, or PBWT, to genome...
MOTIVATION: The variation graph toolkit (VG) represents genetic variation as a graph. Although each ...
The variation graph toolkit (VG) represents genetic variation as a graph. Each path in the graph is ...
Motivation: Over the last few years, methods based on suffix arrays using the Burrows–Wheeler Transf...
We are rapidly approaching the point where we have sequenced millions of human genomes. There is a p...
Understanding genomic structural variation such as inversions and translocations is a key challenge ...
Reference genomes guide our interpretation of DNA sequence data. However, conventional linear refere...
Understanding genomic structural variation such as inversions and translocations is a key challenge ...
Background: In [Prezza et al., AMB 2019], a new reference-free and alignment-free framework for the ...
Cox AJ, Bauer MJ, Jakobi T, Rosone G. Large-scale compression of genomic sequence databases with the...
Abstract. With the recent advances in DNA sequencing, it is now possible to have complete genomes of...
DNA sequencing technologies keep getting faster and cheaper leading to massive availability of entir...
In this thesis, I study the problem of genome inference from short-read DNA sequencing data, with th...
Motivation: The Burrows–Wheeler transform (BWT) is the foundation of many algorithms for compression...