Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Re: BioInformatics - polyA tail search

by Arbogast (Monk)
on Sep 03, 2003 at 00:59 UTC ( #288475=note: print w/replies, xml ) Need Help??


in reply to Re: BioInformatics - polyA tail search
in thread BioInformatics - polyA tail search

I wrote a simple program for something similar once. Seemed like you needed to account for inexact matches, if it was a real world and not an academic problem.

You might want to look at the CPAN module String::Approx. It aint a speed demon, but it seemed to work.

http://search.cpan.org/author/JHI/String-Approx-3.20/Approx.pm

Please forgive if I am wrong, I know a little Perl and even less Genetics.
  • Comment on Re: Re: BioInformatics - polyA tail search

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://288475]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (5)
As of 2020-05-29 01:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    If programming languages were movie genres, Perl would be:















    Results (166 votes). Check out past polls.

    Notices?