Dr. Atheer Al-Mousa

Dr. Atheer Al-Mousa is currently the Computing Subject Lead and the Cybersecurity Program Leader at De Montfort University-Dubai. Dr. Al-Mousa area of specialisation is Computer Networks and Cybersecurity. In the past, he worked for several universities in the Middle-east, Asia and New Zealand. He started his career at the University of Nottingham as a lecturer. Dr. Al-Mousa has several years of experience working in the higher education sector in the GCC. Dr. Al-Mousa was the Chair of the IT department and the Director of the Center of Excellence for Teaching and Learning at the American University of Iraq-Sulaimani. He also worked as the ITS Director for the American International University in Kuwait. Dr. Al-Mousa other area of research interest is designing algorithms for bioinformatics.

Cybersecurity research group

A. A. Matroud, C. P. Tuffley, M. D. Hendy. An asymmetric alignment algorithm for estimating

ancestor-descendant edit distance for (nested) tandem repeats, 2022, IEEE/ACM Transactions

on Computational Biology and Bioinformatics. DOI: 10.1109/tcbb.2021.3059239.

A. A. Matroud, C. P. Tuffley, M. D. Hendy. NTRFinder: A software tool to find nested tandem

repeats, 2011, Nucleic Acids Research, pp 1–6, doi:10.1093/nar/gkr1070.

A. A. Matroud, C. P. Tuffley, M. D. Hendy. An Algorithm to Solve the Motif Alignment Problem

for Approximate Nested Tandem Repeats in Biological Sequences, 2011, Journal of Computational

Biology, 18, 9, pp 1211–1218. doi:10.1089/cmb.2011.0101. 

A. Abbas, M. Othman, H. Selamat, R. Johari, Large chordal rings for given diameter and

uniqueness property of minima, 2007, ARS COMBINATORIA 82, pp 243–252. 

A. A. Matroud, M. Othman. Boolean Routing On Regular Chordal Ring Network, 2001, Journal

of Institute of Mathematics and Computer Sciences, 12, pp. 55-67.

Atheer A. Matroud Al-Mousa 6

A. A. Matroud. A Routing algorithm for triple loop networks, 2020. ICDIPC2020, IEEE conference

in Turkey.

A. A. Matroud, C. P. Tuffley, M. D. Hendy. A comparison of three heuristic methods for solving

the parsing problem for tandem repeats, 2012, BSB2012, Campo Grande, Brazil.

A. A. Matroud, C. P. Tuffley, M. D. Hendy. An algorithm to solve the motif alignment problem

for approximate nested tandem repeats, 2010, RECOMB-CG 2010, Ottawa, Canada.

A. A. Matroud, A broadcasting algorithm on large chordal ring of degree six networks, 2006, ICCTA,

IEEE Egypt.

A. A. Matroud, An effective routing algorithm for chordal ring of degree six, 2005, PCI2005, Greece.

A. A. Matroud, A new representation of regular chordal ring network, 2002, WEC2002 .pp 43-48,

Malaysia.

A. A. Matroud, Compact routing on high degree chordal ring network, 2002, 4th WICS, pp 499-509,

Saudi.

A. A. Matroud, M. Othman. Boolean routing on ring network, 2001, ICIMU 2nd volume, pp 9-13.

UNITEN, Malaysia.

Computer Science, Cybersecurity, Bioinformatics

PhD in Computing, Massey University, New Zealand

Cyber Threat intelligence and Incident Response
Computer Networks, Mathematicsfor Computing,
Foundation Computer Literacy for Business
Introduction to Computer and IT Application
PHP Programming and MySQL
Algorithms and Data Structures
Interactive Web Design
Computer Networks and Data Communication
Java Programming
IT Systems and Computer Networks
Discrete Mathematics
Algorithmic Problem Solving
Object Oriented Analysis and Design
Compiler and Discrete Mathematics
Computer Organization and Architecture

DAAD Research stay for academics and scientists 2016 fellowship,

ISCB travel fellowship,

RECOMB-CG fellowship,

Al-Khawarizmi Programming Contest Champions.

Bronze Medal in the invention and research exhibition, University Putra Malaysia

Golden Medal in the invention and research exhibition, University Putra Malaysia