Two Efficient Techniques to Find Approximate Overlaps between Sequences

Algorithm 1

Solving AAPSP using a prefix tree.

procedure

 for every read in the input reads do

   for every candidate suffix in do

   end for

end for

end procedure