Géraldine Jean

Available identifiers

Publication	Date of Publication	Type
Sorting genomes by prefix double-cut-and-joins	2024-12-12	Paper
The \textsc{Exact Subset MultiCover} problem	2024-12-12	Paper
The \textsc{maximum zero-sum partition} problem	2024-11-06	Paper
Sorting genomes by prefix double-cut-and-joins	2023-08-04	Paper
The Exact Subset MultiCover problem	2023-08-04	Paper
Approximation algorithms for sorting by \(k\)-cuts on signed permutations	2022-11-23	Paper
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions	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?	2021-01-25	Paper
The Contig Assembly Problem and Its Algorithmic Solutions	2020-08-07	Paper
Prefix and suffix reversals on strings	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	2017-05-19	Paper
Prefix and Suffix Reversals on Strings	2015-10-02	Paper
Genome rearrangements: a correct algorithm for optimal capping	2010-03-24	Paper

This page was built for person: Géraldine Jean