Zobrazeno 1 - 10
of 317
pro vyhledávání: '"S. Iliopoulos"'
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:
WALCOM: Algorithms and Computation ISBN: 9783031270505
We introduce the concept of cyclic covers, which generalizes the classical notion of covers in strings. Given any nonempty string X of length n, a factor W of X is called a cyclic cover if every position of X belongs to an occurrence of a cyclic shif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::302c4d8b16d516be1c624952dbd8e713
https://ir.cwi.nl/pub/32986
https://ir.cwi.nl/pub/32986
Autor:
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba
Publikováno v:
Theoretical Computer Science. 866:70-81
Autor:
Schoefs, Franck, Laura-Mae Macadr��, A. Gerthoffert, M. Darraz, K. Nielsen, C. Baet��, S. Iliopoulos, F. Presuel-Moreno, J. Wielant, J.P. Touzanne, P. Biagini, P. Heiseil, J. Tacq, S. Chataignier, L. Gaillet, Villain, G��raldine, S. Bonnet, Lecieux, Yann, Torres-Luque, Magda Marcela, Friis-Madsen, Erik
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea085d76d0e6eda179b83625493c4947
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:
ACM Journal of Experimental Algorithmics. 25:1-16
The suffix array is one of the most prevalent data structures for string indexing; it stores the lexicographically sorted list of suffixes of a given string. Its practical advantage compared to the suffix tree is space efficiency. In Property Indexin
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 Genomics, Vol 2015 (2015)
This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting problem in many biological contexts. CPM consists in finding all occurrences of the rotations of a pattern P of length m in a text T of length n. In th
Externí odkaz:
https://doaj.org/article/4e8188bb305443b4ae75ac6160b58932
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.
Publikováno v:
Information and Computation. 266:49-59
A weighted sequence is a sequence of probability distributions over an alphabet of size σ. Weighted sequences arise naturally in many applications. We study the problem of weighted pattern matching in which we are given a string pattern P of length