Mahdi Safarnejad


Fast Algorithms for Edit Distance and Other Similarity Measures

  Halls department, Hall 5
  Wednesday, 26 December 2018
  11:45 - 12:45


String similarity measures are among the most fundamental problems in computer science. The notable examples are edit distance and longest common subsequence. Known extension of these problems like tree edit distance and Ulam distance are also studied extensively. These problems find their applications in various contexts such as computational biology, text processing, compiler optimization, data analysis, image analysis, etc.

In this talk, we present very recent approximation and massively parallel algorithms for edit distance, tree edit distance, longest common subsequence, and Ulam distance.


Mahdi Safarnejad Boroujeni is a Ph.D. student at the Sharif University of Technology. He is supervised by Dr. Mohammad Ghodsi. His Research involves approximation algorithms for edit distance and similar problems. He also received his Bachelor and Master degrees from the Sharif University of Technology in Computer Engineering.