Artículos con órdenes de acceso público - Maxime CrochemoreMás información
No disponible en ningún lugar: 1
A constant-space comparison-based algorithm for computing the Burrows–Wheeler transform
M Crochemore, R Grossi, J Kärkkäinen, GM Landau
Annual Symposium on Combinatorial Pattern Matching, 74-82, 2013
Órdenes: German Research Foundation
Disponibles en algún lugar: 14
Alignment-free sequence comparison using absent words
P Charalampopoulos, M Crochemore, G Fici, R Mercaş, SP Pissis
Information and Computation 262, 57-68, 2018
Órdenes: Government of Italy
Linear-time sequence comparison using minimal absent words & applications
M Crochemore, G Fici, R Mercaş, SP Pissis
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016
Órdenes: Government of Italy
Computing the Burrows–Wheeler transform in place and in small space
M Crochemore, R Grossi, J Kärkkäinen, GM Landau
Journal of Discrete Algorithms 32, 44-52, 2015
Órdenes: German Research Foundation, Academy of Finland, Government of Italy
Fast phylogenetic inference from typing data
JA Carriço, M Crochemore, AP Francisco, SP Pissis, B Ribeiro-Gonçalves, ...
Algorithms for Molecular Biology 13, 1-14, 2018
Órdenes: Fundação para a Ciência e a Tecnologia, Portugal, Royal Society UK
Absent words and the (dis) similarity analysis of DNA sequences: an experimental study
MS Rahman, A Alatabbi, T Athar, M Crochemore, MS Rahman
BMC research notes 9, 1-8, 2016
Órdenes: UK Engineering and Physical Sciences Research Council
The longest common substring problem
M Crochemore, CS Iliopoulos, A Langiu, F Mignosi
Mathematical Structures in Computer Science 27 (2), 277-295, 2017
Órdenes: UK Engineering and Physical Sciences Research Council
Internal quasiperiod queries
M Crochemore, CS Iliopoulos, J Radoszewski, W Rytter, J Straszyński, ...
International Symposium on String Processing and Information Retrieval, 60-75, 2020
Órdenes: European Commission
Shortest covers of all cyclic shifts of a string
M Crochemore, CS Iliopoulos, J Radoszewski, W Rytter, J Straszyński, ...
Theoretical Computer Science 866, 70-81, 2021
Órdenes: Narodowe Centrum Nauki
On the density of Lyndon roots in factors
M Crochemore, R Mercaş
Theoretical Computer Science 656, 234-240, 2016
Órdenes: Federal Ministry of Education and Research, Germany
Locating maximal approximate runs in a string
M Amit, M Crochemore, GM Landau, D Sokol
Theoretical Computer Science 700, 45-62, 2017
Órdenes: US National Science Foundation
Towards distance-based phylogenetic inference in average-case linear-time
M Crochemore, AP Francisco, SP Pissis, C Vaz
17th International Workshop on Algorithms in Bioinformatics (WABI 2017), 2017
Órdenes: Fundação para a Ciência e a Tecnologia, Portugal
Linear-time computation of shortest covers of all rotations of a string
M Crochemore, CS Iliopoulos, J Radoszewski, W Rytter, J Straszyński, ...
33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 2022
Órdenes: Netherlands Organisation for Scientific Research, Narodowe Centrum Nauki
Indexing a sequence for mapping reads with a single mismatch
M Crochemore, A Langiu, MS Rahman
Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2014
Órdenes: UK Engineering and Physical Sciences Research Council
Counting maximal-exponent factors in words
G Badkobeh, M Crochemore, R Mercaş
Theoretical Computer Science 658, 27-35, 2017
Órdenes: Federal Ministry of Education and Research, Germany
La información de publicación y financiación se determina de forma automática mediante un programa informático