Research Article
A Practical and Scalable Tool to Find Overlaps between Sequences
Algorithm 1
Constructing the tree after sorting the sequences.
(1) for each string in Group do | (2) ; ; | (3) first character in | (4) while the end of is not reached do | (5) if () then | (6) if c = the character to which is pointing then | (7) ++; ++ | (8) character in | (9) else | (10) Create a new node | (11) = | (12) -1 | (13) | (14) -1 | (15) becomes a branch of | (16) Create = new branch (labeled by ) of | (17) = len | (18) break | (19) end if | (20) else | (21) if there is a branch for the , labeled by then | (22) | (23) ; ++ | (24) character in | (25) add to | (26) else | (27) Create a new branch for , labeled by | (28) break | (29) end if | (30) end if | (31) end while | (32) end for |
|