Efficient synchronization of remote copies of files that have experienced insertions and deletions is an important problem with many applications including data storage, file sharing, online editing, and cloud computing. Suppose that user A is the owner of an original file X, and user B is the owner of an edited file that is obtained from X through a series of insertions and deletions. In our recent work, we developed the first low-complexity two-way protocol between users A and B for synchronizing from a fixed rate of insertions and deletions. In this talk, we report on further results, and in particular we compare the empirical performance of our synchronization protocol with existing methods in practical scenarios.