Pierre Peterlongo

Orcid: 0000-0003-0776-6407

Affiliations:
  • Inria, France
  • Rennes University, France


According to our database1, Pierre Peterlongo authored at least 43 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Indexing and real-time user-friendly queries in terabyte-sized complex genomic datasets with kmindex and ORA.
Nat. Comput. Sci., 2024

2023
<tt>fimpera</tt>: drastic improvement of Approximate Membership Query data-structures with counts.
Bioinform., May, 2023

2022
<tt>k</tt> <tt>mdiff</tt>, large-scale and user-friendly differential <i>k</i>-mer analyses.
Bioinform., December, 2022

The K-mer File Format: a standardized and compact disk representation of sets of <i>k</i>-mers.
Bioinform., 2022

Pattern Matching Under DTW Distance.
Proceedings of the String Processing and Information Retrieval, 2022

2021
Approximate Hashing for Bioinformatics.
Proceedings of the Implementation and Application of Automata, 2021

findere: Fast and Precise Approximate Membership Query.
Proceedings of the String Processing and Information Retrieval, 2021

2020
A resource-frugal probabilistic dictionary and applications in bioinformatics.
Discret. Appl. Math., 2020

Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
Bioinform., 2020

SVJedi: genotyping structural variations with long reads.
Bioinform., 2020

SimkaMin: fast and resource frugal de novo comparative metagenomics.
Bioinform., 2020

Finding all maximal perfect haplotype blocks in linear time.
Algorithms Mol. Biol., 2020

2017
Toward perfect reads.
CoRR, 2017

Fast and Scalable Minimal Perfect Hashing for Massive Key Sets.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
Multiple comparative metagenomics using multiset <i>k</i>-mer counting.
PeerJ Comput. Sci., 2016

Read mapping on de Bruijn graphs.
BMC Bioinform., 2016

A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics.
Proceedings of the Prague Stringology Conference 2016, 2016

Lire les lectures: analyse de données de séquençage.
, 2016

2015
Read Mapping on de Bruijn graph.
CoRR, 2015

2014
Rime: Repeat identification.
Discret. Appl. Math., 2014

GATB: Genome Assembly & Analysis Tool Box.
Bioinform., 2014

Commet: Comparing and combining multiple metagenomic datasets.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2012
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data.
BMC Bioinform., 2012

Mapsembler, targeted and micro assembly of large NGS datasets on a desktop computer.
BMC Bioinform., 2012

Compareads: comparing huge metagenomic experiments.
BMC Bioinform., 2012

BlastGraph: Intensive Approximate Pattern Matching in Sequence Graphs and de-Bruijn Graphs.
Proceedings of the Prague Stringology Conference 2012, 2012

2011
Finding Long and Multiple Repeats with Edit Distance.
Proceedings of the Prague Stringology Conference 2011, 2011

2010
Identifying SNPs without a Reference Genome by Comparing Raw Reads.
Proceedings of the String Processing and Information Retrieval, 2010

An optimized filter for finding multiple repeats in DNA sequences.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009
In-Place Update of Suffix Array while Recoding Words.
Int. J. Found. Comput. Sci., 2009

Lossless filter for multiple repeats with bounded edit distance.
Algorithms Mol. Biol., 2009

c-GAMMA: Comparative Genome Analysis of Molecular Markers.
Proceedings of the Pattern Recognition in Bioinformatics, 2009

2008
Lossless filter for multiple repetitions with Hamming distance.
J. Discrete Algorithms, 2008

Indexing Gapped-Factors Using a Tree.
Int. J. Found. Comput. Sci., 2008

Optimal neighborhood indexing for protein similarity search.
BMC Bioinform., 2008

2007
Protein Similarity Search with Subset Seeds on a Dedicated Reconfigurable Hardware.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Filtrage de séquences d'ADN pour la recherche de longues répétitions multiples. (DNA sequence filtration for the problem of finding long multiple repetitions).
PhD thesis, 2006

Finding Common Motifs with Gaps Using Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

The gapped-factor tree.
Proceedings of the Prague Stringology Conference, 2006

2005
A first approach to finding common motifs with gaps.
Int. J. Found. Comput. Sci., 2005

Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array.
Proceedings of the String Processing and Information Retrieval, 2005


  Loading...