default search action
Manal Mohamed 0001
Person information
- affiliation: King's College London, Department of Informatics, United Kingdom
Other persons with the same name
- Manal Mohamed 0002
— Gwangju Institute of Science and Technology, Biomedical Science and Engineering Department, South Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j13]Panagiotis Charalampopoulos
Internal Dictionary Matching. Algorithmica 83(7): 2142-2169 (2021) - 2020
- [c19]Panagiotis Charalampopoulos
Counting Distinct Patterns in Internal Dictionary Matching. CPM 2020: 8:1-8:15 - [c18]Miznah H. Alshammary, Costas S. Iliopoulos, Manal Mohamed, Fatima Vayani:
Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window. AIAI Workshops 2020: 213-224 - [i7]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CoRR abs/2005.05681 (2020)
2010 – 2019
- 2019
- [j12]Yannis Almirantis, Panagiotis Charalampopoulos
On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792: 85-95 (2019) - [c17]Panagiotis Charalampopoulos
Internal Dictionary Matching. ISAAC 2019: 22:1-22:17 - [i6]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. CoRR abs/1909.11577 (2019) - 2018
- [j11]Ritu Kundu
Editorial. J. Discrete Algorithms 50: 1 (2018) - [c16]Tomasz Kociumaka
Longest Unbordered Factor in Quasilinear Time. ISAAC 2018: 70:1-70:13 - [c15]Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis
Maximal Motif Discovery in a Sliding Window. SPIRE 2018: 191-205 - [i5]Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis:
Longest Unbordered Factor in Quasilinear Time. CoRR abs/1805.09924 (2018) - 2017
- [j10]Yannis Almirantis, Panagiotis Charalampopoulos
On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1): 5:1-5:12 (2017) - [c14]Yannis Almirantis, Panagiotis Charalampopoulos
Optimal Computation of Overabundant Words. WABI 2017: 4:1-4:14 - [i4]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. CoRR abs/1705.03385 (2017) - 2016
- [j9]Maxime Crochemore
Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. 51: 109-114 (2016) - [j8]Ljiljana Brankovic
Linear-time superbubble identification algorithm for genome assembly. Theor. Comput. Sci. 609: 374-383 (2016) - [j7]Golnaz Badkobeh, Maxime Crochemore
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. 656: 241-248 (2016) - [c13]Costas S. Iliopoulos, Ritu Kundu
Efficient Computation of Clustered-Clumps in Degenerate Strings. AIAI 2016: 510-519 - [c12]Yannis Almirantis, Panagiotis Charalampopoulos
Optimal Computation of Avoided Words. WABI 2016: 1-13 - [c11]Costas S. Iliopoulos, Ritu Kundu
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. WALCOM 2016: 3-14 - [i3]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. CoRR abs/1604.08760 (2016) - 2015
- [i2]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-Time Superbubble Identification Algorithm. CoRR abs/1505.04019 (2015) - [i1]Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Linear Algorithm for Conservative Degenerate Pattern Matching. CoRR abs/1506.04559 (2015) - 2014
- [c10]Costas S. Iliopoulos, Manal Mohamed
On-line Minimum Closed Covers. AIAI Workshops 2014: 106-115 - 2011
- [j6]Costas S. Iliopoulos, Manal Mohamed
New complexity results for the k-covers problem. Inf. Sci. 181(12): 2571-2575 (2011)
2000 – 2009
- 2009
- [c9]Julien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed:
Validation and Decomposition of Partially Occluded Images with Holes. Stringology 2009: 129-136 - 2007
- [j5]Emilios Cambouropoulos, Maxime Crochemore
All maximal-pairs in step-leap representation of melodic sequence. Inf. Sci. 177(9): 1954-1962 (2007) - 2006
- [j4]Maxime Crochemore
Longest repeats with a block of k don't cares. Theor. Comput. Sci. 362(1-3): 248-254 (2006) - [c8]M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed
Finding Patterns with Variable Length Gaps or Don't Cares. COCOON 2006: 146-155 - 2005
- [b1]Manal Abd El-Kadeer Kasem Mohamed:
Algorithmic issues on string regularities. King's College London, UK, 2005 - [j3]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. 10(5/6): 641-653 (2005) - [c7]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. ISMIR 2005: 167-174 - [c6]Yoan José Pinzón Ardila, Raphaël Clifford
Necklace Swap Problem for Rhythmic Similarity Measures. SPIRE 2005: 234-245 - [c5]Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed:
Approximation algorithm for the cyclic swap problem. Stringology 2005: 190-200 - 2004
- [c4]Maxime Crochemore
Longest Repeats with a Block of Don't Cares. LATIN 2004: 271-278 - 2003
- [j2]Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis:
String Regularities with Don't Cares. Nord. J. Comput. 10(1): 40-51 (2003) - [c3]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
Computing the Minimum k-Cover of a String. Stringology 2003: 51-64 - 2002
- [j1]Aspassia Daskalopulu
On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. Int. J. Comput. Math. 79(12): 1245-1257 (2002) - [c2]Costas S. Iliopoulos, Manal Mohamed
Validation and Decomposition of Partially Occluded Images. SOFSEM 2002: 218-230 - [c1]Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis:
String Regularities with Don't Cares. Stringology 2002: 65-74
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: