Hi all, Could someone plz help me out about how a finite state automaton would be useful in finding a common substring in two different strings where this substring can be present anywhere in each of the strings...
Actually we are dealing with a project on dna pattern matching which requires two strings to have a common pattern.
Any suggestion could be helpful..please...