research
∙
08/06/2022
Fast detection of specific fragments against a set of sequences
We design alignment-free techniques for comparing a sequence or word, ca...
share
research
∙
06/19/2021
Checking whether a word is Hamming-isometric in linear time
A finite word f is Hamming-isometric if for any two word u and v of same...
research
∙
11/25/2020
Left Lyndon tree construction
We extend the left-to-right Lyndon factorisation of a word to the left L...
research
∙
07/27/2020
Internal Quasiperiod Queries
Internal pattern matching requires one to answer queries about factors o...
research
∙
01/31/2019
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
We introduce the Longest Common Circular Factor (LCCF) problem in which,...
research
∙
06/07/2018
Alignment-free sequence comparison using absent words
Sequence comparison is a prerequisite to virtually all comparative genom...
research
∙
02/18/2018
Linear-Time Algorithm for Long LCF with k Mismatches
In the Longest Common Factor with k Mismatches (LCF_k) problem, we are g...
research
∙
12/23/2017
