broadinstitute/catch | Coveralls - Test Coverage History & Statistics

Build # 13

Build Type

push

travis-ci

Committed by

Commit Message

Mention LSH options in README

Run Details

1510 of 1693 branches covered (89.19%)

4621 of 4869 relevant lines covered (94.91%)

0.95 hits per line

4869 RELEVANT LINES 4621 COVERED LINES

0.95 HITS PER LINE

Coverage	∆	File	Lines	Relevant	Covered	Missed	Hits/Line	Branch Hits	Branch Misses

Builds	Branch	Commit	Type	Ran	Committer	Via	Coverage
13	lsh	Mention LSH options in README	push	17 Apr 2018 04:47PM UTC	haydenm	travis-ci	pending completion
12	lsh	Add filter for near-duplicate probes using MinHash This filter is like the one using LSH based on Hamming distance, except this uses a family that constructs MinHash signatures. This commit adds an option to design.py for using this filter. The m...	push	10 Apr 2018 09:22PM UTC	haydenm	travis-ci	pending completion
10	lsh	Add filter for near-duplicate probes based on Hamming distance Like the duplicate filter, this is not necessary, but running it before the set cover filter can significantly lower runtime and reduce memory usage by decreasing the input size (numb...	push	09 Apr 2018 08:51PM UTC	haydenm	travis-ci	pending completion
9	lsh	Add filter for near-duplicate probes based on Hamming distance Like the duplicate filter, this is not necessary, but running it before the set cover filter can significantly lower runtime and reduce memory usage by decreasing the input size (numb...	push	09 Apr 2018 05:59PM UTC	haydenm	travis-ci	pending completion

broadinstitute / catch
95%
master: 94%