Solon Pissis
- Full Name
- Dr. S. Pissis
- Function(s)
- Scientific Staff Member
- Solon.Pissis@cwi.nl
- Telephone
- +31 20 592 4263
- Room
- M245
- 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.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. He leads the Algorithms and Data Structures for Sequence Analysis subgroup.
Publications
-
Abedin, P, Ganguly, A, Pissis, S, & Thankachan, S.V. (2019). Range Shortest Unique Substring queries. In Proceedings of the International Symposium on String Processing and Information Retrieval (pp. 258–266). doi:10.1007/978-3-030-32686-9_18
-
Charalampopoulos, P, Kociumaka, T, Pissis, S, Radoszewski, J, Rytter, W, Straszyński, J, … Zuba, W. (2019). Weighted Shortest Common Supersequence problem revisited. In Proceedings of the International Symposium on String Processing and Information Retrieval (pp. 221–238). doi:10.1007/978-3-030-32686-9_16
-
Amir, A, Charalampopoulos, P, Pissis, S, & Radoszewski, J. (2019). Longest common substring made fully dynamic. In Leibniz International Proceedings in Informatics. doi:10.4230/LIPIcs.ESA.2019.6
-
Barton, C, Kociumaka, T, Liu, C, Pissis, S, & Radoszewski, J. (2019). Indexing weighted sequences: Neat and efficient. Information and Computation. doi:10.1016/j.ic.2019.104462
-
Bernardini, G, Pisanti, N, Pissis, S, & Rosone, G. (2019). Approximate pattern matching on elastic-degenerate text. Theoretical Computer Science. doi:10.1016/j.tcs.2019.08.012
-
Charalampopoulos, P, Kociumaka, T, Pissis, S, Radoszewski, J, Rytter, W, Straszyński, J, … Zuba, W. (2019). Circular pattern matching with k mismatches. In Proceedings of Fundamentals of Computation Theory (pp. 213–228). doi:10.1007/978-3-030-25027-0_15
-
Bernardini, G, Gawrychowski, P, Pisanti, N, Pissis, S, & Rosone, G. (2019). Even faster elastic-degenerate string matching via fast matrix multiplication. In International Colloquium on Automata, Languages, and Programming (pp. 21:1–21:15). doi:10.4230/LIPIcs.ICALP.2019.21
-
Alzamel, M, Charalampopoulos, P, Iliopoulos, C.S, Pissis, S, Radoszewski, J, & Sung, W.-K. (2019). Faster algorithms for 1-mappability of a sequence. Theoretical Computer Science. doi:10.1016/j.tcs.2019.04.026
-
Ayad, Lorraine, Badkobeh, G, Fici, G, Heliou, A, & Pissis, S. (2019). Constructing antidictionaries in output-sensitive space. In Data Compression Conference Proceedings (pp. 538–547). doi:10.1109/DCC.2019.00062
-
Ganguly, A, Hon, W.-K, Huang, Y.-A, Pissis, S, Shah, R, & Thankachan, S.V. (2019). Parameterized text indexing with one wildcard. In Data Compression Conference Proceedings (pp. 152–161). doi:10.1109/DCC.2019.00023