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
Faster algorithms for δ,γ-matching and related problems
TL;DR: In this article, the running time of the proposed algorithms is shown to be O(δn log m), where m is the pattern length, n is the text length and δ a given integer.
Journal ArticleDOI
Algorithms for computing variants of the longest common subsequence problem
TL;DR: This paper introduces new variants of LCS problem and presents efficient algorithms to solve them, and introduces the notion of gap constraints in the LCS problems.
Journal ArticleDOI
A New Efficient Algorithm for Computing the Longest Common Subsequence
TL;DR: This paper presents a new and efficient algorithm for solving the Longest Common Subsequence problem for two strings in O(ℛlog log’n+n) time, where ℛ is the total number of ordered pairs of positions at which the two strings match.
Journal ArticleDOI
Approximate periods of strings
Jeong Seop Sim,Costas S. Iliopoulos,Costas S. Iliopoulos,Kunsoo Park,William F. Smyth,William F. Smyth +5 more
TL;DR: Different forms of approximate periodicity under a variety of distance functions are studied, for two of which polynomial-time algorithms are derived and the third problem is NP-complete.
Journal Article
Property matching and weighted matching
TL;DR: A reduction from Weighted Matching to Property Matching is presented that allows off-the-shelf solutions to numerous weighted matching problems including indexing, swapped matching, parameterized matching, approximate matching, and many more.