Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. A. Apostolico, M.J. Atallah, L.L. Larmore, and S. Mcfaddin, “Efficient Parallel Algorithms for String Editing and Related Problems,” SIAM J. Comput., 19, pp 968–988, 1990.
2. S. Kannan and E. Myers, “An Algorithm for Locating Non-overlapping Regions of Maximum Alignment Score,” Fourth Annual Symposium on Combinatorial Pattern Matching, pp 74–86, 1993.
3. Z.M. Kedem and H. Fuchs, “On finding several shortest paths in certain graphs,” Proc. 18th Allerton Conference on Communication, Control and Computing, pp 677–683, October 1980.
4. G. Landau and J. Schmidt, “An algorithm for Approximate Tandem Repeats,” Fourth Annual Symposium on Combinatorial Pattern Matching, pp 120–133, 1993.
5. V.I. Levenshtein, “Binary codes capable of correcting deletions, insertions and reversals,” Soviet Phys. Dokl., 10, pp707–710, 1966.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献