Show simple item record

Bidirectional Search in a String Using Wavelet Matrix and Burrows Wheeler Transform

dc.contributor.authorBello, Hanatu Bagudu
dc.date.accessioned2022-08-26T11:12:15Z
dc.date.available2022-08-26T11:12:15Z
dc.date.issued2020-08-02
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/123456789/5067
dc.description2019 Computer Science Masters Thesesen_US
dc.description.abstractWavelet tree is a data structure which permits the representation of sequences of symbols over an alphabet of size σ. It recursively partitions a string into two halves until homogeneous data is obtained. An increase in the value of σ has an impact on the wavelet tree’s space utilization. To reduce the wavelet tree’s space utilization pointer-less wavelet tree was invented, although in theory the complexities stay the same in practice it is slower. An alternative representation of the pointer-less wavelet tree is the wavelet matrix. It concatenates the bitmaps level-wise and also retains all the wavelet tree’s features but it is much faster in practice. In this research, we use the wavelet matrix to reconstruct the bidirectional wavelet index. The modification is efficient as our experiment shows that the bidirectional wavelet index constructed using the wavelet matrix decreases the time it takes to execute the queries.en_US
dc.description.sponsorshipAUSTen_US
dc.language.isoenen_US
dc.publisherAUSTen_US
dc.subject2020 Computer Science Masters Thesesen_US
dc.subjectBello Hannatu Baguduen_US
dc.subjectDr. Rajesh Prasaden_US
dc.titleBidirectional Search in a String Using Wavelet Matrix and Burrows Wheeler Transformen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Computer Science98

    This collection contains Computer Science Student's Theses from 2009-2022

Show simple item record