default search action
Géraldine Jean
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j22]Guillaume Fertin, Géraldine Jean
, Anthony Labarre:
Sorting genomes by prefix double-cut-and-joins. Theor. Comput. Sci. 1024: 114909 (2025) - [j21]Emile Benoist
The Exact Subset MultiCover problem. Theor. Comput. Sci. 1024: 114936 (2025) - 2024
- [j20]Gabriel Siqueira
Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs. J. Heuristics 30(5): 269-289 (2024) - [j19]Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette:
The Maximum Zero-Sum Partition problem. Theor. Comput. Sci. 1019: 114811 (2024) - 2023
- [j18]Grégoire Prunier, Mehdi Cherkaoui, Albane Lysiak, Olivier Langella
Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides. BMC Bioinform. 24(1): 421 (2023) - [j17]Alexsandro Oliveira Alexandrino
Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information. J. Comput. Biol. 30(8): 861-876 (2023) - [j16]Andre Rodrigues Oliveira
Approximation algorithms for sorting by k-cuts on signed permutations. J. Comb. Optim. 45(1): 6 (2023) - [c14]Gabriel Siqueira
Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions. ISBRA 2023: 241-254 - 2022
- [c13]Guillaume Fertin
The Maximum Zero-Sum Partition Problem. ICS 2022: 73-85 - [c12]Alexsandro Oliveira Alexandrino
Transposition Distance Considering Intergenic Regions for Unbalanced Genomes. ISBRA 2022: 100-113 - [c11]Andre Rodrigues Oliveira
Sorting by k-Cuts on Signed Permutations. RECOMB-CG 2022: 189-204 - [c10]Guillaume Fertin
Sorting Genomes by Prefix Double-Cut-and-Joins. SPIRE 2022: 178-190 - [c9]Emile Benoist, Guillaume Fertin
The Exact Subset MultiCover Problem. TAMC 2022: 189-200 - [i1]Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting Genomes by Prefix Double-Cut-and-Joins. CoRR abs/2208.14315 (2022) - 2021
- [j15]Laurent Bulteau
Sorting by Multi-Cut Rearrangements. Algorithms 14(6): 169 (2021) - [j14]Albane Lysiak, Guillaume Fertin
Evaluation of open search methods based on theoretical mass spectra comparison. BMC Bioinform. 22-S(2): 65 (2021) - [j13]Andre Rodrigues Oliveira
Sorting Permutations by Intergenic Operations. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2080-2093 (2021) - [j12]Andre Rodrigues Oliveira
Sorting Signed Permutations by Intergenic Reversals. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2870-2876 (2021) - [j11]Guillaume Fertin
The Maximum Colorful Arborescence problem: How (computationally) hard can it be? Theor. Comput. Sci. 852: 104-120 (2021) - [c8]Laurent Bulteau, Guillaume Fertin
Sorting by Multi-cut Rearrangements. SOFSEM 2021: 593-607 - 2020
- [j10]Klairton Lima Brito
Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes. J. Comput. Biol. 27(2): 156-174 (2020) - [c7]Andre Rodrigues Oliveira
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions. AlCoB 2020: 16-28
2010 – 2019
- 2019
- [j9]Andre Rodrigues Oliveira
Super short operations on both gene order and intergenic sizes. Algorithms Mol. Biol. 14(1): 21:1-21:17 (2019) - [c6]Klairton Lima Brito
Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes. ISBRA 2019: 28-39 - 2018
- [j8]Guillaume Fertin
Prefix and suffix reversals on strings. Discret. Appl. Math. 246: 140-153 (2018) - [c5]Andre Rodrigues Oliveira
Super Short Reversals on Both Gene Order and Intergenic Sizes. BSB 2018: 14-25 - 2017
- [j7]Guillaume Fertin
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms Mol. Biol. 12(1): 16:1-16:11 (2017) - [c4]Guillaume Fertin
Algorithmic Aspects of the Maximum Colorful Arborescence Problem. TAMC 2017: 216-230 - [p1]Géraldine Jean, Andreea Radulescu, Irena Rusu:
The Contig Assembly Problem and Its Algorithmic Solutions. Algorithms for Next-Generation Sequencing Data 2017: 267-298 - 2016
- [c3]Guillaume Fertin
Genome Rearrangements on Both Gene Order and Intergenic Regions. WABI 2016: 162-173 - 2015
- [c2]Guillaume Fertin
Prefix and Suffix Reversals on Strings. SPIRE 2015: 165-176 - 2014
- [j6]Vipin T. Sreedharan, Sebastian J. Schultheiß
Oqtans: the RNA-seq workbench in the cloud for complete and reproducible quantitative transcriptome analysis. Bioinform. 30(9): 1300-1301 (2014) - [j5]Vipin T. Sreedharan, Sebastian J. Schultheiß
Oqtans: a multifunctional workbench for RNA-seq data analysis. BMC Bioinform. 15(S-3): A7 (2014) - [c1]Guillaume Fertin
DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. BIBM 2014: 90-93 - 2011
- [j4]Sebastian J. Schultheiß
Oqtans: a Galaxy-integrated workflow for quantitative transcriptome analysis from NGS Data. BMC Bioinform. 12(S-11): A7 (2011) - [j3]Géraldine Jean, Macha Nikolski:
SyDiG: uncovering Synteny in Distant Genomes. Int. J. Bioinform. Res. Appl. 7(1): 43-62 (2011)
2000 – 2009
- 2009
- [j2]Géraldine Jean, David James Sherman
Mining the Semantics of Genome Super-Blocks to Infer Ancestral Architectures. J. Comput. Biol. 16(9): 1267-1284 (2009) - 2008
- [b1]Géraldine Jean:
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). University of Bordeaux, France, 2008 - 2007
- [j1]Géraldine Jean, Macha Nikolski:
Genome rearrangements: a correct algorithm for optimal capping. Inf. Process. Lett. 104(1): 14-20 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: