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 trees for pattern matching, indexing, comparison, and finding regularities. Applications thereof he is interested in include bioinformatics, data mining, data compression, and information retrieval. For more details, see the subgroup's webpage.
Publications
-
Charalampopoulos, P, Kociumaka, T, Pissis, S, Radoszewski, J, Rytter, W, Straszyński, J, … Zuba, W. (2021). Circular pattern matching with k mismatches. Journal of Computer and System Sciences, 115, 73–85. doi:10.1016/j.jcss.2020.07.003
-
Amir, A, Charalampopoulos, P, Pissis, S, & Radoszewski, J. (2020). Dynamic and Internal Longest Common Substring. Algorithmica, 82(12), 3707–3743. doi:10.1007/s00453-020-00744-0
-
Abedin, P, Ganguly, A, Pissis, S, & Thankachan, S.V. (2020). Efficient data structures for range shortest unique substring queries†. Algorithms, 13(11), 1–9. doi:10.3390/a13110276
-
Ayad, L.A.K, Dourou, A.-M, Arhondakis, S, & Pissis, S. (2020). IsoXpressor: A Tool to Assess Transcriptional Activity within Isochores. Genome biology and evolution, 12(9), 1573–1578. doi:10.1093/gbe/evaa171
-
Alamro, H, Alzamel, M, Iliopoulos, C.S, Pissis, S, Sung, W.-K, & Watts, S. (2020). Efficient Identification of k -Closed Strings. International Journal of Foundations of Computer Science, 31(5), 595–610. doi:10.1142/S0129054120500288
-
Bernardini, G, Loukides, G, Pissis, S, Sweering, M.J.M, Chen, H, Pisanti, N, & Stougie, L. (2020). String Sanitization Under Edit Distance. In Leibniz International Proceedings in Informatics (pp. 7:1–7:14). doi:10.4230/LIPIcs.CPM.2020.
-
Charalampopoulos, P, Pissis, S, Radoszewski, J, Waleń, T, & Zuba, W. (2020). Unary Words Have the Smallest Levenshtein k-Neighbourhoods. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.CPM.2020.10
-
Ayad, L.A.K, Charalampopoulos, P, & Pissis, S. (2020). SMART: SuperMaximal approximate repeats tool. Bioinformatics, 36(8), 2589–2591. doi:10.1093/bioinformatics/btz953
-
Ayad, L.A.K, Bernardini, G, Grossi, R, Iliopoulos, C.S, Pisanti, N, Pissis, S, & Rosone, G. (2020). Longest property-preserved common factor: A new string-processing framework. Theoretical Computer Science, 812, 244–251. doi:10.1016/j.tcs.2020.02.012
-
Bernardini, G, Chen, H, Fici, G, Loukides, G, & Pissis, S. (2020). Reverse-safe data structures for text indexing. In Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 199–213).
Current projects with external funding
-
Algorithms for PAngenome Computational Analysis (ALPACA)
-
Pan-genome Graph Algorithms and Data Integration (PANGAIA)