Skip to content

The Wavelet Tree is a succinct data structure to store strings in compressed space. It generalizes the rank query and select query operations defined on bitvectors to arbitrary alphabets.

Notifications You must be signed in to change notification settings

pombredanne/Wavelet-Tree-1

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Wavelet Tree

References

Reference for the (Wavelet Tree).

Reference for the (Node-RRR) of the Wavelet Tree.

Algorithm

Rank query

Reporting the number of occurrences of a given character in a given prefix of the text.

Select query

Reporting the position of a given occurrence of a given character.

Track symbol

Reporting the character of a given position.

Code

import sys
from FileReader import FileReader
from WaveletTree import WaveletTree

file_reader = FileReader(sys.argv)
if (not file_reader.is_read()):
    sys.exit()
wavelet_tree = WaveletTree(file_reader.get_letter())
wavelet_tree.rank_query(character, position)
wavelet_tree.select_query(character, position)
wavelet_tree.track_symbol(position)

About

The Wavelet Tree is a succinct data structure to store strings in compressed space. It generalizes the rank query and select query operations defined on bitvectors to arbitrary alphabets.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%