Hi guys,
I basically have 2 arrays(populated from input file) and all i have to do is, search the values from one array and see if it is there in the other and record the no of occurrences as well. my main query array has 375 values and my other search array has 73372 values. so the number of searches totally will be 27514500 on the worst case and it taking ages to finish running the program. I do have to also include more functions to this script and im afraid how long that is going to take more. Please advice me why my program is so slow and any other alternative ideas that i could use.
sample values of @gl
CD9
TBN
NANOG
KITL
FUT4
SALL4
MYC
STAT3
ESRRB
AKP2
SOX2
POU5F1
KLF4
sample of @hfr_genes
LYPLA1
LYPLA1
LYPLA1
LYPLA1
LYPLA1
LYPLA1
LYPLA1
LYPLA1
LYPLA1
LYPLA1
my code:
do
{
if( my$index_gl=grep{$hfr_genes[$_]=~/^$gl[$index]$/}0..$#hfr_gene
+s)
{
print TEST "Val $gl[$index] is present $index_gl times\n";
$index++;
}
else
{
$index++;
}
}
until ($index==(scalar(@hfr_genes)));
please help! thanks
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.