Skip to main content
. Author manuscript; available in PMC: 2010 Sep 20.
Published in final edited form as: Int J HR. 2009;6(3):337–359. doi: 10.1142/S0219843609001863

Fig. 1.

Fig. 1

Searching for all common substrings of a pair of input strings B(i*) and B(i), i ≠ i*. (a)–(c): common substrings are indentified while string B(i) is shifts along B(i*). Each of these common substrings are candidate segments. Any substrings of a candidate segment is also a candidate segment. For the sake of simplicity, they are not shown in this figure.