Thanks for the advice, I want to code it myself mostly for the learning experience (I haven't written a hash table before). But that link will be really helpful.
Hi,
I'm hoping to implement a genomic DNA hash-table and I unsure how to handle N bases?
Should I skip the k-mers that contain them? or generate the possible sequences up to a limit of X N's per k-mer?
EDIT:
I'm hoping to use the hash table to find perfect k-mer matches within the human genome (I'm aiming for a k-mer size of 10-12 nucleotides). My query sequences won't have ambiguous bases so I'm not too worried about dealing with those. I assume the best strategy is to just skip sequences that have N's.
Thanks
2 answers
Thanks for the answer, I updated my question with a bit more information regarding my goals.
Thanks for the answer, I updated my question with a bit more information regarding my goals. Oh PS. I really enjoyed your blog article on bloom filters :).
Strictly speaking, bowtie treats an ambiguous base as a random base in mapping. It corrects for that afterwards, but this is different from building the ambiguity in the index.
@lh3, aye, but that's in the reference. at least according to the docs:"Ambiguous characters in the read mismatch all other characters."
Log in to answer this question.