# CSC334, Midterm, Fall 2015
# implement BWT
# Name Here
# (a) write a function that returns a list
# of all cyclic permutations of string S,
# starting with S$ and ending with $S
def cyclic_perms(S):
pass
def bwt(S):
# (a) find all cyclic perms pi
# (b) sort permutations to find pi_sorted
# (c) return the BWT (last column)
pass
L = bwt('GTCACA')
print(L)