Följ
Panagiotis Charalampopoulos
Titel
Citeras av
Citeras av
År
Dynamic and Internal Longest Common Substring
A Amir, P Charalampopoulos, SP Pissis, J Radoszewski
Algorithmica 82 (12), 3707-3743, 2020
30*2020
On avoided words, absent words, and their application to biological sequence analysis
Y Almirantis, P Charalampopoulos, J Gao, CS Iliopoulos, M Mohamed, ...
Algorithms for Molecular Biology 12 (1), 1-12, 2017
292017
Almost optimal distance oracles for planar graphs
P Charalampopoulos, P Gawrychowski, S Mozes, O Weimann
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
262019
Longest Common Factor After One Edit Operation
A Amir, P Charalampopoulos, CS Iliopoulos, SP Pissis, J Radoszewski
International Symposium on String Processing and Information Retrieval, 14-26, 2017
212017
Longest Common Prefixes with k-Errors and Applications
LAK Ayad, C Barton, P Charalampopoulos, CS Iliopoulos, SP Pissis
International Symposium on String Processing and Information Retrieval, 27-41, 2018
192018
Alignment-free sequence comparison using absent words
P Charalampopoulos, M Crochemore, G Fici, R Mercaş, SP Pissis
Information and Computation 262, 57-68, 2018
182018
Linear-Time Algorithm for Long LCF with Mismatches
P Charalampopoulos, M Crochemore, CS Iliopoulos, T Kociumaka, ...
arXiv preprint arXiv:1802.06369, 2018
182018
Property suffix array with applications in indexing weighted sequences
P Charalampopoulos, CS Iliopoulos, C Liu, SP Pissis
Journal of Experimental Algorithmics (JEA) 25, 1-16, 2020
16*2020
Repetition Detection in a Dynamic String
A Amir, I Boneh, P Charalampopoulos, E Kondratovsky
27th Annual European Symposium on Algorithms (ESA 2019), 2019
162019
Faster approximate pattern matching: A unified approach
P Charalampopoulos, T Kociumaka, P Wellnitz
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
152020
Exact distance oracles for planar graphs with failing vertices
P Charalampopoulos, S Mozes, B Tebeka
ACM Transactions on Algorithms (TALG) 18 (2), 1-23, 2022
142022
Dynamic Longest Common Substring in Polylogarithmic Time
P Charalampopoulos, P Gawrychowski, K Pokorski
arXiv preprint arXiv:2006.02408, 2020
142020
On Extended Special Factors of a Word
P Charalampopoulos, M Crochemore, SP Pissis
International Symposium on String Processing and Information Retrieval, 131-138, 2018
112018
Internal dictionary matching
P Charalampopoulos, T Kociumaka, M Mohamed, J Radoszewski, ...
Algorithmica 83 (7), 2142-2169, 2021
102021
Dynamic String Alignment
P Charalampopoulos, T Kociumaka, S Mozes
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
102020
Faster algorithms for 1-mappability of a sequence
M Alzamel, P Charalampopoulos, CS Iliopoulos, SP Pissis, ...
Theoretical Computer Science 812, 2-12, 2020
92020
Palindromic decompositions with gaps and errors
M Adamczyk, M Alzamel, P Charalampopoulos, J Radoszewski
International Journal of Foundations of Computer Science 29 (08), 1311-1329, 2018
92018
How to answer a small batch of RMQs or LCA queries in practice
M Alzamel, P Charalampopoulos, CS Iliopoulos, SP Pissis
International Workshop on Combinatorial Algorithms, 343-355, 2017
92017
Longest Common Prefixes with k-Mismatches and Applications
H Alamro, LAK Ayad, P Charalampopoulos, CS Iliopoulos, SP Pissis
International Conference on Current Trends in Theory and Practice of …, 2018
82018
Efficient computation of sequence mappability
M Alzamel, P Charalampopoulos, CS Iliopoulos, T Kociumaka, SP Pissis, ...
International Symposium on String Processing and Information Retrieval, 12-26, 2018
72018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20