Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. - Pavlos Antoniou; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (IJCBS, 2009)

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. - Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (PARCO, 2009)

Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. - Costas S. Iliopoulos; Mirka Miller; Solon P. Pissis (Stringology, 2009)

Algorithms for mapping short degenerate and weighted sequences to a reference genome. - Pavlos Antoniou; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (Int. J. Comput. Biol. Drug Des., 2009)

REAL: an efficient REad ALigner for next generation sequencing reads. - Kimon Frousios; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis; German Tischler (BCB, 2010)

An algorithm for mapping short reads to a dynamically changing genomic sequence. - Tomás Flouri; Jan Holub 001; Costas S. Iliopoulos; Solon P. Pissis (BIBM, 2010)

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. - Maxime Crochemore; Costas S. Iliopoulos; Solon P. Pissis (Algorithms and Applications, 2010)

Cover Array String Reconstruction. - Maxime Crochemore; Costas S. Iliopoulos; Solon P. Pissis; German Tischler (CPM, 2010)

DynMap: mapping short reads to multiple related genomes. - Tomás Flouri; Costas S. Iliopoulos; Solon P. Pissis (BCB, 2011)

Approximate string-matching with a single gap for sequence alignment. - Tomás Flouri; Kunsoo Park; Kimon Frousios; Solon P. Pissis; Costas S. Iliopoulos; German Tischler (BCB, 2011)

On the Right-Seed Array of a String. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (COCOON, 2011)

Efficient Seeds Computation Revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (CPM, 2011)

Tree Indexing by Pushdown Automata and Repeats of Subtrees. - Tomás Flouri; Jan Janousek; Borivoj Melichar; Costas S. Iliopoulos; Solon P. Pissis (FedCSIS, 2011)

Computing All Subtree Repeats in Ordered Ranked Trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (SPIRE, 2011)

Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. - Oudone Phanalasy; Mirka Miller; Costas S. Iliopoulos; Solon P. Pissis; Elaheh Vaezpour (Math. Comput. Sci., 2011)

Libgapmis: An ultrafast library for short-read single-gap alignment. - Nikolaos Alachiotis 001; Simon A. Berger; Tomás Flouri; Solon P. Pissis; Alexandros Stamatakis (BIBM Workshops, 2012)

Detection of fixed length web spambot using REAL (read aligner). - Mourad Elloumi; Pedram Hayati; Costas S. Iliopoulos; Solon P. Pissis; Arfaat Shah (CUBE, 2012)

GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. - Tomás Flouri; Costas S. Iliopoulos; Kunsoo Park; Solon P. Pissis (AIAI (2), 2012)

New and Efficient Approaches to the Quasiperiodic Characterisation of a String. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; William F. Smyth; Wojciech Tyczynski (Stringology, 2012)

Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome. - Costas S. Iliopoulos; Mirka Miller; Solon P. Pissis (Int. J. Found. Comput. Sci., 2012)

Computing all subtree repeats in ordered trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (Inf. Process. Lett., 2012)

On left and right seeds of a string. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (J. Discrete Algorithms, 2012)

Tree template matching in ranked ordered trees by pushdown automata. - Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (J. Discrete Algorithms, 2012)

An algorithm for mapping short reads to a dynamically changing genomic sequence. - Costas S. Iliopoulos; Derrick G. Kourie; Laurent Mouchard; Themba K. Musombuka; Solon P. Pissis; Corné de Ridder (J. Discrete Algorithms, 2012)

GapsMis: flexible sequence alignment with a bounded number of gaps. - Carl Barton; Tomás Flouri; Costas S. Iliopoulos; Solon P. Pissis (BCB, 2013)

MoTeX: A word-based HPC tool for MoTif eXtraction. - Solon P. Pissis; Alexandros Stamatakis; Pavlos Pavlidis (BCB, 2013)

A Generic Vectorization Scheme and a GPU Kernel for the Phylogenetic Likelihood Library. - Fernando Izquierdo-Carrasco; Nikolaos Alachiotis 001; Simon A. Berger; Tomás Flouri; Solon P. Pissis; Alexandros Stamatakis (IPDPS Workshops, 2013)

