Bitstring Density

• Density d of a binary bitstring :

  • the number of 1s bits divided by the total number of bits (1s and 0s)

• Using the TI for a set of bitsrings

  • if d too high Þ similarity is high between the bitstrings Þ too many hits signaled (false positives )
  • if d too low Þ similarity is low between the bitstrings Þ few hits signaled (false negatives )

Previous slide

Next slide

Back to first slide

View graphic version