Géraldine Jean

Orcid: 0000-0002-1534-2682

According to our database1, Géraldine Jean authored at least 32 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides.
BMC Bioinform., December, 2023

Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information.
J. Comput. Biol., August, 2023

Approximation algorithms for sorting by k-cuts on signed permutations.
J. Comb. Optim., 2023

Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

2022
The Exact Subset MultiCover Problem.
Proceedings of the Theory and Applications of Models of Computation, 2022

Sorting Genomes by Prefix Double-Cut-and-Joins.
Proceedings of the String Processing and Information Retrieval, 2022

Sorting by k-Cuts on Signed Permutations.
Proceedings of the Comparative Genomics - 19th International Conference, 2022

Transposition Distance Considering Intergenic Regions for Unbalanced Genomes.
Proceedings of the Bioinformatics Research and Applications - 18th International Symposium, 2022

The Maximum Zero-Sum Partition Problem.
Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021
The Maximum Colorful Arborescence problem: How (computationally) hard can it be?
Theor. Comput. Sci., 2021

Sorting Permutations by Intergenic Operations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Sorting Signed Permutations by Intergenic Reversals.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Evaluation of open search methods based on theoretical mass spectra comparison.
BMC Bioinform., 2021

Sorting by Multi-Cut Rearrangements.
Algorithms, 2021

2020
Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes.
J. Comput. Biol., 2020

A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions.
Proceedings of the Algorithms for Computational Biology, 2020

2019
Super short operations on both gene order and intergenic sizes.
Algorithms Mol. Biol., 2019

Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes.
Proceedings of the Bioinformatics Research and Applications - 15th International Symposium, 2019

2018
Prefix and suffix reversals on strings.
Discret. Appl. Math., 2018

Super Short Reversals on Both Gene Order and Intergenic Sizes.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

2017
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.
Algorithms Mol. Biol., 2017

Algorithmic Aspects of the Maximum Colorful Arborescence Problem.
Proceedings of the Theory and Applications of Models of Computation, 2017

The Contig Assembly Problem and Its Algorithmic Solutions.
Proceedings of the Algorithms for Next-Generation Sequencing Data, Techniques, 2017

2016
Genome Rearrangements on Both Gene Order and Intergenic Regions.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

2014
Oqtans: a multifunctional workbench for RNA-seq data analysis.
BMC Bioinform., 2014

Oqtans: the RNA-seq workbench in the cloud for complete and reproducible quantitative transcriptome analysis.
Bioinform., 2014

DExTaR: Detection of exact tandem repeats based on the de Bruijn graph.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2011
SyDiG: uncovering Synteny in Distant Genomes.
Int. J. Bioinform. Res. Appl., 2011

Oqtans: a Galaxy-integrated workflow for quantitative transcriptome analysis from NGS Data.
BMC Bioinform., 2011

2009
Mining the Semantics of Genome Super-Blocks to Infer Ancestral Architectures.
J. Comput. Biol., 2009

2008
In silico methods for genome rearrangement analysis: from identification of common markers to ancestral reconstruction. (Méthodes in silico pour l'étude des réarrangements génomiques : de l'identification de marqueurs communs à la reconstruction ancestrale).
PhD thesis, 2008

2007
Genome rearrangements: a correct algorithm for optimal capping.
Inf. Process. Lett., 2007


  Loading...