Recent advances on pattern matching on weighted strings were the topic of an invited talk at the 23rd Prague Stringology Conference. The presentation can be found in the Publications tab.
We have published two papers at CPM 2019. In our first paper, we give the first streaming algorithms for computing covers. In the second paper, we introduce a new similarity measure of two strings, the Longest Common Circular Factor, and show how it can be computed efficiently. The papers were presented at the conference by Jakub Radoszewski and Juliusz Straszyński, respectively. More details can be found in the Publications tab.
Our paper "Efficient Computation of Sequence Mappability" received the Springer Best Paper Award at the 25th International Symposium on String Processing and Information Retrieval that was held on October 9-11, 2018 in Lima, Peru. Click here for more … [Continue reading]
At CPM 2018 conference we have published a paper that computes the longest common factor (LCF) with at most mismatches for two strings in linear time provided that it is sufficiently long. More details can be found in the Publications … [Continue reading]