Manal Mohamed

Orcid: 0000-0002-1435-5051

Affiliations:
  • King's College London, Department of Informatics, United Kingdom


According to our database1, Manal Mohamed authored at least 32 papers between 2002 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Internal Dictionary Matching.
Algorithmica, 2021

2020
Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window.
Proceedings of the Artificial Intelligence Applications and Innovations. AIAI 2020 IFIP WG 12.5 International Workshops, 2020

Counting Distinct Patterns in Internal Dictionary Matching.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
On overabundant words and their application to biological sequence analysis.
Theor. Comput. Sci., 2019

2018
Editorial.
J. Discrete Algorithms, 2018

Maximal Motif Discovery in a Sliding Window.
Proceedings of the String Processing and Information Retrieval, 2018

Longest Unbordered Factor in Quasilinear Time.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
On avoided words, absent words, and their application to biological sequence analysis.
Algorithms Mol. Biol., 2017

Optimal Computation of Overabundant Words.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016
Linear-time superbubble identification algorithm for genome assembly.
Theor. Comput. Sci., 2016

Efficient computation of maximal anti-exponent in palindrome-free strings.
Theor. Comput. Sci., 2016

Linear algorithm for conservative degenerate pattern matching.
Eng. Appl. Artif. Intell., 2016

Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Optimal Computation of Avoided Words.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Efficient Computation of Clustered-Clumps in Degenerate Strings.
Proceedings of the Artificial Intelligence Applications and Innovations, 2016

2015
Linear-Time Superbubble Identification Algorithm.
CoRR, 2015

2014
On-line Minimum Closed Covers.
Proceedings of the Artificial Intelligence Applications and Innovations, 2014

2011
New complexity results for the k-covers problem.
Inf. Sci., 2011

2009
Validation and Decomposition of Partially Occluded Images with Holes.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2007
All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci., 2007

2006
Longest repeats with a block of <i>k</i> don't cares.
Theor. Comput. Sci., 2006

Finding Patterns with Variable Length Gaps or Don't Cares.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Algorithmic issues on string regularities.
PhD thesis, 2005

The Complexity of the Minimum k-Cover Problem.
J. Autom. Lang. Comb., 2005

Approximation algorithm for the cyclic swap problem.
Proceedings of the Prague Stringology Conference, 2005

Necklace Swap Problem for Rhythmic Similarity Measures.
Proceedings of the String Processing and Information Retrieval, 2005

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
Proceedings of the ISMIR 2005, 2005

2004
Longest Repeats with a Block of Don't Cares.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
String Regularities with Don't Cares.
Nord. J. Comput., 2003

Computing the Minimum k-Cover of a String.
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

2002
On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice.
Int. J. Comput. Math., 2002

Validation and Decomposition of Partially Occluded Images.
Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002


  Loading...