{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE Strict #-}
-- |
-- Module : Data.BWT
-- Copyright : (c) Matthew Mosior 2022
-- License : BSD-style
-- Maintainer : mattm.github@gmail.com
-- Portability : portable
--
-- = Burrows-Wheeler Transform (BWT)
--
-- The two functions that most users will utilize are 'toBWT' and 'fromBWT'.
-- There are auxilary function(s) inside of @"Data.BWT.Internal"@.
--
-- @"Data.BWT.Internal"@ also has the function 'createBWTMatrix', which can be useful as well, although not used by either 'toBWT' or 'fromBWT'.
module Data.BWT where
import Data.BWT.Internal
import Control.Monad()
import Control.Monad.ST as CMST
import Control.Monad.State.Strict()
import Data.Foldable as DFold (toList)
import Data.Sequence as DS
import Data.STRef()
{-toBWT function(s).-}
-- | Takes a String and returns the Burrows-Wheeler Transform (BWT).
-- Implemented via a 'SuffixArray'.
--
-- Works with alphanumeric characters (A-Za-z0-9), as well as special characters `~?!@#%^&*()_+<>';:[]{}/\|"-.,
-- Does __NOT__ work with an input containing the __$__ character.
--
-- Appends the __$__ character to the input automatically.
toBWT :: String -> BWT
toBWT [] = DS.Empty
toBWT xs = do
let saxs = createSuffixArray xseos
saToBWT saxs
xseos
where
xseos = (DS.fromList xs) DS.|> '$'
{--------------------}
{-fromBWT function(s).-}
-- | Takes a BWT data type (please see @"Data.BWT.Internal"@) and inverts it back to the original string.
--
-- This function utilizes the state monad (strict) in order
-- to implement the [Magic](https://www.youtube.com/watch?v=QwSsppKrCj4) Inverse BWT algorithm by backtracking
-- indices starting with the __$__ character.
fromBWT :: BWT -> String
fromBWT bwt = do
let originalp = CMST.runST $ magicInverseBWT magicsz
DFold.toList $ DS.take ((DS.length originalp) - 1)
originalp
where
magicsz = DS.sortBy (\(a,b) (c,d) -> sortTB (a,b) (c,d))
zipped
zipped = DS.zip bwt
(DS.iterateN (DS.length bwt) (+1) 0)
{----------------------}