Manal Mohamed
Manal Mohamed
Подтвержден адрес электронной почты в домене kcl.ac.uk
Название
Процитировано
Процитировано
Год
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
532006
String regularities with don't cares
CS Iliopoulos, M Mohamed, L Mouchard, KG Perdikuri, WF Smyth, ...
482002
A pattern extraction algorithm for abstract melodic representations that allow partial overlapping of intervallic categories
E Cambouropoulos, M Crochemore, CS Iliopoulos, M Mohamed, ...
282005
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
182006
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
172016
New complexity results for the k-covers problem
CS Iliopoulos, M Mohamed, WF Smyth
Information Sciences 181 (12), 2571-2575, 2011
17*2011
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
172005
Computing the minimum k-cover of a string
R Cole, CS Iliopoulos, M Mohamed, WF Smyth, L Yang
162003
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), 1-12, 2017
152017
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
122007
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
92004
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
82016
Necklace swap problem for rhythmic similarity measures
YJP Ardila, R Clifford, M Mohamed
International Symposium on String Processing and Information Retrieval, 234-245, 2005
72005
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
72005
Longest unbordered factor in quasilinear time
T Kociumaka, R Kundu, M Mohamed, SP Pissis
arXiv preprint arXiv:1805.09924, 2018
52018
Internal dictionary matching
P Charalampopoulos, T Kociumaka, M Mohamed, J Radoszewski, ...
arXiv preprint arXiv:1909.11577, 2019
42019
Maximal motif discovery in a sliding window
CS Iliopoulos, M Mohamed, SP Pissis, F Vayani
International Symposium on String Processing and Information Retrieval, 191-205, 2018
42018
Approximation algorithm for the cyclic swap problem.
YJP Ardila, CS Iliopoulos, GM Landau, M Mohamed
Stringology 2005, 190-200, 2005
42005
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
32016
Experimental (δ, γ)-Pattern-Matching with Don’t Cares
CS Iliopoulos, M Mohamed, V Mohanaraj
Proc. SMC 7, 142-148, 0
3
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20