Solon Pissis
- Full Name
- Dr. S. Pissis
- Function(s)
- Scientific Staff Member
- Solon.Pissis@cwi.nl
- Telephone
- +31 20 592 4263
- Room
- M242
- Department(s)
- Life Sciences and Health
- Homepage
- https://homepages.cwi.nl/~solon/
Biography
Solon Pissis read Computer Science at the Department of Informatics and Telecommunications of the University of Athens (2003-2007) before completing his M.Sc in High-Performance Computing at the University of Edinburgh (2007-2008). He obtained his Ph.D in Computer Science from King's College London (2008-2012). He also holds a Postgraduate Certificate in Academic Practice in Higher Education from King's College London (2015-2016). He was a Research Associate in the Florida Museum of Natural History at the University of Florida and a Visiting Scientist in the Scientific Computing group at the Heidelberg Institute for Theoretical Studies (2012-2013). He was appointed Lecturer (2013) and then Senior Lecturer (2018) in Computer Science in the Department of Informatics at King's College London. In 2019 he joined the Life Sciences and Health research group at CWI, where he leads the Algorithms and Data Structures for Sequence Analysis subgroup. In 2020, he joined the Faculty of Science, Bioinformatics at the Vrije Universiteit Amsterdam as (part-time) Associate Professor.Research
His area of research within computer science is algorithms and data structures. Research topics he is interested in include algorithms and data structures on strings and graphs for pattern matching, indexing, comparison, and finding regularities. Applications thereof he is interested in include data mining, bioinformatics, data compression, and information retrieval. For more details, see the subgroup's webpage.
Publications
-
Bernardini, G, Chen, H, Loukides, G, Pissis, S, Stougie, L, & Sweering, M.J.M. (2022). Making de Bruijn graphs Eulerian. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.CPM.2022.12
-
Charalampopoulos, P, Pissis, S, & Radoszewski, J. (2022). Longest palindromic substring in sublinear time. In Leibniz International Proceedings in Informatics. doi:10.4230/LIPIcs.CPM.2022.20
-
Bernardini, G, Conte, A., Gabory, E. (Esteban), Grossi, R, Loukides, G, Pissis, S, … Sweering, M.J.M. (2022). On Strings Having the Same Length-k Substrings. In 33rd Annual Symposium on Combinatorial Pattern Matching (pp. 16:1–16:17). doi:10.4230/LIPIcs.CPM.2022.16
-
Loukides, G, & Pissis, S. (2022). All-pairs suffix/prefix in optimal time using Aho-Corasick space. Information Processing Letters. doi:10.1016/j.ipl.2022.106275
-
Badkobeh, G, Charalampopoulos, P, Kosolobov, D, & Pissis, S. (2022). Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science. doi:10.1016/j.tcs.2022.04.029
-
Bernardini, G, Conte, A., Gourdel, G., Grossi, R, Loukides, G, Pisanti, N, … Sweering, M.J.M. (2022). Hide and mine in strings: Hardness, algorithms, and experiments. IEEE Transactions on Knowledge and Data Engineering. doi:10.1109/TKDE.2022.3158063
-
Zhong, H, Loukides, G, & Pissis, S. (2022). Clustering sequence graphs. Data & Knowledge Engineering, 138, 101981.1–101981.21. doi:10.1016/j.datak.2022.101981
-
Charalampopoulos, P, Iliopoulos, C.S, Kociumaka, T, Pissis, S, Radoszewski, J, & Straszyński, J. (2022). Efficient computation of sequence mappability. Algorithmica. doi:10.1007/s00453-022-00934-y
-
Chen, H, Dong, C, Fan, L, Loukides, G, Pissis, S, & Stougie, L. (2021). Differentially Private string sanitization for frequency-based mining tasks. In Proceedings of the 21st IEEE International Conference on Data Mining, ICDM 2021 (pp. 41–50). doi:10.1109/ICDM51629.2021.00014
-
Bernardini, G, Chen, H, Fici, G, Loukides, G, & Pissis, S. (2021). Reverse-safe data structures for text indexing. In Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 199–213). doi:10.1145/3461698
Current projects with external funding
-
Algorithms for PAngenome Computational Analysis (ALPACA)
-
Pan-genome Graph Algorithms and Data Integration (PANGAIA)