Skip to content

sorokod/Burrows-Wheeler-transform

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

A Burrows–Wheeler transform implementation

This is a Java implementation of BWT. The implementation follows the description given in this video. The encoding and decoding logic requires an EOF character which must be the last character in the input for encoding such that it's value is less then all other characters in the input. The "minimal" character \u0000 is a good choice. Alternatively, the $ character can be used for testing as it has a low numeric value and is easily recognizable, e.g: abaaba$ encodes to abba$aa

Comments

  • The implementation is using the suffix aray approach for encoding
  • Thread safe (Encoder and Decoder are stateless)
  • Reasonably efficient
  • The tests in test/ directory demonstrate the basic usage

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages