Pattern matching with address errors: rearrangement distances A Amir, Y Aumann, G Benson, A Levy, O Lipsky, E Porat, S Skiena, ... Journal of Computer and System Sciences 75 (6), 359-370, 2009 | 58 | 2009 |
Mind the gap A Amir, T Kopelowitz, A Levy, S Pettie, E Porat, BR Shalom Algorithmica, 2019, 2015 | 36* | 2015 |
On the cost of interchange rearrangement in strings A Amir, T Hartman, O Kapah, A Levy, E Porat SIAM Journal on Computing 39 (4), 1444-1461, 2010 | 34 | 2010 |
Distance oracles for vertex-labeled graphs D Hermelin, A Levy, O Weimann, R Yuster Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011 | 27 | 2011 |
Efficient Computations of ℓ1 and ℓ ∞ Rearrangement Distances A Amir, Y Aumann, P Indyk, A Levy, E Porat String Processing and Information Retrieval: 14th International Symposium …, 2007 | 27 | 2007 |
Longest Common Subsequence in k Length Substrings G Benson, A Levy, BR Shalom Similarity Search and Applications: 6th International Conference, SISAP 2013 …, 2013 | 26 | 2013 |
Cycle detection and correction A Amir, E Eisenberg, A Levy, E Porat, N Shapira ACM Transactions on Algorithms (TALG) 9 (1), 1-20, 2012 | 25 | 2012 |
Approximate periodicity A Amir, E Eisenberg, A Levy Information and Computation 241, 215-226, 2015 | 22* | 2015 |
Range lcp A Amir, A Apostolico, GM Landau, A Levy, M Lewenstein, E Porat Journal of Computer and System Sciences 80 (7), 1245-1253, 2014 | 22 | 2014 |
Approximate string matching with address bit errors A Amir, Y Aumann, O Kapah, A Levy, E Porat Theoretical Computer Science 410 (51), 5334-5346, 2009 | 22 | 2009 |
Approximate cover of strings A Amir, A Levy, R Lubin, E Porat Theoretical Computer Science 793, 59-69, 2019 | 21 | 2019 |
Dictionary matching with one gap A Amir, A Levy, E Porat, BR Shalom Combinatorial Pattern Matching: 25th Annual Symposium, CPM 2014, Moscow …, 2014 | 18 | 2014 |
On approximating string selection problems with outliers C Boucher, GM Landau, A Levy, D Pritchard, O Weimann Theoretical Computer Science 498, 107-114, 2013 | 18 | 2013 |
Can we recover the cover? A Amir, A Levy, M Lewenstein, R Lubin, B Porat Algorithmica 81 (7), 2857-2875, 2019 | 17 | 2019 |
Lcsk: a refined similarity measure G Benson, A Levy, S Maimoni, D Noifeld, BR Shalom Theoretical Computer Science 638, 11-26, 2016 | 17 | 2016 |
Dictionary matching with a few gaps A Amir, A Levy, E Porat, BR Shalom Theoretical Computer Science 589, 34-46, 2015 | 14 | 2015 |
Interchange rearrangement: The element-cost model O Kapah, GM Landau, A Levy, N Oz Theoretical Computer Science 410 (43), 4315-4326, 2009 | 13 | 2009 |
String rearrangement metrics: A survey A Amir, A Levy Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the …, 2010 | 10 | 2010 |
Detecting approximate periodic patterns A Amir, A Apostolico, E Eisenberg, GM Landau, A Levy, N Lewenstein Theoretical Computer Science 525, 60-67, 2014 | 8 | 2014 |
The practical efficiency of convolutions in pattern matching algorithms A Amir, A Levy, L Reuveni Fundamenta Informaticae 84 (1), 1-15, 2008 | 8 | 2008 |