Streaming algorithms for edit distance Diptarka
Description: 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
Related Topics
Download Presentation
"Streaming algorithms for edit distance Diptarka" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
slide1. 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:<br>
slide2. 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<br>
slide3. Main question<br>
slide4. Our results<br>
slide6. 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<br>
slide7. Randomized embedding of edit distance → Hamming distance<br>
slide9. 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 … …<br>
slide10. Synchronization<br>
slide11. Computing edit distance<br>
slide12. Streaming algorithm for edit distance<br>
slide14. Dynamic pgming for edit distance<br>
slide15. Diagonals<br>
slide16. Diagonals<br>
slide17. Streaming algorithm (idea)<br>
slide18. Periodicity<br>
slide19. Periodicity<br>
slide20. Multiple diagonals<br>
slide21. We would like to know Limits on randomized embedding of edit distance into Hamming distance?
What is the complexity of our edit distance algorithm?<br>
Charles U., Prague Elazar Goldenberg
The Academic College of Tel Aviv-Yaffo Michal Koucký
Charles U., Prague Joint work with:<br>
slide2. 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<br>
slide3. Main question<br>
slide4. Our results<br>
slide6. 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<br>
slide7. Randomized embedding of edit distance → Hamming distance<br>
slide9. 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 … …<br>
slide10. Synchronization<br>
slide11. Computing edit distance<br>
slide12. Streaming algorithm for edit distance<br>
slide14. Dynamic pgming for edit distance<br>
slide15. Diagonals<br>
slide16. Diagonals<br>
slide17. Streaming algorithm (idea)<br>
slide18. Periodicity<br>
slide19. Periodicity<br>
slide20. Multiple diagonals<br>
slide21. We would like to know Limits on randomized embedding of edit distance into Hamming distance?
What is the complexity of our edit distance algorithm?<br>