default search action
Mai Abdulaziz Alzamel
Person information
- affiliation: King's College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Mai Alzamel, Costas S. Iliopoulos, Zara Lim, Marie Moser-Schwaiger:
Pattern Matching in Polyphonic Musical Sequences. AIAI (4) 2024: 139-151 - 2023
- [j13]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani:
Preface: MatBio 2021 Special Section. J. Comput. Biol. 30(2): 117 (2023) - [j12]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts:
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978: 114182 (2023) - [c17]Mai Alzamel, Seba Alhejaili, Fatimah Alhumaidhi, Joud Alismail, Lama Almubarak, Halah Altammami, Costas S. Iliopoulos, Zara Lim:
Advanced Skin Cancer Detection Using Deep Learning. EANN 2023: 267-278 - [c16]Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth:
Local Maximal Equality-Free Periodicities. AIAI Workshops 2023: 359-368 - 2022
- [j11]Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza:
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). Algorithmica 84(3): 565 (2022) - 2021
- [j10]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts:
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. BMC Bioinform. 22(1): 51 (2021) - 2020
- [j9]Christopher Pockrandt, Mai Alzamel, Costas S. Iliopoulos, Knut Reinert:
GenMap: ultra-fast computation of genome mappability. Bioinform. 36(12): 3687-3692 (2020) - [j8]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j7]Mai Alzamel, Costas S. Iliopoulos:
Preface. Inf. Comput. 270 (2020) - [j6]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts:
Efficient Identification of k-Closed Strings. Int. J. Found. Comput. Sci. 31(5): 595-610 (2020) - [j5]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812: 2-12 (2020) - [c15]Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11
2010 – 2019
- 2019
- [j4]Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung:
Off-line and on-line algorithms for closed string factorization. Theor. Comput. Sci. 792: 12-19 (2019) - [c14]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM 2019: 25:1-25:14 - [c13]Miznah Alshammary, Mai Alzamel, Costas S. Iliopoulos, Richard E. Watson, Bruce W. Watson:
A Brief Overview of Dead-Zone Pattern Matching Algorithms. AIAI (Workshops) 2019: 208-218 - [c12]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the Cyclic Regularities of Strings. AIAI (Workshops) 2019: 219-224 - [c11]Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone:
Online Algorithms on Antipowers and Antiperiods. SPIRE 2019: 175-188 - [i6]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR abs/1901.11305 (2019) - [i5]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the cyclic regularities of strings. CoRR abs/1908.01664 (2019) - 2018
- [j3]Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu:
Efficient Computation of Palindromes in Sequences with Uncertainties. Fundam. Informaticae 163(3): 253-266 (2018) - [j2]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29(8): 1311-1329 (2018) - [c10]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) 2018: 168-178 - [c9]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c8]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - [i4]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - 2017
- [c7]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) 2017: 109-121 - [c6]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CSR 2017: 48-61 - [c5]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung:
Efficient Identification of k-Closed Strings. EANN 2017: 583-595 - [c4]Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Efficient Computation of Palindromes in Sequences with Uncertainties. EANN 2017: 620-629 - [c3]Mai Alzamel, Costas S. Iliopoulos:
Recent Advances of Palindromic Factorization. IWOCA 2017: 37-46 - [c2]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA 2017: 343-355 - [i3]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CoRR abs/1703.08931 (2017) - [i2]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. CoRR abs/1705.04022 (2017) - [i1]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to answer a small batch of RMQs or LCA queries in practice. CoRR abs/1705.04589 (2017) - 2016
- [c1]Oluwole I. Ajala, Moudhi Aljamea, Mai Alzamel, Costas S. Iliopoulos:
Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order. IntelliSys (2) 2016: 959-965 - 2014
- [j1]Ghada Al-Hudhud, Mai Abdulaziz Alzamel, Eman Alattas, Areej Al-Wabil:
Using brain signals patterns for biometric identity verification systems. Comput. Hum. Behav. 31: 224-229 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint