Local Alignment

In many applications two sequences may not be highly similar as a whole, but many contain regions that are highly similar. The task is to find and extract a pair of regions, one from each of the two given sequences, that exhibit high similarity. This is called the local alignment or local similarity problem and formally is defined below:  
35#35

36#36