# Special Seminar: Diptarka Chakraborty "Edit Distance: Constant-factor approximation, Embedding and Streaming"

This talk is arranged at the Department of Computer Science and it's open to everyone free-of-charge. The talk will take place at 09:00 (sharp!) in hall AS1, TUAS building. ### Edit Distance: Constant-factor approximation, Embedding and Streaming

Diptarka Chakraborty

Abstract:

Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. This distance measure finds applications in fields such as computational biology, pattern recognition, text processing, and information retrieval. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time, which is also known to be almost optimal under SETH assumption [Backurs, Indyk 2015]. Andoni, Krauthgamer and Onak (2010) gave a nearly linear time (randomized) algorithm that approximates edit distance within poly-log(n) approximation factor. In this talk we discuss a randomized algorithm with running time $\tilde{O}(n^{2-2/7})$ that approximates the edit distance within a constant factor. In the second half of this talk we discuss about a randomized embedding of the edit distance into the Hamming metric. We show a randomized embedding with quadratic distortion. More specifically, for any x,y satisfying that their edit distance equals k, the Hamming distance between the embedding of x and y is O(k^2) with high probability. This is the first randomized embedding having distortion factor independent of the length of the strings. Moreover, the embedding output size is linear in the input size and the embedding can be implemented in one-pass streaming model. Our embedding algorithm has several applications in document exchange, nearest neighbour search etc. and is also basis of a sketch based streaming algorithm for computing edit distance.

Bio:

I am currently a post-doctoral fellow at Weizmann Institute of Science, Israel. I am interested in theoretical computer science; more specifically small space computations, streaming algorithms, string matching algorithms (problems related to edit distance), graph algorithms and data structures. I did my PhD from Department of Computer Science & Engineering, Indian Institute of Technology, Kanpur. After that I spent two years at Charles University, Prague as a post-doctoral fellow and then in September 2018 I moved to Weizmann.

• Published:
• Updated:
Share
URL copied!
{"ft_lang_label":"__label__en","ft_lang_prob":0.90617245,"math_prob":0.9069962,"size":2377,"snap":"2022-40-2023-06","text_gpt3_token_len":472,"char_repetition_ratio":0.13232195,"word_repetition_ratio":0.005899705,"special_character_ratio":0.18426588,"punctuation_ratio":0.10945274,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9732626,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-25T21:33:12Z\",\"WARC-Record-ID\":\"<urn:uuid:bb8ceff9-ca0c-40c9-9bcf-f7380168e5f7>\",\"Content-Length\":\"84043\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:eb525ed5-b340-43ef-923b-4a3eafd13f3a>\",\"WARC-Concurrent-To\":\"<urn:uuid:2ebffff6-3e64-4a44-a312-767f1c964726>\",\"WARC-IP-Address\":\"104.18.15.143\",\"WARC-Target-URI\":\"https://www.aalto.fi/en/events/special-seminar-diptarka-chakraborty-edit-distance-constant-factor-approximation-embedding\",\"WARC-Payload-Digest\":\"sha1:RUAUWL7H2VYA3JSL2ZQQ55LETVSKJCOZ\",\"WARC-Block-Digest\":\"sha1:7KLEM3OMXFULRA7DZL4LHZCNDGRUCOPM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030334596.27_warc_CC-MAIN-20220925193816-20220925223816-00727.warc.gz\"}"}