An Optimal Algorithm for Computing All Subtree Repeats in Trees. - Tomás Flouri; Kassian Kobert; Solon P. Pissis; Alexandros Stamatakis (IWOCA, 2013)

Accelerating String Matching on MIC Architecture for Motif Extraction. - Solon P. Pissis; Christian Goll; Pavlos Pavlidis; Alexandros Stamatakis (PPAM (2), 2013)

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2013)

libgapmis: extending short-read alignments. - Nikolaos Alachiotis 001; Simon A. Berger; Tomás Flouri; Solon P. Pissis; Alexandros Stamatakis (BMC Bioinform., 2013)

Order-Preserving Suffix Trees and Their Algorithmic Applications - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

Querying highly similar sequences. - Carl Barton; Mathieu Giraud; Costas S. Iliopoulos; Thierry Lecroq; Laurent Mouchard; Solon P. Pissis (Int. J. Comput. Biol. Drug Des., 2013)

Tree template matching in unranked ordered trees. - Michalis Christou; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis; Jan Zdárek (J. Discrete Algorithms, 2013)

Efficient seed computation revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (Theor. Comput. Sci., 2013)

Enhanced string covering. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; W. F. Smyth; Wojciech Tyczynski (Theor. Comput. Sci., 2013)

Detection of Web Spambot in the Presence of Decoy Actions. - Vida Ghanaei; Costas S. Iliopoulos; Solon P. Pissis (BDCloud, 2014)

Optimal Computation of all Repetitions in a Weighted String. - Carl Barton; Solon P. Pissis (ICABD, 2014)

Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis; William F. Smyth (IWOCA, 2014)

Fast algorithms for approximate circular string matching. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis (Algorithms Mol. Biol., 2014)

Optimal computation of all tandem repeats in a weighted sequence. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis (Algorithms Mol. Biol., 2014)

Linear-time computation of minimal absent words using suffix array. - Carl Barton; Alice Héliou; Laurent Mouchard; Solon P. Pissis (BMC Bioinform., 2014)

MoTeX-II: structured MoTif eXtraction from large-scale datasets. - Solon P. Pissis (BMC Bioinform., 2014)

Extending alignments with k-mismatches and ℓ-gaps. - Carl Barton; Costas S. Iliopoulos; Inbok Lee; Laurent Mouchard; Kunsoo Park; Solon P. Pissis (Theor. Comput. Sci., 2014)

Linear-Time Computation of Prefix Table for Weighted Strings. - Carl Barton; Solon P. Pissis (WORDS, 2015)

Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance and Applications. - Solon P. Pissis; Ahmad Retha (IPDPS Workshops, 2015)

Average-Case Optimal Approximate Circular String Matching. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis (LATA, 2015)

Parallelising the Computation of Minimal Absent Words. - Carl Barton; Alice Héliou; Laurent Mouchard; Solon P. Pissis (PPAM (2), 2015)

Circular Sequence Comparison with q-grams. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (WABI, 2015)

Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. - Carl Barton; Costas S. Iliopoulos; Ritu Kundu; Solon P. Pissis; Ahmad Retha; Fatima Vayani (SEA, 2015)

Fast Algorithm for Partial Covers in Words. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2015)

Linear-Time Superbubble Identification Algorithm. - Ljiljana Brankovic; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (CoRR, 2015)

Editorial. - Hideo Bannai; Solon P. Pissis (J. Discrete Algorithms, 2015)

Global and local sequence alignment with a bounded number of gaps. - Carl Barton; Tomás Flouri; Costas S. Iliopoulos; Solon P. Pissis (Theor. Comput. Sci., 2015)

On-Line Pattern Matching on Uncertain Sequences and Applications. - Carl Barton; Chang Liu 035; Solon P. Pissis (COCOA, 2016)

Efficient Index for Weighted Sequences. - Carl Barton; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (CPM, 2016)

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. - Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (LATIN, 2016)

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2016)

Optimal Computation of Avoided Words. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (WABI, 2016)

Circular sequence comparison: algorithms and applications. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (Algorithms Mol. Biol., 2016)

Erratum to: Circular sequence comparison: algorithms and applications. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (Algorithms Mol. Biol., 2016)

