Mikaël Salson

Affiliations:
  • LIFL Lille, France


According to our database1, Mikaël Salson authored at least 15 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Méthodes sans alignement et indexation pour l'analyse de données nucléiques massives.
, 2023

2022
Publisher Correction: Frugal alignment-free identification of FLT3-internal tandem duplications with FiLT3r.
BMC Bioinform., 2022

Frugal alignment-free identification of FLT3-internal tandem duplications with FiLT3r.
BMC Bioinform., 2022

2020
REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets.
Bioinform., 2020

2018
Indexing labeled sequences.
PeerJ Comput. Sci., 2018

2017
SimBA: A methodology and tools for evaluating the performance of RNA-Seq bioinformatic pipelines.
BMC Bioinform., 2017

2016
Efficient dynamic range minimum query.
Theor. Comput. Sci., 2016

Approximate search of short patterns with high error rates using the 01<sup>⁎</sup>0 lossless seeds.
J. Discrete Algorithms, 2016

2014
Lossless Seeds for Searching Short Patterns with High Error Rates.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2012
On the number of elements to reorder when updating a suffix array.
J. Discrete Algorithms, 2012

A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections.
ERCIM News, 2012

2011
Querying large read collections in main memory: a versatile data structure.
BMC Bioinform., 2011

2010
Dynamic extended suffix arrays.
J. Discrete Algorithms, 2010

2009
A four-stage algorithm for updating a Burrows-Wheeler transform.
Theor. Comput. Sci., 2009

2008
Dynamic Burrows-Wheeler Transform.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008


  Loading...