Table 2. Algorithm for divide cluster by MCL.

s is the matrix expansion coefficient (default is 2). r is the matrix inflation coefficient (default is 2). k is the column number of M. p is each matrix row index. q is each matrix column index. k₂ is the number of iterations.

Algorithm 2 Divide cluster by MCL
1. Given a target barcode set T, build adjacent matrix M
2. Fork2 iteration:
3. M = Ms
4. $M_{pq}={\left({\Gamma }_{r}M\right)}_{pq}=\frac{{\left(M_{pq}\right)}^r}{{\sum }_{i=1}^k{\left(M_{iq}\right)}^r}$
5. End for
6. extract sub cluster from M