@InProceedings{sakai_et_al:LIPIcs.ISAAC.2020.6,
author = {Sakai, Yoshifumi and Inenaga, Shunsuke},
title = {{A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.6},
URN = {urn:nbn:de:0030-drops-133508},
doi = {10.4230/LIPIcs.ISAAC.2020.6},
annote = {Keywords: algorithms, dynamic time warping distance, longest increasing subsequence, semi-local sequence comparison}
}