+7 (495) 987 43 74 ext. 3304
Join us -              
Рус   |   Eng

Authors

CHuvilin K. V.

Degree
Post-Graduate Student, Moscow Institute of Physics and Technology
E-mail
kirill.chuvilin@gmail.com
Location
Moscow
Articles

The efficient algorithm for comparing LaTeX documents

The problem is to construct the differences of LaTeX documents. Each document is represented as a parse tree whose nodes are called tokens. All of the text is splitted into fragments whose boundaries correspond to tokens. The map of the text fragments and the corresponding map of characters is constructed. Tokens, that chars are all deleted, or all inserted, or all not changed, are selected. The map for the trees formed with other tokens is built using Zhang-Shasha algorithm.
Read more...