| No. |
Title |
Author |
Year |
| 1 |
Finding Maximal Exact Matches in Graphs |
Rizzo, Nicola et al. |
2023 |
| 2 |
From Bit-Parallelism to Quantum String Matching for Labelled Graphs |
Equi, Massimo et al. |
2023 |
| 3 |
Indexable Elastic Founder Graphs of Minimum Height |
Rizzo, Nicola et al. |
2022 |
| 4 |
Algorithms and Complexity on Indexing Elastic Founder Graphs |
Equi, Massimo et al. |
2021 |
| 5 |
Chaining with Overlaps Revisited |
Mäkinen, Veli et al. |
2020 |
| 6 |
Linear Time Construction of Indexable Founder Block Graphs |
Mäkinen, Veli et al. |
2020 |
| 7 |
On the Complexity of String Matching for Graphs |
Equi, Massimo et al. |
2019 |
| 8 |
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time |
Norri, Tuukka et al. |
2018 |
| 9 |
An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation |
Bonifati, Angela et al. |
2008 |
| 10 |
Storage and Retrieval of Individual Genomes |
Mäkinen, Veli et al. |
2008 |
| 11 |
Combinatorial Approaches for Mass Spectra Recalibration |
Böcker, Sebastian et al. |
2006 |
