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
Order-preserving matching
Jinil Kim,Peter Eades,Rudolf Fleischer,Seok-Hee Hong,Costas S. Iliopoulos,Kunsoo Park,Simon J. Puglisi,Takeshi Tokuyama +7 more
TL;DR: This work introduces a new string matching problem called order-preserving matching on numeric strings, where a pattern matches a text if the text contains a substring of values whose relative orders coincide with those of the pattern.
Journal ArticleDOI
Extracting powers and periods in a word from its runs structure
Maxime Crochemore,Costas S. Iliopoulos,Marcin Kubica,Jakub Radoszewski,Wojciech Rytter,Tomasz Waleń +5 more
TL;DR: Lyndon words are used and the Lyndon structure of runs are introduced as a useful tool when computing powers and in problems related to periods some versions of the Manhattan skyline problem are used.
Journal ArticleDOI
Covering a string
TL;DR: AnO(n logn)-time algorithm for finding all the seeds of a given string of lengthn is presented and the concept of repetitiveness is generalized as follows.
Proceedings Article
Music genre classification via compressive sampling
TL;DR: A CS-based classifier for music genre classification, with two sets of features, including short-time and long-time features of audio music, that generates a compact signature to achieve a significant reduction in the dimensionality of the audio music signals.
Journal ArticleDOI
Truncated suffix trees and their application to data compression
TL;DR: This paper proposes a data structure called the truncated suffix tree, which is a truncated version of the suffix tree that is particularly a useful data structure for LZ77 that compresses using a sliding window of a fixed size.