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
Faster index for property matching
TL;DR: This paper revisits the Property Matching problem studied by Amir et al. and presents a better indexing scheme for the problem and develops IDS_PIP, a data structure that can be built on either a suffix tree or a suffix array and retains the capability of answering normal pattern matching queries.
Proceedings ArticleDOI
Mapping uniquely occurring short sequences derived from high throughput technologies to a reference genome
Pavlos Antoniou,J.W. Daykin,Costas S. Iliopoulos,Derrick G. Kourie,Laurent Mouchard,Solon P. Pissis +5 more
TL;DR: This paper defines and solves the Massive Exact Unique Pattern Matching problem in genomes, and presents a practical algorithm for addressing the problem of efficiently mapping uniquely occuring short reads to a reference genome.
Book ChapterDOI
Average-Case Optimal Approximate Circular String Matching
TL;DR: A new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time \(\mathcal {O}(n(k + \log m) /m)\).
Journal ArticleDOI
Finite automata based algorithms on subsequences and supersequences of degenerate strings
TL;DR: In this article, the authors present linear-time algorithms for the construction of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS), Shortest Common Supersequence (SCS), and Constrained LCS (CLCS) problems for degenerate strings.