search

GuillaumeHolley / BloomFilterTrie

An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
MIT License
43 stars 6 forks source link

fixed traversal #15

Open masakistan opened 6 years ago

masakistan commented 6 years ago

The BFT is traversed differently when inserting versus retrieving kmers resulting in seg faults and false-positive and false negative kmer hits.

This fixes the traversal paths taken and resolves #14.