in reply to Re: Performance Tuning: Searching Long-Sequence Permutations
in thread Performance Tuning: Searching Long-Sequence Permutations

An excellent idea. I would add to it by suggesting that you implement a parser for the resulting BLAST report. The BLAST algorithm extends a maximal scoring segment and will pick up substrings that do not perhaps meet minimum length requirements etc. This is where the parser comes in. Set up bioperl (www.bioperl.org) on your system and use Bio::SearchIO for parsing your report for relevant hits.
  • Comment on Re: Re: Performance Tuning: Searching Long-Sequence Permutations

Replies are listed 'Best First'.
Re: Re: Re: Performance Tuning: Searching Long-Sequence Permutations
by Itatsumaki (Friar) on Jun 27, 2003 at 16:08 UTC

    I definitely agree, Bioperl is the best choice for writing parsers for most sequence or alignment formats, such as FASTA, BLAST, ClustalX, etc.

    -Tats