Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
Re^2: count backrefenence regexby tmolosh (Initiate) |
on Oct 11, 2021 at 02:33 UTC ( [id://11137411]=note: print w/replies, xml ) | Need Help?? |
I fully agree with your constructive comments. thanks. this was all supposed to be a quick-and-dirty time test to compare this attempted solution vs my work-around. but obviously dirty it was but not so quick. my apologies for not fully fleshing-out the "problem" that the code is trying to address. like many, I assume everyone else knows what I am thinking and just jump right in where my head is at the moment. in your scenario I would say you have 4 x "AAA_x_" but 2 "BBB" (not "BBB_x_") my thinking is: given a string, e.g., "GATCGGGGACTTAGGATCCGATCT" where (if I typed it right) the string has 2 x "GATC" and 2 "GATCT", find the number of occurrences of each unique substring of length >= some minimum length (I used 3 in my code) that occur more than once. "GATC" occurs 4 times, but twice with the extra "T" so I would call those 2 different substrings. BTW - I was using a 1,000,000 character string to make it take long enough to see a time difference. also, I mis-spoke above, what I ultimately would report is substring and its locations (I figure for that I would use $` from the regex matching). If locations are pushed into an array, and I decide I want the count, I would just use the length of the array.
In Section
Seekers of Perl Wisdom
|
|