libFLASM: a software library for fixed-length approximate string matching. - Lorraine A. K. Ayad; Solon P. Pissis; Ahmad Retha (BMC Bioinform., 2016)

Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (CoRR, 2016)

Linear-time computation of prefix table for weighted strings & applications. - Carl Barton; Chang Liu 035; Solon P. Pissis (Theor. Comput. Sci., 2016)

Linear-time superbubble identification algorithm for genome assembly. - Ljiljana Brankovic; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (Theor. Comput. Sci., 2016)

Order-preserving indexing. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

Searching and Indexing Circular Patterns. - Costas S. Iliopoulos; Solon P. Pissis; M. Sohel Rahman (Algorithms for Next-Generation Sequencing Data, 2017)

On-Line Pattern Matching on Similar Texts. - Roberto Grossi; Costas S. Iliopoulos; Chang Liu 035; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Giovanna Rosone; Fatima Vayani; Luca Versari (CPM, 2017)

Efficient Computation of Palindromes in Sequences with Uncertainties. - Mai Alzamel; Jia Gao 001; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (EANN, 2017)

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. - Maxime Crochemore; Alice Héliou; Gregory Kucherov; Laurent Mouchard; Solon P. Pissis; Yann Ramusat (FCT, 2017)

How to Answer a Small Batch of RMQs or LCA Queries in Practice. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (IWOCA, 2017)

Efficient Pattern Matching in Elastic-Degenerate Texts. - Costas S. Iliopoulos; Ritu Kundu; Solon P. Pissis (LATA, 2017)

Longest Common Factor After One Edit Operation. - Amihood Amir; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (SPIRE, 2017)

Pattern Matching on Elastic-Degenerate Text with Errors. - Giulia Bernardini 001; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (SPIRE, 2017)

Optimal Computation of Overabundant Words. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (WABI, 2017)

Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. - Maxime Crochemore; Alexandre P. Francisco; Solon P. Pissis; Cátia Vaz (WABI, 2017)

On avoided words, absent words, and their application to biological sequence analysis. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (Algorithms Mol. Biol., 2017)

emMAW: computing minimal absent words in external memory. - Alice Héliou; Solon P. Pissis; Simon J. Puglisi (Bioinform., 2017)

Fast circular dictionary-matching algorithm. - Tanver Athar; Carl Barton; Widmer Bland; Jia Gao 001; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (Math. Struct. Comput. Sci., 2017)

A faster and more accurate heuristic for cyclic edit distance computation. - Lorraine A. K. Ayad; Carl Barton; Solon P. Pissis (Pattern Recognit. Lett., 2017)

Linear-Time Algorithm for Long LCF with k Mismatches. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2018)

Longest Unbordered Factor in Quasilinear Time. - Tomasz Kociumaka; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis (ISAAC, 2018)

Property Suffix Array with Applications. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (LATIN, 2018)

Longest Common Prefixes with k-Mismatches and Applications. - Hayam Alamro; Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SOFSEM, 2018)

Efficient Computation of Sequence Mappability. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (SPIRE, 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Carl Barton; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SPIRE, 2018)

Longest Property-Preserved Common Factor. - Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (SPIRE, 2018)

On Extended Special Factors of a Word. - Panagiotis Charalampopoulos; Maxime Crochemore; Solon P. Pissis (SPIRE, 2018)

Maximal Motif Discovery in a Sliding Window. - Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (SPIRE, 2018)

Degenerate String Comparison and Applications. - Mai Alzamel; Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (WABI, 2018)

Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line. - Solon P. Pissis; Ahmad Retha (SEA, 2018)

Crochemore's Partitioning on Weighted Strings and Applications. - Carl Barton; Solon P. Pissis (Algorithmica, 2018)

Fast phylogenetic inference from typing data. - João A. Carriço; Maxime Crochemore; Alexandre P. Francisco; Solon P. Pissis; Bruno Ribeiro-Gonçalves; Cátia Vaz (Algorithms Mol. Biol., 2018)

