Finding patterns with variable length gaps or don’t cares MS Rahman, CS Iliopoulos, I Lee, M Mohamed, WF Smyth International Computing and Combinatorics Conference, 146-155, 2006 | 49 | 2006 |

String regularities with don't cares CS Iliopoulos, M Mohamed, L Mouchard, KG Perdikuri, WF Smyth, ... | 45 | 2002 |

A pattern extraction algorithm for abstract melodic representations that allow partial overlapping of intervallic categories E Cambouropoulos, M Crochemore, CS Iliopoulos, M Mohamed, ... | 28 | 2005 |

New complexity results for the *k*-covers problemCS Iliopoulos, M Mohamed, WF Smyth Information Sciences 181 (12), 2571-2575, 2011 | 16* | 2011 |

Computing the minimum k-cover of a string R Cole, CS Iliopoulos, M Mohamed, WF Smyth, L Yang | 16 | 2003 |

The complexity of the minimum k-cover problem R Cole, CS Ilopoulos, M Mohamed, WF Smyth, L Yang Journal of Automata, Languages and Combinatorics 10 (5-6), 641-653, 2005 | 15 | 2005 |

Linear-time superbubble identification algorithm for genome assembly L Brankovic, CS Iliopoulos, R Kundu, M Mohamed, SP Pissis, F Vayani Theoretical Computer Science 609, 374-383, 2016 | 14 | 2016 |

Longest repeats with a block of k don’t cares M Crochemore, CS Iliopoulos, M Mohamed, MF Sagot Theoretical Computer Science 362 (1-3), 248-254, 2006 | 14 | 2006 |

On avoided words, absent words, and their application to biological sequence analysis Y Almirantis, P Charalampopoulos, J Gao, CS Iliopoulos, M Mohamed, ... Algorithms for Molecular Biology 12 (1), 5, 2017 | 13 | 2017 |

All maximal-pairs in step–leap representation of melodic sequence E Cambouropoulos, M Crochemore, CS Iliopoulos, M Mohamed, ... Information Sciences 177 (9), 1954-1962, 2007 | 12 | 2007 |

Longest repeats with a block of don’t cares M Crochemore, CS Iliopoulos, M Mohamed, MF Sagot Latin American Symposium on Theoretical Informatics, 271-278, 2004 | 9 | 2004 |

Linear algorithm for conservative degenerate pattern matching M Crochemore, CS Iliopoulos, R Kundu, M Mohamed, F Vayani Engineering Applications of Artificial Intelligence 51, 109-114, 2016 | 7 | 2016 |

Necklace swap problem for rhythmic similarity measures YJP Ardila, R Clifford, M Mohamed International Symposium on String Processing and Information Retrieval, 234-245, 2005 | 7 | 2005 |

Efficient (delta, gamma)-matching with don’t cares YJ Pinzon-Ardila, M Christodoulakis, CS Iliopoulos, M Mohamed Proc. 16th Australasian Workshop on Combinatorial Algorithms, 27-38, 2005 | 7 | 2005 |

Longest unbordered factor in quasilinear time T Kociumaka, R Kundu, M Mohamed, SP Pissis arXiv preprint arXiv:1805.09924, 2018 | 4 | 2018 |

Approximation algorithm for the cyclic swap problem. YJP Ardila, CS Iliopoulos, GM Landau, M Mohamed Stringology 2005, 190-200, 2005 | 4 | 2005 |

Popping superbubbles and discovering clumps: recent developments in biological sequence analysis CS Iliopoulos, R Kundu, M Mohamed, F Vayani International Workshop on Algorithms and Computation, 3-14, 2016 | 3 | 2016 |

Experimental (δ, γ)-Pattern-Matching with Don’t Cares CS Iliopoulos, M Mohamed, V Mohanaraj Proc. SMC 7, 142-148, 2007 | 3 | 2007 |

Optimal computation of overabundant words Y Almirantis, P Charalampopoulos, J Gao, CS Iliopoulos, M Mohamed, ... arXiv preprint arXiv:1705.03385, 2017 | 2 | 2017 |

Efficient computation of clustered-clumps in degenerate strings CS Iliopoulos, R Kundu, M Mohamed IFIP International Conference on Artificial Intelligence Applications and …, 2016 | 2 | 2016 |