Géraldine Jean

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Sorting genomes by prefix double-cut-and-joins Theoretical Computer Science	2024-12-12	Paper
The \textsc{Exact Subset MultiCover} problem Theoretical Computer Science	2024-12-12	Paper
The \textsc{maximum zero-sum partition} problem Theoretical Computer Science	2024-11-06	Paper
Sorting genomes by prefix double-cut-and-joins String Processing and Information Retrieval	2023-08-04	Paper
The Exact Subset MultiCover problem Lecture Notes in Computer Science	2023-08-04	Paper
Approximation algorithms for sorting by \(k\)-cuts on signed permutations Journal of Combinatorial Optimization	2022-11-23	Paper
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions Algorithms for Computational Biology	2022-10-13	Paper
Sorting by \(k\)-cuts on signed permutations	2022-08-11	Paper
Sorting by multi-cut rearrangements	2022-03-24	Paper
The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? Theoretical Computer Science	2021-01-25	Paper
The contig assembly problem and its algorithmic solutions Algorithms for Next-Generation Sequencing Data	2020-08-07	Paper
Prefix and suffix reversals on strings Discrete Applied Mathematics	2018-06-27	Paper
Genome rearrangements on both gene order and intergenic regions	2018-03-23	Paper
Algorithmic aspects of the maximum colorful arborescence problem Lecture Notes in Computer Science	2017-05-19	Paper
Prefix and Suffix Reversals on Strings String Processing and Information Retrieval	2015-10-02	Paper
Genome rearrangements: a correct algorithm for optimal capping Information Processing Letters	2010-03-24	Paper

Research outcomes over time

This page was built for person: Géraldine Jean