default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnie Chateau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]Annie Chateau:
Utilisation des destinées pour la décision et sa complexité dans le cas de formules à profondeur de quantification bornée sur des structures logiques finies et infinies. (Using Destinies for the Decision Problem of Sets of Bounded Quantifier Depth Sentences in Finite or Infinite Structures). University of Auvergne, Clermont-Ferrand, France, 2003
Journal Articles
- 2022
- [j17]Tom Davot
, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller:
On a greedy approach for genome scaffolding. Algorithms Mol. Biol. 17(1): 16 (2022) - [j16]Clément Agret, Annie Chateau, Gaëtan Droc, Gautier Sarah, Manuel Ruiz, Alban Mancheron:
RedOak: a reference-free and alignment-free structure for indexing a collection of similar genomes. J. Open Source Softw. 7(80): 4363 (2022) - 2021
- [j15]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary:
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds. Algorithmica 83(7): 2063-2095 (2021) - [j14]Yasmine Mansour, Annie Chateau, Anna-Sophie Fiston-Lavier:
BREC: an R package/Shiny app for automatically identifying heterochromatin boundaries and estimating local recombination rates along chromosomes. BMC Bioinform. 22-S(6): 396 (2021) - [j13]Annie Chateau, Tom Davot, Manuel Lafond:
Efficient assembly consensus algorithms for divergent contig sets. Comput. Biol. Chem. 93: 107516 (2021) - [j12]Quentin Delorme, Rémy Costa, Yasmine Mansour, Anna-Sophie Fiston-Lavier, Annie Chateau:
Involving repetitive regions in scaffolding improvement. J. Bioinform. Comput. Biol. 19(6): 2140016:1-2140016:15 (2021) - 2019
- [j11]Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
A general framework for genome rearrangement with biological constraints. Algorithms Mol. Biol. 14(1): 15:1-15:14 (2019) - [j10]Kleber Padovani de Souza, João Carlos Setubal, André Carlos Ponce de Leon Ferreira de Carvalho, Guilherme Oliveira, Annie Chateau, Ronnie Alves:
Machine learning meets genome assembly. Briefings Bioinform. 20(6): 2116-2129 (2019) - 2018
- [j9]Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau:
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica 80(6): 1771-1803 (2018) - [j8]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On residual approximation in solution extension problems. J. Comb. Optim. 36(4): 1195-1220 (2018) - [j7]Benoît Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Complexity and lowers bounds for Power Edge Set Problem. J. Discrete Algorithms 52-53: 70-91 (2018) - 2016
- [j6]Sèverine Bérard, Annie Chateau, Nicolas Pompidor, Paul Guertin, Anne Bergeron, Krister M. Swenson:
Aligning the unalignable: bacteriophage whole genome alignments. BMC Bioinform. 17: 30 (2016) - 2015
- [j5]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Exact approaches for scaffolding. BMC Bioinform. 16(S14): S2 (2015) - [j4]Annie Chateau, Rodolphe Giroudeau:
A complexity and approximation framework for the maximization scaffolding problem. Theor. Comput. Sci. 595: 92-106 (2015) - 2009
- [j3]Sèverine Bérard, Annie Chateau, Cédric Chauve, Christophe Paul, Eric Tannier:
Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. J. Comput. Biol. 16(10): 1287-1309 (2009) - 2006
- [j2]Annie Chateau, Malika More:
The ultra-weak Ash conjecture and some particular cases. Math. Log. Q. 52(1): 4-13 (2006) - 2004
- [j1]Annie Chateau:
On the complexity of decision using destinies in H-bounded structures. Theor. Comput. Sci. 322(1): 41-67 (2004)
Conference and Workshop Papers
- 2020
- [c23]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Linearizing Genomes: Exact Methods and Local Search. SOFSEM 2020: 505-518 - 2019
- [c22]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Polynomial-Time Algorithm Around the Scaffolding Problem. AlCoB 2019: 25-38 - [c21]Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. IWOCA 2019: 122-135 - [c20]Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
Weighted Minimum-Length Rearrangement Scenarios. WABI 2019: 13:1-13:17 - [c19]Roberto Xavier, Kleber Padovani de Souza, Annie Chateau, Ronnie Alves:
Genome Assembly Using Reinforcement Learning. BSB 2019: 16-28 - 2018
- [c18]Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA 2018: 94-107 - [c17]Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
A General Framework for Genome Rearrangement with Biological Constraints. RECOMB-CG 2018: 49-71 - [c16]Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. RECOMB-CG 2018: 91-107 - 2017
- [c15]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
New Insights for Power Edge Set Problem. COCOA (1) 2017: 180-194 - [c14]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA (2) 2017: 509-517 - [c13]Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Improved Complexity for Power Edge Set Problem. IWOCA 2017: 128-141 - 2016
- [c12]Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA 2016: 294-308 - [c11]Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On Residual Approximation in Solution Extension Problems. COCOA 2016: 463-476 - [c10]Adel Ferdjoukh, Eric Bourreau, Annie Chateau, Clémentine Nebut:
A Model-Driven Approach to Generate Relevant and Realistic Datasets. SEKE 2016: 105-109 - 2015
- [c9]Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA 2015: 409-423 - [c8]Adel Ferdjoukh, Anne-Elisabeth Baert, Eric Bourreau, Annie Chateau, Remi Coletta, Clémentine Nebut:
Instantiation of Meta-models Constrained with OCL - A CSP Approach. MODELSWARD 2015: 213-222 - 2014
- [c7]Annie Chateau, Rodolphe Giroudeau:
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB 2014: 47-58 - 2013
- [c6]Adel Ferdjoukh, Anne-Elisabeth Baert, Annie Chateau, Remi Coletta, Clémentine Nebut:
A CSP Approach for Metamodel Instantiation. ICTAI 2013: 1044-1051 - 2011
- [c5]Annie Chateau, Pierre Riou, Eric Rivals:
Approximate Common Intervals in Multiple Genome Comparison. BIBM 2011: 131-134 - 2008
- [c4]Sèverine Bérard, Annie Chateau, Cédric Chauve, Christophe Paul, Eric Tannier:
Perfect DCJ Rearrangement. RECOMB-CG 2008: 158-169 - 2007
- [c3]Mahdi Belcaid, Anne Bergeron, Annie Chateau, Cédric Chauve, Yannick Gingras, Guylaine Poisson, M. Vendette:
Exploring Genome Rearrangements using Virtual Hybridization. APBC 2007: 205-214 - 2006
- [c2]Guillaume Blin, Annie Chateau, Cédric Chauve, Yannick Gingras:
Inferring Positional Homologs with Common Intervals of Sequences. Comparative Genomics 2006: 24-38 - 2004
- [c1]Anne Bergeron, Mathieu Blanchette, Annie Chateau, Cédric Chauve:
Reconstructing Ancestral Gene Orders Using Conserved Intervals. WABI 2004: 14-25
Informal and Other Publications
- 2021
- [i2]Kleber Padovani de Souza, Roberto Xavier, André C. P. L. F. de Carvalho, Anna Reali, Annie Chateau, Ronnie Alves:
Towards a reinforcement learning de novo genome assembler. CoRR abs/2102.02649 (2021) - 2018
- [i1]Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
A framework for cost-constrained genome rearrangement under Double Cut and Join. CoRR abs/1802.07515 (2018)
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-10-07 22:21 CEST 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:
