From 5f6b41505bb1d2afe8e07aef0461eae06e04c81a Mon Sep 17 00:00:00 2001 From: Jasper Edbrooke Date: Tue, 27 Jul 2021 22:49:13 -0700 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 86f2636..d27cc69 100644 --- a/README.md +++ b/README.md @@ -1,7 +1,7 @@ # CUDA accelerated burrows-wheeler transform The burrows wheeler transform is an algorithm commonly used in bioinformatics and data compression applications. It involves sorting large amounts of data, which generally doesn't paralellize well. -However, using bitonic sort, which generally has a runtime of **O(*n* log2(*n*))** if not parallelized, worse than traditional **O(*n* log(*n*))** algos. However, it can be greatly parallelized. +We can bitonic sort, which generally has a runtime of **O(*n* log2(*n*))** if not parallelized, worse than traditional **O(*n* log(*n*))** algos, but it can be greatly parallelized. ## Implementation Requires CUDA and c++11