Algorithm 1: The procedure of FLAT
1:	Input: two sequences with length ${\mathit{Seq}}_1$ and ${\mathit{Seq}}_2$.
2:	Output: LCCS between Seq1 and Seq2
3:	Set the parameters: fragment length $L_f$, search agent size $N$, and number of iterations$T$
4:	Initialize a random population where each agent marks two positions, one in each sequence, in the range (1, length (${\mathit{Seq}}_1$ or ${\mathit{Seq}}_2$)$-L_f$)
5:	While$T$ hasn’t been reached yet
6:	Apply the SW algorithm to every two fragments pointed out by each agent.
7:	Evaluate solutions using Eq. (1)
8:	Move positions of search agents using the update procedure of applied optimizer toward the location of fragments where LCCS is found.
9:	End While