Abstract
We consider the problem of designing an efficient index for approximate pattern matching. Despite ongoing efforts, this topic is still a challenge in combinatorial pattern matching. We present a new data structure that allows to report all matches in worst-case time O ( | Σ | m + occ ) , which is linear in the pattern length m and the number of occurrences occ for alphabets of constant size | Σ | . Our index uses O ( n | Σ | log n ) extra space on average and with high probability, where n is the length of the text (indexing) or the number of strings to index (dictionary lookup).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
