• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

broadinstitute / catch / 12 / 1
95%
master: 94%

Build:
Build:
LAST BUILD BRANCH: v1.5.1
DEFAULT BRANCH: master
Ran 10 Apr 2018 09:22PM UTC
Files 58
Run time 2s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

10 Apr 2018 08:58PM UTC coverage: 94.907% (+0.1%) from 94.766%
12.1

push

travis-ci

haydenm
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 main advantage of this filter compared to
the Hamming distance filter is that it can be more sensitive in detecting
near-duplicate probes (e.g., ones that are shifted relative to each other). The
main downside is that the distance threshold is based on Jaccard distance and
it is less intuitive to understand how these values translate to probe
hybridization compared to Hamming distance.

1510 of 1693 branches covered (89.19%)

4621 of 4869 relevant lines covered (94.91%)

0.95 hits per line

Source Files on job 12.1
  • Tree
  • List 0
  • Changed 5
  • Source Changed 5
  • Coverage Changed 4
Coverage ∆ File Lines Relevant Covered Missed Hits/Line Branch Hits Branch Misses
  • Back to Build 1
  • Travis Job 12.1
  • 9e94309e on github
  • Prev Job for on lsh (#10.1)
  • Next Job for on lsh (#13.1)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc