Re^3: [OT] The interesting problem of comparing bit-strings.

There are better ways to search for a bitstring than just the brute-force one.

Care to expand?

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I'm with torvalds on this

In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked

Comment on Re^3: [OT] The interesting problem of comparing bit-strings.

Replies are listed 'Best First'.
Re^4: [OT] The interesting problem of comparing bit-strings. by salva (Canon) on Mar 27, 2015 at 22:57 UTC
Several (most?) string-search algorithms can be adapted to work on bitstrings. For instance, if your data is mostly random, Boyer-Moore is going to perform quite well and eliminate most of the bitstring comparisons.	[reply]
Re^5: [OT] The interesting problem of comparing bit-strings. by BrowserUk (Patriarch) on Mar 27, 2015 at 23:04 UTC
Betcha can't prove it! (How can you possibly build a frequency table, when bits have no boundaries?) With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday' Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". I'm with torvalds on this In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked	[reply]