Swap and mismatch edit distance-Reference-Cited by-同舟云学术

Swap and mismatch edit distance

Published:2006-05 Issue:1 Volume:45 Page:109-120
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Amir Amihood,Eisenberg Estrella,Porat Ely

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-005-1192-8.pdf

Reference14 articles.

1. K. Abrahamson. Generalized string matching.SIAM Journal on Computing, 16(6):1039–1051, 1987.

2. A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching.Information and Computation, 181(1):57–74, 2003.

3. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching withk mismatches. InProc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 794–803, 2000.

4. A. Amir, M. Lewenstein, and E. Porat. Approximate swapped matching.Information Processing Letters, 83(1):33–39, 2002.

5. R. Cole and R. Hariharan. Approximate string matching: a faster simpler algorithm. InProc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 463–472, 1998.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Isometric Words and Edit Distance: Main Notions and New Variations;Cellular Automata and Discrete Complex Systems;2023

2. Isometric Words Based on Swap and Mismatch Distance;Developments in Language Theory;2023

3. Hypercubes and Isometric Words Based on Swap and Mismatch Distance;Descriptional Complexity of Formal Systems;2023

4. Yggdrasil: Privacy-Aware Dual Deduplication in Multi Client Settings;ICC 2021 - IEEE International Conference on Communications;2021-06

5. Study of Isabelle/HOL on Formal Algorithm Analysis and Code Generation;IEEE Access;2021