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

Re^7: making presence/absence table from a hash of arrays

by Marshall (Abbot)
on Sep 07, 2011 at 03:45 UTC ( #924519=note: print w/replies, xml ) Need Help??

in reply to Re^6: making presence/absence table from a hash of arrays
in thread making presence/absence table from a hash of arrays

The OP doesn't say that so I assume that you know them personally?
In the level of thread that I directly replied to, the Original Poster says: "I am a PhD genome biologist still getting to grips with the finer details of Perl".

The OP says they have "an array with 5 elements" but you chose to store that in a string and then split it.
Well, I certainly did focus on the OP's description of the output:
one two three four five row_1 = 1 1 0 0 1 row_2 = 0 1 0 1 0 row_3 = 1 0 1 1 1 etc...
It looked to me like there would be line with the column names - I certainly was thinking about a normal CSV type header. If not so what? We are focusing on the wrong detail.

I think we are getting bogged down into small details... You posted an excellent solution as did I. Let's leave it at that.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://924519]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (2)
As of 2017-12-17 03:27 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (462 votes). Check out past polls.