1 / 31

On-line Approximate String Matching with Bounded Errors

isaiah
Download Presentation

On-line Approximate String Matching with Bounded Errors

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. On-line Approximate String Matching with Bounded Errors Marcos Kiwi, Gonzalo Navarro and Claudio Telha Universidad de Chile

    2. Outline

    3. Introduction

    4. Approximate String Matching Problem (ASM) Find the positions where a pattern P appears approximately in a text T

    5. Applications of ASM

    6. State of art in ASM There are algorithms theoretically optimal and simultaneously efficient in practice

    7. Our method

    8. Our proposal: ASM with Bounded Errors Break the average lower bound by allowing an additional factor of error

    12. Break the average lower bound by allowing an additional factor of error

    15. Filter algorithms for ASM usually lead to an ASM-BE algorithm

    16. First, the filtering sub-process discard areas where the pattern cannot appear

    17. Second, the verification sub-process find the matches in non-discarded areas

    21. Filter algorithms for ASM usually lead to an ASM-BE algorithm

    24. We approximate the q-grams counting by using random sampling

    25. Results

    27. Conclusion

    28. What we did? We just scratched the surface of this new area

    29. Open questions

    30. Thank you!

More Related