Re^3: Finding Neighbours of a String

What exactly do you mean by “also considered as mismatch possibilities?”

Makeshifts last the longest.

Comment on Re^3: Finding Neighbours of a String

Replies are listed 'Best First'.
Re^4: Finding Neighbours of a String by monkfan (Curate) on Mar 01, 2006 at 11:41 UTC
This is one the example: `# Both strings and candidate are always # the same length $str = '[TCG]TTCG[AT]'; $candidate1 = ' T TTCG G'; # I manually aligned this # The number of mismatch of those string would be: 1 # Namely the only last position gives a mismatch, # The first position it is considered a match.` [download] Regards, Edward	[reply] [d/l]

Replies are listed 'Best First'.

Re^4: Finding Neighbours of a String
by monkfan (Curate) on Mar 01, 2006 at 11:41 UTC

# Both strings and candidate are always
# the same length 
 
$str        = '[TCG]TTCG[AT]';
$candidate1 = '  T  TTCG G';   # I manually aligned this 

# The number of mismatch of those string would be: 1
# Namely the only last position gives a mismatch,
# The first position it is considered a match.
[download]

Regards,
Edward

[reply]
[d/l]