Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Finding intersection of many sequences

by grizzley (Chaplain)
on Sep 13, 2012 at 09:49 UTC ( #993440=note: print w/replies, xml ) Need Help??


in reply to Finding intersection of many sequences

You can try following algorithm:

  • 1. compare seq 1 with seq 2 (create intersection 12).
  • 2. compare seq 3 with intersection 12 (create intersection 13).
  • 3. compare seq 4 with intersection 13 (create intersection 14)
  • ...
  • Comment on Re: Finding intersection of many sequences

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://993440]
help
Chatterbox?
[Corion]: The good posts on HN are the non-computing posts. Most of the other stuff is maybe relevant to you if you are 20 and live in Silicon Valley...
[Corion]: Two attributes that don't describe me.
[Corion]: Maybe I should also write a curator for HN or simply not read it anymore, like you do.

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (8)
As of 2017-07-24 13:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (354 votes). Check out past polls.