default search action
Mikaël Salson
Person information
- affiliation: LIFL Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b1]Mikaël Salson:
Méthodes sans alignement et indexation pour l'analyse de données nucléiques massives. University of Lille, France, 2023 - 2022
- [j11]Augustin Boudry, Sasha Darmon, Nicolas Duployez
, Martin Figeac
Frugal alignment-free identification of FLT3-internal tandem duplications with FiLT3r. BMC Bioinform. 23(1): 448 (2022) - [j10]Augustin Boudry, Sasha Darmon, Nicolas Duployez
Publisher Correction: Frugal alignment-free identification of FLT3-internal tandem duplications with FiLT3r. BMC Bioinform. 23(1): 533 (2022) - 2020
- [j9]Camille Marchet, Zamin Iqbal
REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets. Bioinform. 36(Supplement-1): i177-i185 (2020)
2010 – 2019
- 2018
- [j8]Tatiana Rocher, Mathieu Giraud
Indexing labeled sequences. PeerJ Comput. Sci. 4: e148 (2018) - 2017
- [j7]Jerome Audoux, Mikaël Salson, Christophe F. Grosset
SimBA: A methodology and tools for evaluating the performance of RNA-Seq bioinformatic pipelines. BMC Bioinform. 18(1): 428:1-428:14 (2017) - 2016
- [j6]Christophe Vroland, Mikaël Salson, Sébastien Bini, Hélène Touzet
Approximate search of short patterns with high error rates using the 01⁎0 lossless seeds. J. Discrete Algorithms 37: 3-16 (2016) - [j5]Alice Héliou, Martine Léonard, Laurent Mouchard, Mikaël Salson:
Efficient dynamic range minimum query. Theor. Comput. Sci. 656: 108-117 (2016) - 2014
- [c2]Christophe Vroland, Mikaël Salson, Hélène Touzet:
Lossless Seeds for Searching Short Patterns with High Error Rates. IWOCA 2014: 364-375 - 2012
- [j4]Martine Léonard, Laurent Mouchard, Mikaël Salson:
On the number of elements to reorder when updating a suffix array. J. Discrete Algorithms 11: 87-99 (2012) - [i1]Eric Rivals, Nicolas Philippe, Mikaël Salson, Martine Léonard, Therese Commes, Thierry Lecroq:
A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections. ERCIM News 2012(89) (2012) - 2011
- [j3]Nicolas Philippe, Mikaël Salson, Thierry Lecroq
Querying large read collections in main memory: a versatile data structure. BMC Bioinform. 12: 242 (2011) - 2010
- [j2]Mikaël Salson, Thierry Lecroq
Dynamic extended suffix arrays. J. Discrete Algorithms 8(2): 241-257 (2010)
2000 – 2009
- 2009
- [j1]Mikaël Salson, Thierry Lecroq
A four-stage algorithm for updating a Burrows-Wheeler transform. Theor. Comput. Sci. 410(43): 4350-4359 (2009) - 2008
- [c1]Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic Burrows-Wheeler Transform. Stringology 2008: 13-25
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: