Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Mai Alzamel"'
Publikováno v:
BMC Bioinformatics, Vol 22, Iss 1, Pp 1-12 (2021)
Abstract Background An inverted repeat is a DNA sequence followed downstream by its reverse complement, potentially with a gap in the centre. Inverted repeats are found in both prokaryotic and eukaryotic genomes and they have been linked with countle
Externí odkaz:
https://doaj.org/article/5823246cbfe44575a0826d2ae10c4aff
Publikováno v:
Applied Sciences, Vol 13, Iss 1, p 557 (2022)
The prevalence of malware attacks that target IoT systems has raised an alarm and highlighted the need for efficient mechanisms to detect and defeat them. However, detecting malware is challenging, especially malware with new or unknown behaviors. Th
Externí odkaz:
https://doaj.org/article/642ba7deec014a61bb3f01b471b2a3a2
Publikováno v:
Journal of Computational Biology. 30:117-117
Autor:
Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts
Publikováno v:
International Journal of Foundations of Computer Science, 31(5), 595-610
A closed string contains a proper factor occurring as both a prefix and a suffix but not elsewhere in the string. Closed strings were introduced by Fici (WORDS 2011) as objects of combinatorial interest. This paper addresses a new problem by extendin
Publikováno v:
Alzamel, M, Iliopoulos, C S, Smyth, W F & Sung, W-K 2018, ' Off-line and
algorithms for closed string factorization ', Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2018.10.033
algorithms for closed string factorization ', Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2018.10.033
A string X = X [ 1 . . n ] , n > 1 , is said to be closed if it has a nonempty proper prefix that is also a suffix, but that otherwise occurs nowhere else in X ; for n = 1 , every X is closed. Closed strings were introduced by Fici in [1] as objects
Publikováno v:
International Journal of Foundations of Computer Science. 29:1311-1329
Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms
Publikováno v:
Fundamenta Informaticae. 163:253-266
Autor:
Mai Alzamel, Lorraine A.K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Uncertain sequences are compact representations of sets of similar strings. They highlight common segments by collapsing them, and explicitly represent varying segments by listing all possible options. A generalized degenerate string (GD string) is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68d0d35d0c9d7e0bd6719163cba45c96
https://doi.org/10.3233/stal200005
https://doi.org/10.3233/stal200005
Publikováno v:
Algorithmica. 84:565-565
Autor:
Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Lorraine A.K. Ayad, Roberto Grossi, Giovanna Rosone, Mai Alzamel, Costas S. Iliopoulos
Publikováno v:
Fundamenta Informaticae, 175(1-4), 41-58
Fundamenta Informaticae
Fundamenta Informaticae, 2020, 175, pp.41-58. ⟨10.3233/fi-2020-1947⟩
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2020, 175, pp.41-58. ⟨10.3233/fi-2020-1947⟩
Fundamenta Informaticae
Fundamenta Informaticae, 2020, 175, pp.41-58. ⟨10.3233/fi-2020-1947⟩
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2020, 175, pp.41-58. ⟨10.3233/fi-2020-1947⟩
Uncertain sequences are compact representations of sets of similar strings. They highlight common segments by collapsing them, and explicitly represent varying segments by listing all possible options. A generalized degenerate string (GD string) is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f875ebb0f9720a2bdd77d492626bcd4
http://hdl.handle.net/11368/3019828
http://hdl.handle.net/11368/3019828