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
BookDOI
String Processing and Information Retrieval: 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings
TL;DR: This book constitutes the refereed proceedings of the 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015, held in London, UK, in September 2015, and contains 28 full and 6 short papers.
Journal ArticleDOI
The maximal number of cubic runs in a word
Maxime Crochemore,Costas S. Iliopoulos,Marcin Kubica,Jakub Radoszewski,Wojciech Rytter,Tomasz Waleń +5 more
TL;DR: This paper investigates cubic runs, in which the period repeats at least three times, and shows the upper bound on their maximal number, cubic-runs(n), in a word of length n, which is considerably simpler than the corresponding proof for general runs.
Book ChapterDOI
A new model to solve the swap matching problem and efficient algorithms for short patterns
TL;DR: This paper presents a new graph-theoretic approach to model the problem, and devise an efficient algorithm to solve the swap matching problem, an adaptation of the classic shiftor algorithm.
Journal Article
Approximate matching in weighted sequences
TL;DR: The notion of Hamming distance and edit distance in weighted sequences are defined and efficient algorithms for computing them are given and exact weighted matching can be computed in time O(slog2s), where s is the number of text symbols having non-zero probability.
Journal ArticleDOI
Efficient algorithms for three variants of the LPF table
TL;DR: Three new tables storing different variants of previous factors (past segments) of a string are introduced, helpful to improve, for example, gapped palindrome detection and text compression using reverse factors.