Generalized suffix trees with Ukkonen's algorithm will give you O (n*m) search on finding suffix matches for all fragments, where n is the number of fragments and m is the length of the search path in ...