Improved Candidate Drug Mining for Alzheimer’s Disease

Algorithm 1

Pseudocode for the edit distance used for approximate string matching.

(1) // initialization

(2) for 𝑖←0 to 𝑚 do

(3)  𝐸(𝑖,0)←𝑖

(4) end for

(5) for 𝑗←0 to 𝑛 do

(6)  𝐸(0,𝑗)←0

(7) end for

(8) // edit distance 𝐸(𝑖,𝑗)

(9) for 𝑖←0 to 𝑚 do

(10)  for 𝑗←0 to 𝑛 do

(11)    if(𝑇(𝑗) = 𝑃(𝑖)) then

(12)      𝐸(𝑖,𝑗)←(𝑖−1,𝑗−1)

(13)    else

(14)     min ← MIN[𝐸(𝑖−1,𝑗),𝐸(𝑖,𝑗−1)]

(15)      𝐸(𝑖,𝑗)← min + 1

(16)    end if

(17)  end for

(18) end for

(19) return 𝐸