Two Efficient Techniques to Find Approximate Overlaps between Sequences

Algorithm 2

Solving AAPSP using a prefix tree.

 procedure  ,  ,

    ,

  while true do

     if the end of is reached then

        Report all reads which have a prefix that matches

        Return

     end if

     if    then

        if then

        end if

        if   then

           Return

        end if

         next character in

         next character in the current read

     else

        for Every character in Alphabet do

           if   then

           end if

           if and

                   then

            the character next to in

            the character next to current_char in the

                 current read

           ,

              )

           end if

        end for

        Return

     end if

  end while

 end procedure