Mai Abdulaziz Alzamel

Orcid: 0000-0002-0862-7452

Affiliations:
  • King's College London, UK


According to our database1, Mai Abdulaziz Alzamel authored at least 29 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Pattern Matching in Polyphonic Musical Sequences.
Proceedings of the Artificial Intelligence Applications and Innovations, 2024

2023
Maximal degenerate palindromes with gaps and mismatches.
Theor. Comput. Sci., November, 2023

Preface: MatBio 2021 Special Section.
J. Comput. Biol., February, 2023

Local Maximal Equality-Free Periodicities.
Proceedings of the Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops, 2023

Advanced Skin Cancer Detection Using Deep Learning.
Proceedings of the Engineering Applications of Neural Networks, 2023

2022
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).
Algorithmica, 2022

2021
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences.
BMC Bioinform., 2021

2020
Faster algorithms for 1-mappability of a sequence.
Theor. Comput. Sci., 2020

Efficient Identification of k-Closed Strings.
Int. J. Found. Comput. Sci., 2020

Preface.
Inf. Comput., 2020

Comparing Degenerate Strings.
Fundam. Informaticae, 2020

GenMap: ultra-fast computation of genome mappability.
Bioinform., 2020

Finding the Anticover of a String.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Off-line and on-line algorithms for closed string factorization.
Theor. Comput. Sci., 2019

Online Algorithms on Antipowers and Antiperiods.
Proceedings of the String Processing and Information Retrieval, 2019

A Brief Overview of Dead-Zone Pattern Matching Algorithms.
Proceedings of the Artificial Intelligence Applications and Innovations, 2019

On the Cyclic Regularities of Strings.
Proceedings of the Artificial Intelligence Applications and Innovations, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Palindromic Decompositions with Gaps and Errors.
Int. J. Found. Comput. Sci., 2018

Efficient Computation of Palindromes in Sequences with Uncertainties.
Fundam. Informaticae, 2018

Degenerate String Comparison and Applications.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Efficient Computation of Sequence Mappability.
Proceedings of the String Processing and Information Retrieval, 2018

How Much Different Are Two Words with Different Shortest Periods.
Proceedings of the Artificial Intelligence Applications and Innovations, 2018

2017
Recent Advances of Palindromic Factorization.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

How to Answer a Small Batch of RMQs or LCA Queries in Practice.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Efficient Computation of Palindromes in Sequences with Uncertainties.
Proceedings of the Engineering Applications of Neural Networks, 2017

Palindromic Decompositions with Gaps and Errors.
Proceedings of the Computer Science - Theory and Applications, 2017

2016
Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order.
Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016, 2016

2014
Using brain signals patterns for biometric identity verification systems.
Comput. Hum. Behav., 2014


  Loading...