CNEFinder: finding conserved non-coding elements in genomes. - Lorraine A. K. Ayad; Solon P. Pissis; Dimitris Polychronopoulos (Bioinform., 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (CoRR, 2018)

Longest Common Factor Made Fully Dynamic. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (CoRR, 2018)

Preface. - Panagiotis Charalampopoulos; Maxime Crochemore; Solon P. Pissis (Fundam. Informaticae, 2018)

Alignment-free sequence comparison using absent words. - Panagiotis Charalampopoulos; Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (Inf. Comput., 2018)

Fast Average-Case Pattern Matching on Weighted Sequences. - Carl Barton; Chang Liu 035; Solon P. Pissis (Int. J. Found. Comput. Sci., 2018)

Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). - Maxime Crochemore; Solon P. Pissis (Theor. Comput. Sci., 2018)

Efficient algorithms for shortest partial seeds in words. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2018)

Parameterized Text Indexing with One Wildcard. - Arnab Ganguly 002; Wing-Kai Hon; Yu-An Huang; Solon P. Pissis; Rahul Shah 001; Sharma V. Thankachan (DCC, 2019)

Constructing Antidictionaries in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (DCC, 2019)

Longest Common Substring Made Fully Dynamic. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (ESA, 2019)

Circular Pattern Matching with k Mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (FCT, 2019)

Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. - Giulia Bernardini 001; Pawel Gawrychowski; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (ICALP, 2019)

String Sanitization: A Combinatorial Approach. - Giulia Bernardini 001; Huiping Chen; Alessio Conte; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (ECML/PKDD (1), 2019)

Range Shortest Unique Substring Queries. - Paniz Abedin; Arnab Ganguly 002; Solon P. Pissis; Sharma V. Thankachan (SPIRE, 2019)

Weighted Shortest Common Supersequence Problem Revisited. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2019)

On-line weighted pattern matching. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 2019)

Efficient enumeration of non-equivalent squares in partial words with few holes. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comb. Optim., 2019)

Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (Theory Comput. Syst., 2019)

On overabundant words and their application to biological sequence analysis. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (Theor. Comput. Sci., 2019)

Reverse-Safe Data Structures for Text Indexing. - Giulia Bernardini 001; Huiping Chen; Gabriele Fici; Grigorios Loukides; Solon P. Pissis (ALENEX, 2020)

String Sanitization Under Edit Distance. - Giulia Bernardini 001; Huiping Chen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2020)

Unary Words Have the Smallest Levenshtein k-Neighbourhoods. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Tomasz Walen; Wiktor Zuba (CPM, 2020)

Hide and Mine in Strings: Hardness and Algorithms. - Giulia Bernardini 001; Alessio Conte; Garance Gourdel; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giulia Punzi; Leen Stougie; Michelle Sweering (ICDM, 2020)

Dynamic and Internal Longest Common Substring. - Amihood Amir; Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (Algorithmica, 2020)

Efficient Data Structures for Range Shortest Unique Substring Queries. - Paniz Abedin; Arnab Ganguly 002; Solon P. Pissis; Sharma V. Thankachan (Algorithms, 2020)

SMART: SuperMaximal approximate repeats tool. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Solon P. Pissis (Bioinform., 2020)

Comparing Degenerate Strings. - Mai Alzamel; Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Fundam. Informaticae, 2020)

Indexing weighted sequences: Neat and efficient. - Carl Barton; Tomasz Kociumaka; Chang Liu 035; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 2020)

Absent words in a sliding window with applications. - Maxime Crochemore; Alice Héliou; Gregory Kucherov; Laurent Mouchard; Solon P. Pissis; Yann Ramusat (Inf. Comput., 2020)

Efficient Identification of k-Closed Strings. - Hayam Alamro; Mai Alzamel; Costas S. Iliopoulos; Solon P. Pissis; Wing-Kin Sung; Steven Watts (Int. J. Found. Comput. Sci., 2020)

Property Suffix Array with Applications in Indexing Weighted Sequences. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (ACM J. Exp. Algorithmics, 2020)

Faster algorithms for 1-mappability of a sequence. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski; Wing-Kin Sung (Theor. Comput. Sci., 2020)

Longest property-preserved common factor: A new string-processing framework. - Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Theor. Comput. Sci., 2020)

Approximate pattern matching on elastic-degenerate text. - Giulia Bernardini 001; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Theor. Comput. Sci., 2020)

Constructing Strings Avoiding Forbidden Substrings. - Giulia Bernardini 001; Alberto Marchetti-Spaccamela; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2021)

