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


Clear questions and runnable code get the best and fastest answer
	PerlMonks

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

by salva (Canon)

on Mar 27, 2015 at 22:57 UTC ( [id://1121580]=note: print w/replies, xml )

Need Help??

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

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.

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

Replies are listed 'Best First'.

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]

In Section Seekers of Perl Wisdom

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://1121580]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others chilling in the Monastery: (11)

As of 2024-04-18 10:09 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Today I Learned

Voting Booth^?

No recent polls found