in reply to Re^2: counting the number of 16384 pattern matches in a large DNA sequence
in thread counting the number of 16384 pattern matches in a large DNA sequence
One of the inputs is a file of 16384 strings given in below example format:
Given a string of 7 fasta characters, you can form 4^7= 16384 unique strings from T, A, G, C. So, his algorithm is checking every possible 7 char fasta string against the mutifasta file (number of lines in the multifasta file is 61913917).
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^4: counting the number of 16384 pattern matches in a large DNA sequence
by aaron_baugher (Curate) on Jun 15, 2012 at 05:27 UTC | |
by BrowserUk (Patriarch) on Jun 15, 2012 at 06:09 UTC | |
by salva (Canon) on Jun 15, 2012 at 07:22 UTC | |
by aaron_baugher (Curate) on Jun 15, 2012 at 16:28 UTC | |
by BrowserUk (Patriarch) on Jun 15, 2012 at 16:37 UTC |
In Section
Seekers of Perl Wisdom