Department of Computer Science
The Strand, London WC2R 2LS, UK
  Undergraduate enquiries:
Postgraduate enquiries:
Fax:
+44 (0)20 7848 2005
+44 (0)20 7848 2588
+44 (0)20 7848 2851
 
 

  You are here: www.dcs.kcl.ac.uk> staff> manal: Manal Mohamed

   
Manal Mohamed
Research Interests
Teaching
Student Projects
Publications
Education
e-mail: manal@dcs.kcl.ac.uk
Tel.: +44 20 7848 2492
Fax: +44 20 7848 1518
Room: K6.52 (23F)
Office Hours: Mondays, 10:00am-12:00pm

Research Interests

  • Design and Analysis of String Algorithms
  • Algorithms for Molecular Sequences
  • Algorithms for Music Analysis
  • Validation And Decomposition of Partially Occluded Images

Teaching

Course Units

  • Algorithm Design and Analysis (2002 to 2006)
  • Geometric Algorithm and Application (2005 to 2007)
  • Network Optimization (2005 and 2006)
  • Programming Practice (2007)

Student Projects

  • If you'd like to do a project with me, please check this link for more information on available projects.

Publications


2006

[1]  Maxime Crochemore, Costas S.Iliopoulos, Manal Mohamed, Marie-France Sagot
``Longest Repeats with a Block of Don't Cares"
Theoretical Computer Science, (to appear)
[2]  Emilios Cambouropoulos, Maxime Crochemore, Costas S.Iliopoulos, Manal Mohamed, Marie-France Sagot
``All Maximal-Pairs in Step-Leap Representation of Musical Sequence"
Information Sciences, (to appear)
[3]  Costas S.Iliopoulos, I. Lee, M. Mohamed, M. S. Rahman, and W. F. Smyth
         ``Finding patterns with variable length gaps or don't cares"
           In Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06), Taipei,
           Taiwan, August   2006.
2005

[4]  Richard Cole, Costas S. Iliopoulos, Manal Mohamed, W. F. Smyth, Lu Yang
``The Complexity of the Minimum k-Cover Problem"
Journal of Automata, Language and Combinatorics, to appear.
          [5]  Yoan José Pinzón ArdilaManolis Christodoulakis, Costas S. Iliopoulos Manal Mohamed
                    ``Efficient (delta,gamma)-Matching with Don't Cares"
                     Proc. of the 16-th Australasian Workshop on Combinatorial Algorithms (AWOCA'05), J. Ryan, P. Manyem, K. Sugeng, and
                      M.   Miller, eds., Ballarat, Victoria, Australia, pages 27-38,  2005, ISBN 0-646-45252-5.
[6]  Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed, Yoan Pinzon
``Approximation Algorithm for the Cyclic Swap Problem"
Proc. of the Prague Stringology Conference (PSC'05), J. Holub and M. Simnek, eds., Czech Technical University, Prague, Czech Republic, pages 189-199, 2005, ISBN 80-01-03307-4.

[7]  Yoan José Pinzón Ardila, Manolis Christodoulakis, Manal Mohamed
``Wildcards in Delta-Matching"
Franco-Canadian Workshop on Combinatorial Algorithms (COMAL'05), McMaster University, Hamilton, ON, Canada, abstract, 2005.

[8]  Emilios Cambouropoulos, Maxime Crochemore, Costas S.Iliopoulos, Manal Mohamed, Marie-France Sagot
``A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories"
Proc. of the 6th International Conference on Music Information Retrieval (ISMIR 2005),  2005.

 [9]  Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed
``Necklace Swap Problem for Rhythmic Similarity Measures"
Proc.  of the 12th International Symposium on String Processing and Information Retrieval (SPIRE'05), Buenos Aires, Argentina, M. Consens and G. Navarro, eds., Lecture Notes in Computer Science, Vol. 3772, Springer-Verlag, Berlin, pp. 235-246, 2005, ISBN 3-540-29740-5. 2004

[10]  Costas S. Iliopoulos, Manal Mohamed W. F. Smyth
``New Complexity Results for the k-Covers Problem"
Proc. of the 15-th Australasian Workshop on Combinatorial Algorithms (AWOCA'04) Seok-Hee Hong, ed.,  pp.141-147, 2004.

[11]  Maxime Crochemore, Costas S.Iliopoulos, Manal Mohamed, Marie-France Sagot
``Longest Repeats with a Block of Don't Cares"
Proc. of the Latin American Theoretical INformatics (LATIN'04), pp. 279-291, 2004. 2003

[12]  Richard Cole, Costas S. Iliopoulos, Manal Mohamed, W. F. Smyth, Lu Yang
``Computing the Minimum k-Cover of a String"
Proc. of the Prague Stringology Club (PSC '03), Simanek eds., Czech Technical University, Collaborative Report DC-2003-04, Prague, Czech Republic, pp. 51-64., 2003.

[13]  Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina G. Perdikuri, W. F. Smyth, Athanasios K.Tsakalidis
``String Regularities with Don't Cares"
Nordic Journal of Computing, pp. 40-51, 2003. 2002

[14]  Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina G. Perdikuri, W. F. Smyth, Athanasios K.Tsakalidis
``String Regularities with Don't Cares (preprint)"
Proc. of the Prague Stringology Club (PSC '02), M. Balik and M. Simanek, eds., Czech Technical University, Collaborative Report DC-2002-03, Prague, Czech Republic, pp. 65-74, 2002.

[15]  Costas S. Iliopoulos, Manal Mohamed
``Validation and Decomposition of Partially Occluded Images"
Proc. of the 29th Annual Conference on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science, Vol. 2540, pp. 218-230, 2002.

[16]  Aspassia Daskalopulu, Costas S. Iliopoulos, Manal Mohamed
``On-line Analysis and Validation of Partially Occluded Images: Implementation and Practice"
International Journal of Computer Mathematics, Lecture Notes in Computer Science, Vol. 79(12), pp. 1245-1257, 2002.

Education

  • Doctor of Philosophy in Computer Science, 2005, University of London, England
  • Master of Sciences in Advanced Computting, 2001, University of London, England
  • Computer Science, 1992, K.A.A University, Saudi Arabia
DCS Home KCL Home Contact Feedback Top