Stebėti
Manal Mohamed
Manal Mohamed
Patvirtintas el. paštas kcl.ac.uk
Pavadinimas
Cituota
Cituota
Metai
Finding patterns with variable length gaps or don’t cares
MS Rahman, CS Iliopoulos, I Lee, M Mohamed, WF Smyth
Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006
562006
String regularities with don't cares
CS Iliopoulos, M Mohamed, L Mouchard, KG Perdikuri, WF Smyth, ...
Prague Stringology Conference 2002, 2002
512002
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-12, 2017
352017
A pattern extraction algorithm for abstract melodic representations that allow partial overlapping of intervallic categories
E Cambouropoulos, M Crochemore, CS Iliopoulos, M Mohamed, ...
Proceedings of the 6th International Conference on Music Information …, 2005
302005
Shade-matching capacity of omnichroma in anterior restorations
K Dunn
Open Access Journal of Dental Sciences 5 (2), 2020
272020
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
252016
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
252005
Internal dictionary matching
P Charalampopoulos, T Kociumaka, M Mohamed, J Radoszewski, ...
Algorithmica 83 (7), 2142-2169, 2021
192021
New complexity results for the k-covers problem
CS Iliopoulos, M Mohamed, WF Smyth
Information Sciences 181 (12), 2571-2575, 2011
18*2011
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 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
162016
Computing the minimum k-cover of a string
R Cole, CS Iliopoulos, M Mohamed, WF Smyth, L Yang
Prague Stringology Conference 2003, 2003
162003
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
Counting distinct patterns in internal dictionary matching
P Charalampopoulos, T Kociumaka, M Mohamed, J Radoszewski, ...
arXiv preprint arXiv:2005.05681, 2020
102020
Necklace swap problem for rhythmic similarity measures
YJP Ardila, R Clifford, M Mohamed
String Processing and Information Retrieval: 12th International Conference …, 2005
102005
Longest repeats with a block of don’t cares
M Crochemore, CS Iliopoulos, M Mohamed, MF Sagot
LATIN 2004: Theoretical Informatics: 6th Latin American Symposium, Buenos …, 2004
102004
Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
CS Iliopoulos, R Kundu, M Mohamed, F Vayani
WALCOM: Algorithms and Computation: 10th International Workshop, WALCOM 2016 …, 2016
82016
Longest unbordered factor in quasilinear time
T Kociumaka, R Kundu, M Mohamed, SP Pissis
arXiv preprint arXiv:1805.09924, 2018
72018
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
62005
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
52018
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20