a typo

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$