Zobrazeno 1 - 10
of 260
pro vyhledávání: '"Wojciech Rytter"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 2 (2010)
We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g. a lozenge b is a
Externí odkaz:
https://doaj.org/article/0ab2f9e3ba384a7697164b659c931a63
Autor:
Maxime Crochemore, Wojciech Rytter
The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentatio
Autor:
Wojciech Rytter, Jakub Radoszewski, Tomasz Waleń, Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed
Publikováno v:
Algorithmica. 83:2142-2169
We introduce data structures answering queries concerning the occurrences of patterns from a given dictionary $$\mathsf {D}$$ in fragments of a given string T of length n. The dictionary is internal in the sense that each pattern in $$\mathsf {D}$$ i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc13ac06c65fd37a58c0c55da31dcd68
https://doi.org/10.1007/s00453-021-00821-y
https://doi.org/10.1007/s00453-021-00821-y
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa0d59f07363f9d4b80dc633f1b978c4
https://doi.org/10.1016/j.tcs.2021.03.011
https://doi.org/10.1016/j.tcs.2021.03.011
Publikováno v:
Theoretical Computer Science. 861:45-65
Every node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a249bbcab6576fbaa02375c5166183f
https://doi.org/10.1016/j.tcs.2021.02.009
https://doi.org/10.1016/j.tcs.2021.02.009
Publikováno v:
ACM Transactions on Algorithms. 16:1-23
A seed in a word is a relaxed version of a period in which the occurrences of the repeating subword may overlap. Our first contribution is a linear-time algorithm computing a linear-size representation of all seeds of a word (the number of seeds migh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94b86eab1174d717f59b66720864c417
https://doi.org/10.1145/3386369
https://doi.org/10.1145/3386369
Publikováno v:
Theoretical Computer Science. 812:174-186
Many properties of a string can be viewed as sets of dependencies between substrings of the string expressed in terms of substring equality. We design a linear-time algorithm which finds a solution to an arbitrary system of such constraints: a generi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::404920c65cd99b767c3c9cef9ec68f46
https://doi.org/10.1016/j.tcs.2019.10.027
https://doi.org/10.1016/j.tcs.2019.10.027
Publikováno v:
Theoretical Computer Science. 795:362-374
A set of k mobile agents is deployed at the root r of a weighted, n-node tree T. The weight of each tree edge represents the distance between the corresponding nodes along the edge. One node of the tree, the source s, possesses a piece of information
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8d1183e338c832554dae80b04bf189a
https://doi.org/10.1016/j.tcs.2019.07.018
https://doi.org/10.1016/j.tcs.2019.07.018
Autor:
Juliusz Straszyński, Tomasz Kociumaka, Wiktor Zuba, Wojciech Rytter, Tomasz Waleń, Jakub Radoszewski
Publikováno v:
Information and Computation. 286:104779
A k-antipower (for k ≥ 2 ) is a concatenation of k distinct words of the same length. Fici et al. (ICALP 2016) initiated the study of antipowers occurring as fragments of a word, whereas Badkobeh et al. (Inf. Process. Lett., 2018) presented first a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::346d47f2781b5611cf0d55cf4fbfead6
https://doi.org/10.1016/j.ic.2021.104779
https://doi.org/10.1016/j.ic.2021.104779