Question

Hi guys, just wondering about ps3d which requires me to find the total numbers of matches that contains exactly one mistake in its elements.

For example: 'atgc' for 'atgacatgcacaagtatgcat'. The requirement is to find substrings of *tgc, a*gc, at*c, atg* where * can be substituted by any symbols. Am I right?

Answer 1

yep - * can be any single 'character' Except the one from the 'key'

Answer 2

Alright, thanks.