Internal Shortest Absent Word Queries. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Solon P. Pissis (CPM, 2021)

String Sanitization Under Edit Distance: Improved and Generalized. - Takuya Mieno; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2021)

Faster Algorithms for Longest Common Substring. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (ESA, 2021)

Bidirectional String Anchors: A New String Sampling Mechanism. - Grigorios Loukides; Solon P. Pissis (ESA, 2021)

Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. - Alessio Conte; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giulia Punzi (FCT, 2021)

Differentially Private String Sanitization for Frequency-Based Mining Tasks. - Huiping Chen; Changyu Dong; Liyue Fan; Grigorios Loukides; Solon P. Pissis; Leen Stougie (ICDM, 2021)

Pattern Masking for Dictionary Matching. - Panagiotis Charalampopoulos; Huiping Chen; Peter Christen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski (ISAAC, 2021)

On Breaking Truss-Based Communities. - Huiping Chen; Alessio Conte; Roberto Grossi; Grigorios Loukides; Solon P. Pissis; Michelle Sweering (KDD, 2021)

IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. - Hayam Alamro; Mai Alzamel; Costas S. Iliopoulos; Solon P. Pissis; Steven Watts (BMC Bioinform., 2021)

String Sampling with Bidirectional String Anchors. - Grigorios Loukides; Solon P. Pissis; Michelle Sweering (CoRR, 2021)

Efficient pattern matching in elastic-degenerate strings. - Costas S. Iliopoulos; Ritu Kundu; Solon P. Pissis (Inf. Comput., 2021)

Circular pattern matching with k mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (J. Comput. Syst. Sci., 2021)

Reverse-Safe Text Indexing. - Giulia Bernardini 001; Huiping Chen; Gabriele Fici; Grigorios Loukides; Solon P. Pissis (ACM J. Exp. Algorithmics, 2021)

Constructing Antidictionaries of Long Texts in Output-Sensitive Space. - Lorraine A. K. Ayad; Golnaz Badkobeh; Gabriele Fici; Alice Héliou; Solon P. Pissis (Theory Comput. Syst., 2021)

Influence maximization in the presence of vulnerable nodes: A ratio perspective. - Huiping Chen; Grigorios Loukides; Solon P. Pissis; Hau Chan (Theor. Comput. Sci., 2021)

Combinatorial Algorithms for String Sanitization. - Giulia Bernardini 001; Huiping Chen; Alessio Conte; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone; Michelle Sweering (ACM Trans. Knowl. Discov. Data, 2021)

On Strings Having the Same Length- k Substrings. - Giulia Bernardini 001; Alessio Conte; Estéban Gabory; Roberto Grossi; Grigorios Loukides; Solon P. Pissis; Giulia Punzi; Michelle Sweering (CPM, 2022)

Making de Bruijn Graphs Eulerian. - Giulia Bernardini 001; Huiping Chen; Grigorios Loukides; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2022)

Longest Palindromic Substring in Sublinear Time. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski (CPM, 2022)

Approximate Circular Pattern Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Solon P. Pissis; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (ESA, 2022)

Jaccard Median for Ego-network Segmentation. - Haodi Zhong; Grigorios Loukides; Alessio Conte; Solon P. Pissis (ICDM, 2022)

Elastic-Degenerate String Matching with 1 Error. - Giulia Bernardini 001; Estéban Gabory; Solon P. Pissis; Leen Stougie; Michelle Sweering; Wiktor Zuba (LATIN, 2022)

Efficient Computation of Sequence Mappability. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (Algorithmica, 2022)

Clustering sequence graphs. - Haodi Zhong; Grigorios Loukides; Solon P. Pissis (Data Knowl. Eng., 2022)

All-pairs suffix/prefix in optimal time using Aho-Corasick space. - Grigorios Loukides; Solon P. Pissis (Inf. Process. Lett., 2022)

Elastic-Degenerate String Matching via Fast Matrix Multiplication. - Giulia Bernardini 001; Pawel Gawrychowski; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (SIAM J. Comput., 2022)

Internal shortest absent word queries in constant time and linear space. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Dmitry Kosolobov; Solon P. Pissis (Theor. Comput. Sci., 2022)

