Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Software
Reference54 articles.
1. Aluru, S., Futamura, N., Mehrotra, K.: Parallel biological sequence comparison using prefix computations. J. Parallel Distrib. Comput. 63(3), 264–272 (2003)
2. Apostolico, A., Atallah, M.J., Larmore, L.L., McFaddin, S.: Efficient parallel algorithms for string editing and related problems. SIAM J. Comput. 19(5), 968–988 (1990)
3. Beernaerts, J., Debever, E., Lenoir, M., De Baets, B., Van de Weghe, N.: A method based on the levenshtein distance metric for the comparison of multiple movement patterns described by matrix sequences of different length. Expert Syst. Appl. 115, 373–385 (2019)
4. Behara, K., Bhaskar, A., Chung, E.: Levenshtein distance for the structural comparison of OD matrices. In: Australasian Transport Research Forum (ATRF), 40th, 2018, Darwin, Northern Territory, Australia (2018)
5. Blelloch, G.E.: Prefix sums and their applications. Tech. rep, Citeseer (1990)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献