Currently, I am a Lecturer (Assistant Professor) in the Department of Computer Science, King Saud University. Recently, I have obtained my PhD in Computer Science from Department of Computer Science, King’s College London (KCL), UK. During my career, I was appointed as Postdoctoral Research Fellow (2020-2021) at the Department of Computer Science, University College of London (UCL), UK. Furthermore, I am certified as Associate Fellow from the Higher Education Academy, UK. Also, I served as a Guest Editor of the Information and Computation Journal based on the Massachusetts Institute of Technology, (MIT). Currently, I am a member of the Editorial Board of Computational Biology and Aims Medical Science Journals, USA. My research interests are in Algorithm and Data Analysis with special emphasise on investigating theoretical and practical aspects including algorithmic design and optimization and exploring applications in business and healthcare.
Algorithms and Computational Optimization
Explainable Artificial Intelligence
Data Structure
Efficient Big Data Processing
Data Science/Analytics
Oct 2021 - Present. Lecturer (Assistant Professor). Computer Science Department. King Saud University (KSA).
July 2020 - July 2021. Research Fellow. Artificial Intelligence of COVID-19 Surveillance and Analysis Project. University College London (UK).
Nov 2017 - Mar 2020. Teaching Assistant. Department of Informatics. King’s College London (UK).
July 2012 - Oct 2015. Teaching Assistant. Department of Computer Science . King Saud University (KSA).
2021. PhD in Computer Science, King's College London, UK.
2011. MSc in Advanced Computer Science, University of Sheffield, UK.
2008. BSc in Information Technology, King Saud University, KSA.
2019 - Present. Associate Fellow of the Higher Education Academy.
2018. A Best Paper Award at SPIRE 2018: 25th International Symposium on String Processing and Information Retrieval.
2016 - 2021. Outstanding Research Award of PhD Stage, Embassy of Saudi Arabia, London.
2018 - Present. Steering committee. The International Student Conference on Mathematical Foundations in Bioinformatics. MatBio
2018. Co-chair. London Stringology Day and London Algorithmic Workshop. LSD & LAW 2018
2017. Co-chair. Mathematical-Foundations-in-Bioinformatics. Matbio 2017 .
2017. Organising Committee. 16th International Symposium on Experimental Algorithms. SEA 2017.
2017. Organising Committee. London Stringology Day and London Algorithmic Workshop. LSD & LAW 2017.
2016. Scientific Committee. StringMasters Palermo London. StringMasters .
2016. Organising Committee. The International Student Conference on Mathematical Foundations in Bioinformatics. MatBio 2016
2017 - Present. Student Member. Centre for Combinatorics on Words & Applications. CCWA Murdoch University, Perth, Australia.
2021. Guest Editor of a special issue for Computational Biology .
2020. Guest Editor of a special issue for Algorithmica .
2019. Guest Editor of a special issue for Information and Computation .
2017. Guest Editor of a special issue for AIMS Medical Science Journal .
2021. Fundamenta Informaticae Journal.
2019. Information Processing Letters Journal.
2019. International Workshop on Combinatorial Algorithms.
2017. 16th International Symposium on Experimental Algorithms.
Aug 2018. The Workshop on Algorithms in Bioinformatics (WABI). Helsinki. Finland.
Mar 2018. Loughborough University. Loughborough. UK.
Feb 2018. Freie University Berlin. Berlin. Germany.
Aug 2017. Mining Humanistic Data Workshop (MHDW). Athens. Greece.
July 2017. University of Melbourne. Melbourne. Australia.
July 2017. An invited speaker at the 28th International Workshop on Combinatorial Algorithms (IWOCA). Newcastle. Australia.
Feb 2017. Workshop Data Structures in Bioinformatics (DSB). Amsterdam. Netherland.
Feb 2017. London Stringology Day and London Algorithmic Workshop (CNR). Palermo. Italy.
Nov 2016. National University of Singapore. Singapore.
Sept 2016. Aristotle University of Thessaloniki. Thessaloniki. Greece.
Fall 2021. Computer Security.
Fall 2021. Theory of Computation.
Fall 2015, Spring 2014 and Fall 2013. Java Programming language.
Spring 2013. Computer Networks.
Fall 2018. Programming Practice and Applications.
Fall 2018. Computer Vision.
Spring 2017 and Spring 2020. Data Structures.
Fall 2017. Computer Systems I.
H. Alamro, M. Alzamel, C. S. Iliopoulos, S. P. Pissis, S. Watts, “ IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences”, BMC Bioinform. Vol. 22, No. 1, pp. 51, 2021. [doi]
H. Alamro, M. Alzamel, C. S. Iliopoulos, S. P. Pissis, S. Watts, W. Sung, “EEfficient Identification of k-Closed Strings", International Journal of Foundations of Computer Science, Vol. 31, No. 05, pp. 595-610, 2020. [doi]
C. Pockrandt, M. Alzamel, C. Iliopoulos and K. Reinert, "GenMap: Ultra-fast Computation of Genome Mappability", Bioinformatics, Vol. 36, No. 12, pp. 3687–3692, 2020. [doi]
M. Alzamel, L. A. K. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos, N. Pisanti, S. P. Pissis, G. Rosone, “Comparing degenerate strings”, Fundam. Informaticae, Vol. 175, No. 1-4, pp. 41-58,2020. [doi]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, W. Sung, "Faster Algorithms for 1-Mappability of a Sequence", Theoretical Computer Science, Vol. 812, No. 1, pp. 2-12, 2020. [doi]
M. Alzamel, C. S. Iliopoulos, W. F. Smyth, W. Sung, "Off-line and On-Line Algorithms for Closed String Factorization", Theoretical Computer Science, Vol. 792, No. 1, pp. 12-19, 2019. [doi]
M. Alzamel, J. Gao, C. S. Iliopoulos, C. Liu, "Efficient Computation of Palindromes in Sequences with Uncertainties", Fundamenta Informaticae, Vol. 163, No. 3, pp. 253-266, 2018. [doi]
M. Adamczyk, M. Alzamel, P. Charalampopoulos, J. Radoszewski, "Palindromic decompositions with gaps and errors", International Journal of Foundations of Computer Science, Vol. 29, No. 08, pp. 1311-1329, 2018. [doi]
G. Al-Hudhud, M. Alzamel, E. Alattas, A. Alwabil: "Using brain signals patterns for biometric identity verification systems". Computers in Human Behavior ,Vol., No.1, 31, pp. 224-229, 2014. [doi]
M. Alzamel, A. Conte, S. Denzumi, R. Grossi, C. Iliopoulos, K. Kurita, K. Wasa, "Finding the Anticover of a String", The 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), Inge Li Gørtz and Oren Weimann Eds., Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 2:1-2:11. [doi]
M. Alzamel, A. Conte, D. Greco, V. Guerrini, C. Iliopoulos, N. Pisanti, N. Prezza, G. Punzi and G. Rosone, "Online Algorithms on Antipowers and Antiperiods", The 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), Nieves R. BrisaboaSimon J. Puglisi, Eds., Cham: Springer International Publishing, pp. 175-188. [doi]
M. Alzamel, M. Crochemore, C. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, J. Straszynski, T. Walen, W. Zuba, "Quasi-Linear-Time Algorithm for Longest Common Circular Factor", The 30st Annual Symposium on Combinatorial Pattern Matching (CPM 2019), Nadia Pisanti and Solon P. Pissis Eds., Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 25:1-25:14. [doi]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, J. Straszynski, "Efficient Computation of Sequence Mappability", The 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018), G. Travis et al., Eds., Cham: Springer International Publishing, pp. 12-–26. [doi] Best Paper
M. Alzamel, L. A. K. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos, N. Pisanti, S. P. Pissis, G. Rosone, "Degenerate String Comparison and Applications", The 18th International Workshop on Algorithms in Bioinformatics (WABI 2018), L. Parida, E. Ukkonen, Eds., Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 21:1–-21:14. [doi]
M. Alzamel, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, J. Radoszewski, W. Rytter, T. Waleń, "How Much Different Are Two Words with Different Shortest Periods", Artificial Intelligence Applications and Innovations (AIAI 2018), L. Iliadis, I. Maglogiannis, V. Plagianakos, Eds., Cham: Springer International Publishing, pp. 168–-178. [doi]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, W. Sung, "Faster Algorithms for 1-Mappability of a Sequence", The 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), X.Gao, H.Du, M.Han, Eds., Cham: Springer International Publishing, pp. 109–121. [doi]
M. Alzamel, J. Gao, C. S. Iliopoulos, C. Liu, S. P. Pissis, "Efficient Computation of Palindromes in Sequences with Uncertainties", 18th Engineering Applications of Neural Networks (EANN 2017), G. Boracchi et al., Eds., Cham: Springer International Publishing, pp. 620–629. [doi]
H. Alamro, M. Alzamel, C. S. Iliopoulos, S. P. Pissis, S. Watts, W. Sung, "Efficient Identification of k-Closed Strings", The 18th Engineering Applications of Neural Networks 2017, (EANN 2017), G. Boracchi et al., Eds., Cham: Springer International Publishing, pp. 583–595. [doi]
M. Alzamel and C. S. Iliopoulos, "Recent Advances of Palindromic Factorization", The 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), L. Brankovic, J. Ryan, W. F. Smyth, Eds., Cham: Springer International Publishing, pp. 37-46. [doi]
M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, "How to Answer a Small Batch of RMQs or LCA Queries in Practice", The 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), L. Brankovic, J. Ryan, W. F. Smyth, Eds., Cham: Springer International Publishing, pp. 343–355. [doi]
M. Adamczyk, M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, J. Radoszewski: "Palindromic decompositions with gaps and errors." The 12th International Computer Science Symposium in Russia (CSR 2017), W. Pascal, Eds., Cham: Springer International Publishing, pp. 48-61. [doi]