Streaming algorithms for edit distance Diptarka

Transcript:Streaming algorithms for edit distance Diptarka:
Streaming algorithms for edit distance Diptarka Chakraborty Charles U., Prague Elazar Goldenberg The Academic College of Tel Aviv-Yaffo Michal Koucký Charles U., Prague Joint work with: Edit distance e f w h i k l m a b c z d f g h i j k l m a b c d e Main question Our results Hamming distance e f i j k l m n a b c z d f z i j k l m n a b c d e Randomized embedding of edit distance → Hamming distance Why it works e f g h i k l m a b c z d f g h i j k l m a b c d e z z d d e f l m a a b c c d e e f f f l m a a b c c … … Synchronization Computing edit distance Streaming algorithm for edit distance Dynamic pgming for edit distance Diagonals Diagonals Streaming algorithm (idea) Periodicity Periodicity Multiple diagonals We would like to know Limits on randomized embedding of edit distance into Hamming distance? What is the complexity of our edit distance algorithm?