Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Computing the Minimum k-Cover of a String.

R. Cole, C. Iliopoulos, M. Mohamed, W. Smyth, and L. Yang. Stringology, page 51-64. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mohamed Hassan University of Stuttgart

Manal Talab University of Stuttgart

Tarek Mohamed University of Stuttgart

Abdelrahman Hesham Mohamed University of Stuttgart

Sherif Abdulatif Mohamed University of Stuttgart

Other publications of authors with the same name

Approximation algorithm for the cyclic swap problem.Y. Ardila, C. Iliopoulos, G. Landau, and M. Mohamed. Stringology, page 190-200. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2005)String Regularities with Don't Cares.C. Iliopoulos, M. Mohamed, L. Mouchard, K. Perdikuri, W. Smyth, and A. Tsakalidis. Stringology, page 65-74. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2002)Efficient computation of maximal anti-exponent in palindrome-free strings.G. Badkobeh, M. Crochemore, M. Mohamed, and C. Toopsuwan. Theor. Comput. Sci., (2016)Linear Algorithm for Conservative Degenerate Pattern Matching.M. Crochemore, C. Iliopoulos, R. Kundu, M. Mohamed, and F. Vayani. CoRR, (2015)Linear algorithm for conservative degenerate pattern matching.M. Crochemore, C. Iliopoulos, R. Kundu, M. Mohamed, and F. Vayani. Eng. Appl. of AI, (2016)String Regularities with Don't Cares.C. Iliopoulos, M. Mohamed, L. Mouchard, K. Perdikuri, W. Smyth, and A. Tsakalidis. Nord. J. Comput., 10 (1): 40-51 (2003)All maximal-pairs in step-leap representation of melodic sequence.E. Cambouropoulos, M. Crochemore, C. Iliopoulos, M. Mohamed, and M. Sagot. Inf. Sci., 177 (9): 1954-1962 (2007)On avoided words, absent words, and their application to biological sequence analysis.Y. Almirantis, P. Charalampopoulos, J. Gao, C. Iliopoulos, M. Mohamed, S. Pissis, and D. Polychronopoulos. Algorithms for Molecular Biology, 12 (1): 5:1-5:12 (2017)On-line Minimum Closed Covers.C. Iliopoulos, and M. Mohamed. AIAI Workshops, volume 437 of IFIP Advances in Information and Communication Technology, page 106-115. Springer, (2014)Necklace Swap Problem for Rhythmic Similarity Measures.Y. Ardila, R. Clifford, and M. Mohamed. SPIRE, volume 3772 of Lecture Notes in Computer Science, page 234-245. Springer, (2005)