aboutsummaryrefslogtreecommitdiff
path: root/academic/bwa/README
diff options
context:
space:
mode:
Diffstat (limited to 'academic/bwa/README')
-rw-r--r--academic/bwa/README11
1 files changed, 11 insertions, 0 deletions
diff --git a/academic/bwa/README b/academic/bwa/README
new file mode 100644
index 0000000000000..fe07da7e2dfa6
--- /dev/null
+++ b/academic/bwa/README
@@ -0,0 +1,11 @@
+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.
+
+If you use BWA-SW, please cite:
+Li H. and Durbin R. (2010) Fast and accurate long-read alignment with
+Burrows-Wheeler Transform. Bioinformatics, Epub.