Abstract
We propose ESP-index, a self-index based on edit-sensitive parsing. Given a string S, ESP tree is equivalent to a CFG deriving just S, which can be represented as a restricted DAG G. Finding pattern P in S is reduced to embedding the parsing tree of P into G. Adopting several succinct data structures, G is decomposed into two bit strings and a single array, requiring ([email protected])nlogn+4n+o(n) bits of space, where n is the number of variables of G and 0<@e<1. The counting time for the occurrences of P in S is in O((1/@e)(mlogn+occclogmlogu)log^@?u), where m=|P|, u=|S|, and occc is the number of the occurrences of a maximal common subtree in ESP trees of P and S. With the additional array of nlogu bits of space, our index supports the locating and extracting. Locating time is the same as counting time and extracting time for any substring of length m is O((1/@e)(m+logu)).
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.
