View on GitHub

Beetl

BEETL: Burrows-Wheeler Extended Tool Library

Download this project as a .zip file Download this project as a tar.gz file

BEETL: Burrows-Wheeler Extended Tool Library

BEETL is a suite of applications for building and manipulating the Burrows-Wheeler Transform (BWT) of collections of DNA sequences. The algorithms employed in BEETL are intended to scale to collections of sequences containing one billion entries or more.

The initial release implemented two flavours of an algorithm for building the BWT of a sequence collection - BCR and BCRext.

Subsequent releases are adding functionality for efficient inversion and querying of BWTs.

Questions and queries can be sent to the BEETL mailing list

Release History

Version 1.0.0 (29th August 2014)

Version 0.10.0 (17th June 2014)

Version 0.9.0 (9th December 2013)

Version 0.8.0 (29th October 2013)

Version 0.7.0 (18th September 2013)

Version 0.6.0 (27th August 2013)

Version 0.5.0 (10th June 2013)

Faster metaBEETL

Version 0.4.0 (10th April 2013)

Robustness improvements

Version 0.3.0 (7th April 2013)

Metagenomics metaBEETL code added to main tree

Version 0.2.0 (19th March 2013)

Version 0.1.0 (28th February 2013)

Version 0.0.2 (25th June 2012)

Code to build SAP array, as described in this paper.

Version 0.0.1 (18th November 2011)

This contains initial implementations of the BCR and BCRext algorithms as described in our CPM paper.

Contributors to BEETL, past and present

BEETL-ography: papers about BEETL

  • Adaptive reference-free compression of sequence quality scores
  • Lilian Janin, Giovanna Rosone, Anthony J. Cox
  • Bioinformatics, in press (2013)
  • Link to paper
  • Link to preprint
  • Lightweight algorithms for constructing and inverting the BWT of string collections
  • Markus J Bauer, Anthony J Cox, Giovanna Rosone
  • Theoretical Computer Science, Volume 483, 29 April 2013, Pages 134-148, ISSN 0304-3975
  • Link to paper
  • metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences
  • Christina Ander, Ole B Schulz-Trieglaff, Jens Stoye and Anthony J Cox
  • BMC Bioinformatics 2013, 14(Suppl 5):S2
  • Link to paper
  • Lightweight LCP construction for next-generation sequencing datasets
  • Markus J Bauer, Anthony J Cox, Giovanna Rosone, Marinella Sciortino
  • In Algorithms in Bioinformatics (Lecture Notes in Computer Science 7534). Springer Berlin Heidelberg, 2012. 326-337.
  • Link to paper
  • Link to preprint
  • Comparing DNA sequence collections by direct comparison of compressed text indexes
  • Anthony J. Cox, Tobias Jakobi, Giovanna Rosone, Ole B. Schulz-Trieglaff
  • In Algorithms in Bioinformatics (Lecture Notes in Computer Science 7534). Springer Berlin Heidelberg, 2012. 214-224.
  • Link to paper
  • Link to preprint
  • Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform
  • Anthony J. Cox, Markus J. Bauer, Tobias Jakobi, Giovanna Rosone
  • Bioinformatics (2012) 28 (11): 1415-1419.
  • Link to paper
  • Link to preprint
  • Lightweight BWT construction for very large string collections
  • Markus J Bauer, Anthony J Cox, Giovanna Rosone
  • In Combinatorial Pattern Matching (Lecture Notes in Computer Science 6661). Springer Berlin Heidelberg, 2011. 219-231.
  • Link to paper