Amihood Amir
Affiliations: | 1980 | Bar-Ilan University, Jerusalem, Jerusalem District, Israel |
Google:
"Amihood Amir"Children
Sign in to add trainee| Martin Farach-Colton | grad student | (MathTree) | |
| Gary Benson | grad student | 1992 | University of Maryland (Cell Biology Tree) |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Amir A, Kondratovsky E. (2021) Towards a real time algorithm for parameterized longest common prefix computation Theoretical Computer Science. 852: 132-137 |
| Park SG, Bataa M, Amir A, et al. (2020) Finding patterns and periods in Cartesian tree matching Theoretical Computer Science |
| Amir A, Landau GM, Marcus S, et al. (2020) Two-Dimensional Maximal Repetitions Theoretical Computer Science. 812: 49-61 |
| Amir A, Charalampopoulos P, Pissis SP, et al. (2020) Dynamic and Internal Longest Common Substring Algorithmica. 1-37 |
| Amir A, Levy A, Lubin R, et al. (2019) Approximate cover of strings Theoretical Computer Science. 793: 59-69 |
| Amir A, Levy A, Lewenstein M, et al. (2019) Can We Recover the Cover Algorithmica. 81: 2857-2875 |
| Zhou X, Amir A, Guerra C, et al. (2018) EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology |
| Amir A, Amit M, Landau GM, et al. (2017) Period recovery of strings over the Hamming and edit distances Theoretical Computer Science. 710: 2-18 |
| Amir A, Iliopoulos CS, Radoszewski J. (2017) Two strings at Hamming distance 1 cannot be both quasiperiodic Information Processing Letters. 128: 54-57 |
| Amir A, Paryenty H, Roditty L. (2016) Configurations and Minority in the String Consensus Problem Algorithmica. 74: 1267-1292 |