diff options
| author | Petar Petrov <slackalaxy@gmail.com> | 2016-11-26 21:19:25 +0000 |
|---|---|---|
| committer | Willy Sudiarto Raharjo <willysr@slackbuilds.org> | 2016-12-03 07:17:45 +0700 |
| commit | 8d79c453ce84a7b17a6c78f14cd474bb3b23d5eb (patch) | |
| tree | 5bd0e686add7bcfef23ed52e373115e4b334a578 /academic/bwa/README | |
| parent | e3ea54d6f0b05cf4c859d53cc2ab1e095672a20d (diff) | |
| download | slackbuilds-8d79c453ce84a7b17a6c78f14cd474bb3b23d5eb.tar.gz | |
academic/bwa: Updated for version 0.7.15.
Signed-off-by: David Spencer <idlemoor@slackbuilds.org>
Diffstat (limited to 'academic/bwa/README')
| -rw-r--r-- | academic/bwa/README | 16 |
1 files changed, 10 insertions, 6 deletions
diff --git a/academic/bwa/README b/academic/bwa/README index fe07da7e2d..a77a28a8e4 100644 --- a/academic/bwa/README +++ b/academic/bwa/README @@ -1,10 +1,14 @@ Burrows-Wheeler Aligner (BWA) is an efficient program that aligns -relatively short nucleotide sequences against a long reference -sequence such as the human genome. It implements two algorithms, bwa- -short and BWA-SW. The former works for query sequences shorter than -200bp and the latter for longer sequences up to around 100kbp. Both -algorithms do gapped alignment. They are usually more accurate and -faster on queries with low error rates. +relatively short nucleotide sequences against a long reference sequence +such as the human genome. It implements two algorithms, bwa-short and +BWA-SW. The former works for query sequences shorter than 200bp and the +latter for longer sequences up to around 100kbp. Both algorithms do +gapped alignment. They are usually more accurate and faster on queries +with low error rates. + +A configuration file ("_aptx_configuration_file") will be used if it is +in your $HOME. An example configuration file is available in +/usr/share/archeopteryx. If you use BWA-SW, please cite: Li H. and Durbin R. (2010) Fast and accurate long-read alignment with |