Our team, which is led by Solon Pissis, works on algorithms and data structures for sequence analysis.
Research topics we are working on include algorithms and data structures on strings for pattern matching, indexing, comparison, and finding regularities. These topics are collectively known as combinatorial pattern matching. Combinatorial pattern matching methods are typically the workhorse of computational molecular biology applications, where the raw data to be analysed are DNA, RNA or protein sequences. We are interested in such applications but also in other applications processing sequential data, such as data mining, data compression or information retrieval applications.
Combinatorial pattern matching
Let us start by providing a brief overview of the combinatorial pattern matching topics.
In pattern matching, we are given a string x to pre-process in time that is proportional to the length of x, so that when we are given another longer string y, we can find all occurrences of x in y in time that is proportional to the length of y. In the following example we see two occurrences of string x in string y.
In indexing, we are given a string y to pre-process into a data structure in time that is proportional to the length of y, so that when we are given another shorter string x, we can find occurrences of x in y in time that is proportional to the length of x. In the following example we see an indexing data structure for string y = banana$. Every path from the root to a leaf node corresponds to a suffix of y. For instance, nana$ is the suffix starting at position 2 of y using a 0-base index.
In sequence comparison, we are given two (or more) strings and the task is to compare them in order to infer their (dis)similarities. In the following example we see an alignment of two strings: kitchen and kitten.
In finding regularities, we are given a string x and the task is to find certain types of patterns repeating in x. In the following example we see that pattern aabbab repeats in string x = abaabbabbaaabbabbba.
Note the fundamental difference to pattern matching: here, the pattern is not given to us but we are rather asked to extract it from x.
Let us now mention a few applications of combinatorial pattern matching in computational molecular biology:
- The first step of genome assembly via read mapping is to construct an indexing data structure over the reference genome. The first step of de novo genome assembly is to find common substrings between the reads to construct a de Bruijn or an overlap graph.
- The first step of inferring evolutionary relationships between sequences is the pairwise or multiple comparison of these sequences. The output of this step is used as the input to methods that reconstruct phylogenetic trees to depict these relationships.
- Inferring functional relationships between sequences is performed via comparing a sequence to a sequence database to detect regions of significant similarity or via extracting patterns (motifs), which are significantly overrepresented in a set of sequences.
Combinatorial pattern matching methods are also applied in data mining, when the data to be analysed are textual (sequential). For example, a string can represent the movement history of an individual, with each letter corresponding to a visited location; or an individual's purchasing history in a retailer, with each letter corresponding to a purchased product. Let us mention a few such applications:
- In pattern mining the task is to extract actionable patterns from large textual datasets; e.g. to extract the most frequent or the most significant patterns.
- In data sanitization the task is to disguise confidential patterns in large textual datasets while preserving the utility of these datasets.
- In document clustering the task is to compute term frequencies to reflect how important a term is to a document in a large collection of documents.
Current projects with external funding
- MSCA-RISE-2019 - Research and Innovation Staff Exchange (PANGAIA)
- MSCA-ITN-2020 - Innovative Training Networks (ALPACA)
- Anne Luesink (Intern, Dec 2021 - Apr 2022)
- Takuya Mieno (Intern, Feb - Mar 2020)
- Giulia Bernardini (Intern, Sep - Nov 2019)
Recent related research outputs
- Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone: Elastic-degenerate string matching via fast matrix multiplication. SIAM J. Comput (2022)
- Grigorios Loukides, Solon P. Pissis: All-pairs suffix/prefix in optimal time using Aho-Corasick space. Inf. Process. Lett. (2022)
- Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering: Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Transactions on Knowledge and Data Engineering (2022)
- Haodi Zhong, Grigorios Loukides, Solon P. Pissis: Clustering demographics and sequences of diagnosis codes. IEEE Journal of Biomedical and Health Informatics (2022)
- Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszyński: Efficient Computation of Sequence Mappability. Algorithmica (2022)