We are working on analysis of Bioinformatics tools (related to Kmer counting) and BFCounter is one of them. We have gone through readme file and it is very helpful. As we are doing analysis so we want to be very sure about details. It would be great if you help us validating below details.
Data structure and Sorting Algo: Bloom Filter, Hash table/ Hashing
Approach: In-Memory
The limit of k-size : Arbitrary large k-mer lengths (any ideal length)
Supports online k-mer frequency retrieval : No
Supports compressed file processing : Yes
Hi
We are working on analysis of Bioinformatics tools (related to Kmer counting) and BFCounter is one of them. We have gone through readme file and it is very helpful. As we are doing analysis so we want to be very sure about details. It would be great if you help us validating below details.
Data structure and Sorting Algo: Bloom Filter, Hash table/ Hashing Approach: In-Memory The limit of k-size : Arbitrary large k-mer lengths (any ideal length) Supports online k-mer frequency retrieval : No Supports compressed file processing : Yes
Thanks Tarang