(I'm starting by rephrasing the question, because it makes sense in terms of Coxeter groups. Skip down further for the simple answer for permutations.)
The two moves you describe are called braid moves in Section 3.3 of Björner and Brenti's Combinatorics of Coxeter groups (and this is standard terminology). (However, braid moves are usually defined in terms of the reduced expressions, not the inversion sequence. Furthermore, that section deals, more generally, with Coxeter groups.) Their Theorem 3.3.1(ii) says that any two reduced expressions for $w$ can be related by a sequence of braid moves.
Your question is a bit more subtle, and is equivalent to the following question: Given a reduced expression for $w$ whose reflection sequence is $(\ldots,(i,j),\ldots,(i,k),\ldots,(j,k),\ldots)$ is there also a reduced expression for $w$ whose reflection sequence is $(\ldots,(j,k),\ldots,(i,k),\ldots,(i,j),\ldots)$?
(If the answer to the original question is yes, the one more braid move will provide a positive answer to my rephrasing. If the answer to my rephrasing is yes, then there must have been a step at which a braid move changed $(\ldots,(i,j),(i,k),(j,k),\ldots)$ to $(\ldots,(j,k),(i,k),(i,j),\ldots)$. Just before that step, we have found a positive answer to the original question.
The answer to both questions is undoubtedly "yes" for Coxeter groups in general, although I'm having trouble thinking of a quick proof or reference in the short time I have before I have to get back to work. (I would love it if someone else supplies one.) [UPDATE: There are good reasons I couldn't find a quick proof! See David Speyer's comment and answer below.] But here is a quick proof for the symmetric group:
The fact that the inversion sequence is $(\ldots,(i,j),\ldots,(i,k),\ldots,(j,k),\ldots)$ implies in particular that the one-line notation for the permutation has $\cdots k \cdots j \cdots i \cdots$. A reduced expression amounts to a sequence of swaps of adjacent entries in the permutation, always putting entries into numerical order, ending at the identity permutation. (This corresponds to removing the rightmost letter in the reduced expression at each step.) The given expression exchanges the $j$ and $k$ first, but we need to be able to exchange the $i$ and $j$ first. We can do this as long as we first move away all entries that are between them. This is possible because entries less than $j$ can be moved left of $j$ and entries greater than $i$ can be moved right of $i$.