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
Tree template matching in ranked ordered trees by pushdown automata
TL;DR: This work transforms the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model.
Book ChapterDOI
Circular Sequence Comparison with q-grams
Roberto Grossi,Costas S. Iliopoulos,Robert Mercaş,Robert Mercaş,Nadia Pisanti,Solon P. Pissis,Ahmad Retha,Fatima Vayani +7 more
TL;DR: A new distance measure based on q-grams is introduced, and it is shown how it can be computed efficiently for circular sequence comparison, while maintaining an accuracy very competitive to the state of the art.
Book ChapterDOI
Online Algorithms on Antipowers and Antiperiods
Mai Alzamel,Alessio Conte,Daniele Greco,Veronica Guerrini,Costas S. Iliopoulos,Nadia Pisanti,Nicola Prezza,Giulia Punzi,Giovanna Rosone +8 more
TL;DR: This paper proposes new arrays that compactly and incrementally store antiperiods and antipowers as the word grows, obtaining in the process this information for all the word’s prefixes, and shows how to compute those arrays online in \(O(n\log n) space, time, and \(o(n^\epsilon )\) delay per character.
Journal ArticleDOI
Approximate Musical Evolution
TL;DR: This work considers the ``evolutionary chain problem'': the problem of computing a chain of all ``motif'' recurrences, each of which is a transformation of (``similar''to) the original motif, but each ofWhich is progressively further from the original.
Journal ArticleDOI
Property Suffix Array with Applications in Indexing Weighted Sequences
TL;DR: The suffix array is one of the most prevalent data structures for string indexing; it stores the lexicographically sorted list of suffixes of a given string.