Help regarding strings

From: "K3" <kjkartik@xxxxxxxxx>
Date: 26 Oct 2006 12:33:43 -0700

I am a newbie to perl, so i wud appreciate if anyone give the code for
finding the number of matches in a given string, allowing atmost m no
of mismatches.

input: short string (len = k)
long string (len =n)
no of mismatches (=m)

output: no of matches allowing m mismatches
cheers
karthik

.

Prev by Date: Re: How to pass string in command line argument.
Next by Date: Changing colour, font and weight of text in a shell
Previous by thread: Analize Java source file with perl?
Next by thread: Changing colour, font and weight of text in a shell
Index(es):
- Date
- Thread

Relevant Pages

Re: How to find all the strings in a long that are at most of n different characters of a test strin
... I want to fine all the substrings in $a, whose length is the same as ... string 'abcdef' and string 'aacdxf' have two mismatches ... my $lenb = length $b; ...
(comp.lang.perl.misc)
Re: Mismatch Positions of Two Ambiguous Strings
... I have two strings that I want to compute the number of mismatches between ... string and 'target' string. ...
(perl.beginners)
Re: Simple question reg string matching
... John Bokma wrote: ... finding the number of matches in a given string, ... no of mismatches ...
(comp.lang.perl.misc)
Re: Simple question reg string matching
... finding the number of matches in a given string, allowing atmost m no ... no of mismatches ... Perl help, tutorials, and examples: http://johnbokma.com/perl/ ...
(comp.lang.perl.misc)
Re: Simple question reg string matching
... finding the number of matches in a given string, allowing atmost m no ... no of mismatches ... pattern 'ab', I can see that there are 3 matches. ...
(comp.lang.perl.misc)