Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
You wrote that:
The way my program runs, is that, while it reads in the file, for every new residue it reads in, it iterates through the list currently in memory (avoiding residues in the same chain of course) to look for new interactions A lowly novice takes a brave step in offering advice... Not as a Perl guru (haven't been writing it long enough to qualify for that lofty title... just as someone who works with clinical data a bit, and learned Perl while doing it... One thing that instantly popped into my mind was to consider using associative arrays, rather than having to 'iterate through a list in memory'. Since you have a large set of potential, non-sequential items to compare, you can save a great deal of time by not having to bother searching through a list, and just index the associative array by the residue types. Maybe set up the residue array, and just concatenate new residue interactions as you come across them, then write when you're done in one fell swoop? I can't offer anything else off the top of my head... code sample would definately help, though. Trek In reply to Re: Iteration speed
by TrekNoid
|
|