Clustering Demographics and Sequences of Diagnosis Codes. - Haodi Zhong; Grigorios Loukides; Solon P. Pissis (IEEE J. Biomed. Health Informatics, 2022)

Symbolic Regression is NP-hard. - Marco Virgolin; Solon P. Pissis (Trans. Mach. Learn. Res., 2022)

Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. - Estéban Gabory; Njagi Moses Mwaniki; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski; Michelle Sweering; Wiktor Zuba (CPM, 2023)

Suffix-Prefix Queries on a Dictionary. - Grigorios Loukides; Solon P. Pissis; Sharma V. Thankachan; Wiktor Zuba (CPM, 2023)

Substring Complexity in Sublinear Space. - Giulia Bernardini 001; Gabriele Fici; Pawel Gawrychowski; Solon P. Pissis (ISAAC, 2023)

Heavy Nodes in a Small Neighborhood: Algorithms and Applications. - Huiping Chen; Grigorios Loukides; Robert Gwadera; Solon P. Pissis (SDM, 2023)

Frequency-Constrained Substring Complexity. - Solon P. Pissis; Michael Shekelyan; Chang Liu 035; Grigorios Loukides (SPIRE, 2023)

Text Indexing for Long Patterns: Anchors are All you Need. - Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis (Proc. VLDB Endow., 2023)

Hide and Mine in Strings: Hardness, Algorithms, and Experiments. - Giulia Bernardini 001; Alessio Conte; Garance Gourdel; Roberto Grossi; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Giulia Punzi; Leen Stougie; Michelle Sweering (IEEE Trans. Knowl. Data Eng., 2023)

Maximal degenerate palindromes with gaps and mismatches. - Mai Alzamel; Christopher Hampson; Costas S. Iliopoulos; Zara Lim; Solon P. Pissis; Dimitrios Vlachakis; Steven Watts (Theor. Comput. Sci., 2023)

Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search. - Grigorios Loukides; Solon P. Pissis; Michelle Sweering (IEEE Trans. Knowl. Data Eng., 2023)

Minimizing the Minimizers via Alphabet Reordering. - Hilde Verbeek 001; Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis (CPM, 2024)

Connecting de Bruijn Graphs. - Giulia Bernardini 001; Huiping Chen; Inge Li Gørtz; Christoffer Krogh; Grigorios Loukides; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2024)

Space-Efficient Indexes for Uncertain Strings. - Estéban Gabory; Chang Liu 035; Grigorios Loukides; Solon P. Pissis; Wiktor Zuba (ICDE, 2024)

Scalable Order-Preserving Pattern Mining. - Ling Li 012; Wiktor Zuba; Grigorios Loukides; Solon P. Pissis; Maria Matsangidou (ICDM, 2024)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast. - Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis; Hilde Verbeek 001 (LATIN (1), 2024)

Approximate Suffix-Prefix Dictionary Queries. - Wiktor Zuba; Grigorios Loukides; Solon P. Pissis; Sharma V. Thankachan (MFCS, 2024)

Utility-Oriented String Mining. - Giulia Bernardini 001; Huiping Chen; Alessio Conte; Roberto Grossi; Veronica Guerrini; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis (SDM, 2024)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time. - Philip Bille; Inge Li Gørtz; Moshe Lewenstein; Solon P. Pissis; Eva Rotenberg; Teresa Anna Steiner (STACS, 2024)

Approximate Circular Pattern Matching Under Edit Distance. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (STACS, 2024)

Size-Constrained Weighted Ancestors with Applications. - Philip Bille; Yakov Nekrich; Solon P. Pissis (SWAT, 2024)

Pangenome comparison via ED strings. - Estéban Gabory; Njagi Moses Mwaniki; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski; Michelle Sweering; Wiktor Zuba (Frontiers Bioinform., 2024)

Pattern Masking for Dictionary Matching: Theory and Practice. - Panagiotis Charalampopoulos; Huiping Chen; Peter Christen; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski (Algorithmica, 2024)

On Breaking Truss-based and Core-based Communities. - Huiping Chen; Alessio Conte; Roberto Grossi; Grigorios Loukides; Solon P. Pissis; Michelle Sweering (ACM Trans. Knowl. Discov. Data, 2024)

