Zobrazeno 1 - 10
of 335
pro vyhledávání: '"Mohamed, Manal A. A."'
Autor:
Nashed, Youssef L., Zahran, Fouad, Youssef, Mohamed Adel, Mohamed, Manal G., Mazrouaa, Azza M.
Publikováno v:
Pigment & Resin Technology, 2022, Vol. 53, Issue 3, pp. 394-405.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/PRT-06-2022-0071
Autor:
Labib, Nader L., Zahran, Fouad, Youssef, Mohamed Adel, Mazrouaa, Azza M., Mohamed, Manal Gamal
Publikováno v:
Pigment & Resin Technology, 2022, Vol. 53, Issue 2, pp. 219-225.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/PRT-06-2022-0072
Autor:
Asiri, Abdulaziz, Ahmed, Faransa A., Almowafy, Abeer A., Mohamed, Rasha A., Nouh, Wael G., Abdelrahem, Aml S., Kafl, Rehab H., Mohamed, Manal F., Moursy, Shimaa M.
Publikováno v:
In Heliyon 15 June 2024 10(11)
Autor:
Charalampopoulos, Panagiotis, Kociumaka, Tomasz, Mohamed, Manal, Radoszewski, Jakub, Rytter, Wojciech, Straszyński, Juliusz, Waleń, Tomasz, Zuba, Wiktor
We consider the problem of preprocessing a text $T$ of length $n$ and a dictionary $\mathcal{D}$ in order to be able to efficiently answer queries $CountDistinct(i,j)$, that is, given $i$ and $j$ return the number of patterns from $\mathcal{D}$ that
Externí odkaz:
http://arxiv.org/abs/2005.05681
Autor:
Charalampopoulos, Panagiotis, Kociumaka, Tomasz, Mohamed, Manal, Radoszewski, Jakub, Rytter, Wojciech, Waleń, Tomasz
We introduce data structures answering queries concerning the occurrences of patterns from a given dictionary $\mathcal{D}$ in fragments of a given string $T$ of length $n$. The dictionary is internal in the sense that each pattern in $\mathcal{D}$ i
Externí odkaz:
http://arxiv.org/abs/1909.11577
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A border u of a word w is a proper factor of w occurring both as a prefix and as a suffix. The maximal unbordered factor of w is the longest factor of w which does not have a border. Here an O(n log n)-time with high probability (or O(n log n log^2 l
Externí odkaz:
http://arxiv.org/abs/1805.09924
Autor:
Almirantis, Yannis, Charalampopoulos, Panagiotis, Gao, Jia, Iliopoulos, Costas S., Mohamed, Manal, Pissis, Solon P., Polychronopoulos, Dimitris
The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word $w$ in a given sequence $x$ can be used for classifying $w$ as avoided or overabundant. The definitions used for the expectation and devia
Externí odkaz:
http://arxiv.org/abs/1705.03385
Publikováno v:
Biosensors (2079-6374); Dec2024, Vol. 14 Issue 12, p616, 19p
Publikováno v:
In The Egyptian Rheumatologist April 2022 44(2):103-108