Author:
Kapah Oren,Landau Gad M.,Levy Avivit,Oz Nitsan
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, U. Vishne, Pattern matching with address errors: Rearrangement distances, in: Proc. of the 17th annual ACM–SIAM Symposium on Discrete Algorithm, SODA, 2006, pp. 1221–1229
2. A. Amir, Y. Aumann, P. Indyk, A. Levy, E. Porat, Efficient computations of l1 and l∞, in: Proc. of the 14th International Symposium on String Processing and Information Retrieval, SPIRE, 2007, pp. 39–49
3. A. Amir, Y. Aumann, O. Kapah, A. Levy, E. Porat, Approximate string matching with address bit errors, in: Proc. of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM, 2008, pp. 118–130
4. A. Amir, T. Hartman, O. Kapah, A. Levy, E. Porat, On the cost of interchange rearrangement in strings in: Proc. of the 15th Annual European Symposium on Algorithms, ESA, 2007, pp. 99–110
5. S. Angelov, K. Kunal, A. McGregor, Sorting and selection with random costs, in: Proc. of the 8th Latin American Theoretical Informatics, LATIN, 2008
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献