C
Costas S. Iliopoulos
Researcher at King's College London
Publications - 441
Citations - 7243
Costas S. Iliopoulos is an academic researcher from King's College London. The author has contributed to research in topics: String (computer science) & Pattern matching. The author has an hindex of 40, co-authored 432 publications receiving 6883 citations. Previous affiliations of Costas S. Iliopoulos include University of Cambridge & Royal Holloway, University of London.
Papers
More filters
Journal ArticleDOI
Computing the λ-covers of a string
TL;DR: This work generalizes the @l-Cover Problem, whereby a set of @l substrings of different lengths are considered, which can be computed using the general algorithm in O(n^2) time.
Book ChapterDOI
Varieties of regularities in weighted sequences
TL;DR: This work considers the problems of finding varieties of regularities in a weighted sequence, and based on the algorithms for computing all the repeats of every length by using an iterative partitioning technique, tackles the all-covers problem and all-seeds problem.
Journal ArticleDOI
Efficient seed computation revisited
Michalis Christou,Maxime Crochemore,Costas S. Iliopoulos,Marcin Kubica,Solon P. Pissis,Jakub Radoszewski,Wojciech Rytter,Bartosz Szreder,T. Wale +8 more
TL;DR: In this paper, the shortest seed problem is solved in O(n log n/m) time, where m is the length of a seed and n is the number of prefixes in the string.