Skip to main content
. 2021 Mar 10;22(6):2815. doi: 10.3390/ijms22062815
Algorithm 1: Carboxylic group (–COOH) search.
  • 1:

    procedure DeleteItem(adjacency matrix A, feature vector f)

  • 2:

        for i in 1 → len(f) do

  • 3:

            if f[i]= ’C’ then

  • 4:

               candidate1←which(A[i,]==1)

  • 5:

               if f[candidate1]== ’O’) then

  • 6:

                   candidate2←which(A[candidate1,]==1)

  • 7:

                   if f[candidate2]== ’H’ then

  • 8:

                       candidate3←which(A[i,]==2)

  • 9:

                       if f[candidate3]== ’H’ then

  • 10:

                           cooh.append(list(i, candidate1, candidate2, candidate3))

  • 11:

        Return cooh