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
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
TL;DR: This article introduces a new and simple data structure, the prefix table under Hamming distance, and presents two algorithms to compute it efficiently: one asymptotically fast; the other very fast on average and in practice.
Book ChapterDOI
Searching and Indexing Circular Patterns
TL;DR: Circular DNA sequences can be found in viruses, as plasmids in archaea and bacteria, and in the mitochondria and plastids of eukaryotic cells, and they can be relevant in the analysis of organisms with such structure.
Proceedings ArticleDOI
Speeding-up hirschberg and hunt-szymanski LCS algorithms
TL;DR: Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings by improvements of Hirschberg's divide-and- conquer algorithm and of Hunt-Szymanski algorithm based on an ef£cient computation of all dominant match points.
Posted Content
Covering Problems for Partial Words and for Indeterminate Strings
Maxime Crochemore,Maxime Crochemore,Costas S. Iliopoulos,Tomasz Kociumaka,Jakub Radoszewski,Jakub Radoszewski,Wojciech Rytter,Tomasz Waleń +7 more
TL;DR: In this paper, it was shown that the problem of computing a shortest solid cover of an indeterminate string is NP-complete for binary alphabet and partial word covering problem is fixed-parameter tractable with respect to the number of non-solid symbols.
Book ChapterDOI
Computing all subtree repeats in ordered ranked trees
Michalis Christou,Maxime Crochemore,Tomas Flouri,Costas S. Iliopoulos,Jan Janousek,Bořivoj Melichar,Solon P. Pissis +6 more
TL;DR: This work transforms the given tree to a string representing its postfix notation, and proposes an algorithm based on the bottom-up technique that solves the problem of finding all subtree repeats in a given ordered ranked tree.