From a1eff8b7c2bab76daefb1597764da413905457f5 Mon Sep 17 00:00:00 2001 From: Heng Li Date: Tue, 3 Jun 2014 11:26:29 -0400 Subject: [PATCH] a typo --- tex/ropebwt2.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/tex/ropebwt2.tex b/tex/ropebwt2.tex index 467fa2c..1c62a94 100644 --- a/tex/ropebwt2.tex +++ b/tex/ropebwt2.tex @@ -74,7 +74,7 @@ \section{Methods} definition of suffix array and BWT, $B_a$ consists of all the symbols with their next symbol in $T$ being $a$. -The above defines BWT for an order list of strings. We next seek to define BWT +The above defines BWT for an ordered list of strings. We next seek to define BWT for an unordered set of strings $\mathcal{C}$ by imposing an arbitrary sorting order on $\mathcal{C}$. We say list $(P_i)_i$ is in the \emph{reverse lexicographical order} or \emph{RLO}, if $\widetilde{P}_i\le\widetilde{P}_j$