Mark DePristo fb86887bf2 Fast algorithm for determining which kmers are good in a read ... -- old algorithm was O(kmerSize * readLen) for each read. New algorithm is O(readLen) -- Added real unit tests for the addKmersFromReads to the graph. Using a builder is great because we can create a MockBuilder that captures all of the calls, and then verify that all of the added kmers are the ones we'd expect.		2013-04-11 09:54:22 -04:00
..
src/org/broadinstitute/sting	Fast algorithm for determining which kmers are good in a read	2013-04-11 09:54:22 -04:00
test/org/broadinstitute/sting	Fast algorithm for determining which kmers are good in a read	2013-04-11 09:54:22 -04:00