Ego-Network Segmentation via (Weighted) Jaccard Median. - Haodi Zhong; Grigorios Loukides; Alessio Conte; Solon P. Pissis (IEEE Trans. Knowl. Data Eng., 2024)

Elastic-Degenerate String Matching with 1 Error or Mismatch. - Giulia Bernardini 001; Estéban Gabory; Solon P. Pissis; Leen Stougie; Michelle Sweering; Wiktor Zuba (Theory Comput. Syst., 2024)

On String and Graph Sanitization. - Giulia Bernardini 001; Huiping Chen; Grigorios Loukides; Solon P. Pissis (From Strings to Graphs, and Back Again, 2025)

Faster Approximate Elastic-Degenerate String Matching - Part B. - Pawel Gawrychowski; Adam Górkiewicz; Pola Marciniak; Solon P. Pissis; Karol Pokorski (CPM, 2025)

Faster Approximate Elastic-Degenerate String Matching - Part A. - Solon P. Pissis; Jakub Radoszewski; Wiktor Zuba (CPM, 2025)

Shortest Undirected Paths in de Bruijn Graphs. - Wiktor Zuba; Oded Lachish; Solon P. Pissis (CPM, 2025)

Indexing Strings with Utilities. - Giulia Bernardini 001; Huiping Chen; Alessio Conte; Roberto Grossi; Veronica Guerrini; Grigorios Loukides; Nadia Pisanti; Solon P. Pissis (ICDE, 2025)

Optimal prefix-suffix queries with applications. - Solon P. Pissis (SOSA, 2025)

U-Index: A Universal Indexing Framework for Matching Long Patterns. - Lorraine A. K. Ayad; Gabriele Fici; Ragnar Groot Koerkamp; Grigorios Loukides; Rob Patro; Giulio Ermanno Pibiri; Solon P. Pissis (SEA, 2025)

Elastic-degenerate string comparison. - Estéban Gabory; Njagi Moses Mwaniki; Nadia Pisanti; Solon P. Pissis; Jakub Radoszewski; Michelle Sweering; Wiktor Zuba (Inf. Comput., 2025)

Subsequence covers of words. - Panagiotis Charalampopoulos; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (Theor. Comput. Sci., 2025)

Minimizers in Semi-Dynamic Strings. - Wiktor Zuba; Oded Lachish; Solon P. Pissis (CoRR, 2025)

Faster ED-String Matching with k Mismatches. - Pawel Gawrychowski; Adam Górkiewicz; Pola Marciniak; Solon P. Pissis; Karol Pokorski (CoRR, 2025)

Missing value replacement in strings and applications. - Giulia Bernardini 001; Chang Liu 035; Grigorios Loukides; Alberto Marchetti-Spaccamela; Solon P. Pissis; Leen Stougie; Michelle Sweering (Data Min. Knowl. Discov., 2025)

Heavy Nodes in a Small Neighborhood: Exact and Peeling Algorithms With Applications. - Ling Li 012; Hilde Verbeek 001; Huiping Chen; Grigorios Loukides; Robert Gwadera; Leen Stougie; Solon P. Pissis (IEEE Trans. Knowl. Data Eng., 2025)

Resilient Pattern Mining. - Pengxin Bian; Panagiotis Charalampopoulos; Lorraine A. K. Ayad; Manal Mohamed 001; Solon P. Pissis; Grigorios Loukides (CoRR, 2025)

Contextual Pattern Mining and Counting. - Ling Li 012; Daniel Gibney; Sharma V. Thankachan; Solon P. Pissis; Grigorios Loukides (CoRR, 2025)

Testing Quasiperiodicity. - Christine Awofeso; Ben Bals; Oded Lachish; Solon P. Pissis (CoRR, 2025)

When is String Reconstruction using de Bruijn Graphs Hard? - Ben Bals; Sebastiaan van Krieken; Solon P. Pissis; Leen Stougie; Hilde Verbeek 001 (CoRR, 2025)

Text Indexing and Pattern Matching with Ephemeral Edits. - Solon P. Pissis (CoRR, 2025)

Text indexing for long patterns using locally consistent anchors. - Lorraine A. K. Ayad; Grigorios Loukides; Solon P. Pissis (VLDB J., 2025)