8 citations · 32 across the 26 of their papers we have counts for
29 papers
Fast detection of specific fragments against a set of sequences
Marie-Pierre Béal, Maxime Crochemore
We design alignment-free techniques for comparing a sequence or word, called a target, against a set of words, called a reference. A target-specific factor of a target against…
Checking whether a word is Hamming-isometric in linear time
Marie-Pierre Béal, Maxime Crochemore
A finite word is Hamming-isometric if for any two word and of same length avoiding , can be transformed into by changing one by one all the letters on which…
Left Lyndon tree construction
Golnaz Badkobeh, Maxime Crochemore
We extend the left-to-right Lyndon factorisation of a word to the left Lyndon tree construction of a Lyndon word. It yields an algorithm to sort the prefixes of a Lyndon word accor…
Internal Quasiperiod Queries
Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski +4
Internal pattern matching requires one to answer queries about factors of a given string. Many results are known on answering internal period queries, asking for the periods of a g…
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos +6
We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings and of length , we are to compute the longest factor of whose cyclic shift occ…
Alignment-free sequence comparison using absent words
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici +2
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realised by sequence alignment techniques, which are computationally expensive. Thi…