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
Book ChapterDOI
A New Efficient Algorithm for Computing the Longest Common Subsequence
TL;DR: A new and efficient algorithm for solving the LCS problem for two strings in O(log n + n) time, where $\mathcal R$ is the total number of ordered pairs of positions at which the two strings match.
Journal ArticleDOI
Optimal superprimitivity testing for strings
TL;DR: It is shown that the property of being superprimitive is testable on a string of n symbols in O(n) time and space.
Journal ArticleDOI
Algorithms for computing approximate repetitions in musical sequences
Emilios Cambouropoulos,Maxime Crochemore,Costas S. Iliopoulos,Costas S. Iliopoulos,Laurent Mouchard,Laurent Mouchard,Yoan J. Pinzón,Yoan J. Pinzón +7 more
TL;DR: In this paper, the authors introduce two new notions of approximate matching with application in computer assisted music analysis, and present algorithms for each notion of approximation: for approximate string matching and for computing approximate squares.
Book ChapterDOI
Finding patterns in given intervals
TL;DR: This paper develops solutions for different variants of the pattern matching problem in given intervals depending on whether the intervals are given a priori for pre-processing, or during the query along with the pattern or.