Entering edit mode
7.3 years ago
ghostforever.shi
▴
50
Hi, everyone. I am working on the paper "Fast and accurate short read alignment with Burrows–Wheeler transform" these days and have few questions on how BWA reducing the memory. There is a saying said, "Given a genome of size n, the occurrence array O(·,·) requires 4n[log2 n] bits as each integer takes [log2 n] bits and there are 4n of them in the array." And I wonder why each integer takes log2n bits here and why there are 4n of them in the array? Does the 4 here mean there are 4 kind of bases(ATCG)?
