P
Panagiotis Charalampopoulos
Researcher at King's College London
Publications - 76
Citations - 453
Panagiotis Charalampopoulos is an academic researcher from King's College London. The author has contributed to research in topics: Substring & String (computer science). The author has an hindex of 10, co-authored 68 publications receiving 307 citations. Previous affiliations of Panagiotis Charalampopoulos include Interdisciplinary Center Herzliya & University of Warsaw.
Papers
More filters
Proceedings ArticleDOI
Almost optimal distance oracles for planar graphs
TL;DR: In this article, the tradeoff between space and query time for exact distance oracles in directed weighted planar graphs was studied and the tradeoffs were almost optimal in the sense that they are within polylogarithmic, subpolynomial or arbitrarily small polynomial factors from the naive linear space.
Journal ArticleDOI
On avoided words, absent words, and their application to biological sequence analysis.
Yannis Almirantis,Panagiotis Charalampopoulos,Jia Gao,Costas S. Iliopoulos,Manal Mohamed,Solon P. Pissis,Dimitris Polychronopoulos +6 more
TL;DR: A linear-time and linear-space algorithm for the computation of avoided words of length k in a given sequence x and a tight asymptotic upper bound for the number ofρ-avoided words over an integer alphabet and the expected length of the longest one.
Journal ArticleDOI
Dynamic and Internal Longest Common Substring
Amihood Amir,Panagiotis Charalampopoulos,Solon P. Pissis,Jakub Radoszewski,Jakub Radoszewski +4 more
TL;DR: The first solution to the fully dynamic LCS problem requiring sublinear time in n per edit operation is presented, and dynamic sublinear-time algorithms for both the longest palindrome and Lyndon factorization of a string after a single edit operation are developed.
Book ChapterDOI
Longest Common Factor After One Edit Operation
Amihood Amir,Panagiotis Charalampopoulos,Costas S. Iliopoulos,Solon P. Pissis,Jakub Radoszewski,Jakub Radoszewski +5 more
TL;DR: An algorithm is presented that preprocesses two strings S and T in order to answer the following type of queries and constructs in \(\mathcal {O}(n \log ^4 n)\) expected time a data structure that answers such queries in \(\ mathcal{O}(\log ^3 n) time per query.
Posted Content
Faster Approximate Pattern Matching: A Unified Approach
TL;DR: A unified framework for approximate pattern matching for both considered distances is obtained and meta-algorithms that only rely on a small set of primitive operations are provided that provide generality with results for the fully compressed setting, the dynamic setting, and the standard setting.