Pierre Peterlongo
Orcid: 0000-0003-0776-6407Affiliations:
- Inria, France
- Rennes University, France
According to our database1,
Pierre Peterlongo
authored at least 45 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
2
1
2
5
1
2
1
2
3
2
3
1
1
1
2
1
1
2
1
1
2
1
2
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
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
Proceedings of the Prague Stringology Conference 2024, 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
Proceedings of the String Processing and Information Retrieval, 2022
2021
Proceedings of the String Processing and Information Retrieval, 2021
Proceedings of the 31st Data Compression Conference, 2021
2020
Discret. Appl. Math., 2020
Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
Bioinform., 2020
Bioinform., 2020
Algorithms Mol. Biol., 2020
2017
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017
2016
PeerJ Comput. Sci., 2016
Proceedings of the Prague Stringology Conference 2016, 2016
2015
2014
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
BMC Bioinform., 2012
BMC Bioinform., 2012
BlastGraph: Intensive Approximate Pattern Matching in Sequence Graphs and de-Bruijn Graphs.
Proceedings of the Prague Stringology Conference 2012, 2012
2011
Proceedings of the Prague Stringology Conference 2011, 2011
2010
Proceedings of the String Processing and Information Retrieval, 2010
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010
2009
Int. J. Found. Comput. Sci., 2009
Algorithms Mol. Biol., 2009
Proceedings of the Pattern Recognition in Bioinformatics, 2009
2008
J. Discrete Algorithms, 2008
2007
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
Proceedings of the Implementation and Application of Automata, 2006
2005
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