Re^3: How to count the length of a sequence of alphabets and number of occurence of a particular alphabet in the sequence?by rjt (Curate)
|on Oct 07, 2019 at 18:30 UTC||Need Help??|
These are indeed basic questions, as pointed out by stevieb. There are several ways to output to a file. Your operating system itself can probably do it with output redirection, or from within Perl, the open command can write to files instead of reading. Click on the links in the preceding sentence for more information and examples.
To put the outputs into bins for different string lengths, hashes are an excellent way to do that. I would use a hash of array refs. The perldata page is again another great documentation resource that will introduce you to the required concepts. The basic algorithm in your case would be to do everything you're already doing, but instead of displaying the "A" count and length with say, you would instead store it in a hash. The hash key would be the length, and the hash value would be an array ref.
When it's all over, %bins (which you will of course need to declare before the main loop), has your A counts:
See sort for an explanation of how to sort your data.
Some assembly and individual research required. :-)
use strict; use warnings; omitted for brevity.