Contents

Edit distance.................................................................................................................................................. 2
Cross Reference to Text ................................................................................................................................ 3
Figure ............................................................................................................................................................ 4
Cross Reference to Figure ............................................................................................................................. 5
Equations ...................................................................................................................................................... 6
As discussed in the book (Sinha, 2001) ......................................................................................................... 7
Bibliography .................................................................................................................................................. 7

1|Page
Edit distance
Edit distance has applications in many domains such as bioinformatics, spell checking, plagiarism checking,
query optimization, speech recognition, and data mining. Traditionally, edit distance is computed by
dynamic programming based sequential solution which becomes infeasible for large problems. In this
paper, we introduce NvPD, a novel algorithm for parallel edit distance computation by resolving
dependencies in the conventional dynamic programming based solution. We also establish the
correctness of modified dependencies. NvPD exhibits certain characteristics such as balanced workload
among processors, less synchronization overhead, maximum utilization of resources and it can exploit
spatial locality. It requires min (m,n) steps to complete as compared to diagonal based approach that
completes in max (m,n). Experimental evaluation using variety of random and real life data sets over
shared memory multi-core systems and graphic processing units (GPUs) show that NvPD outperforms
state-of-the-art parallel edit distance algorithms.

2|Page
Cross Reference to Text
This is a cross reference to Edit distance

3|Page
Figure

Figure 1: GCU Logo

4|Page
Cross Reference to Figure
Referring to the Figure 1.

5|Page
Equations

𝐸 = 𝑀𝐶 2
2𝑥
𝑎 = 2𝑥 × 3√𝑦 +
2𝑚

6|Page
As discussed in the book (Sinha, 2001)

Bibliography
Sinha, P. (2001). Computer Fundamentals. Amartsar: Pearson.

7|Page