Annie Chateau

Orcid: 0000-0003-4760-8171

According to our database1, Annie Chateau authored at least 41 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
RedOak: a reference-free and alignment-free structure for indexing a collection of similar genomes.
J. Open Source Softw., December, 2022

On a greedy approach for genome scaffolding.
Algorithms Mol. Biol., 2022

2021
Involving repetitive regions in scaffolding improvement.
J. Bioinform. Comput. Biol., 2021

Towards a reinforcement learning de novo genome assembler.
CoRR, 2021

Efficient assembly consensus algorithms for divergent contig sets.
Comput. Biol. Chem., 2021

BREC: an R package/Shiny app for automatically identifying heterochromatin boundaries and estimating local recombination rates along chromosomes.
BMC Bioinform., 2021

Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds.
Algorithmica, 2021

2020
Linearizing Genomes: Exact Methods and Local Search.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
Machine learning meets genome assembly.
Briefings Bioinform., 2019

A general framework for genome rearrangement with biological constraints.
Algorithms Mol. Biol., 2019

Genome Assembly Using Reinforcement Learning.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2019

Weighted Minimum-Length Rearrangement Scenarios.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

New Polynomial-Time Algorithm Around the Scaffolding Problem.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018
Complexity and lowers bounds for Power Edge Set Problem.
J. Discrete Algorithms, 2018

On residual approximation in solution extension problems.
J. Comb. Optim., 2018

A framework for cost-constrained genome rearrangement under Double Cut and Join.
CoRR, 2018

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases.
Algorithmica, 2018

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs.
Proceedings of the Comparative Genomics - 16th International Conference, 2018

New Results About the Linearization of Scaffolds Sharing Repeated Contigs.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Improved Complexity for Power Edge Set Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

On the Linearization of Scaffolds Sharing Repeated Contigs.
Proceedings of the Combinatorial Optimization and Applications, 2017

New Insights for Power Edge Set Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Aligning the unalignable: bacteriophage whole genome alignments.
BMC Bioinform., 2016

A Model-Driven Approach to Generate Relevant and Realistic Datasets.
Proceedings of the 28th International Conference on Software Engineering and Knowledge Engineering, 2016

Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Exact approaches for scaffolding.
BMC Bioinform., December, 2015

A complexity and approximation framework for the maximization scaffolding problem.
Theor. Comput. Sci., 2015

Instantiation of Meta-models Constrained with OCL - A CSP Approach.
Proceedings of the MODELSWARD 2015, 2015

On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2013
A CSP Approach for Metamodel Instantiation.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2011
Approximate Common Intervals in Multiple Genome Comparison.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2009
Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes.
J. Comput. Biol., 2009

2008
Perfect DCJ Rearrangement.
Proceedings of the Comparative Genomics, International Workshop, 2008

2007
Exploring Genome Rearrangements using Virtual Hybridization.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
The ultra-weak Ash conjecture and some particular cases.
Math. Log. Q., 2006

Inferring Positional Homologs with Common Intervals of Sequences.
Proceedings of the Comparative Genomics, 2006

2004
On the complexity of decision using destinies in H-bounded structures.
Theor. Comput. Sci., 2004

Reconstructing Ancestral Gene Orders Using Conserved Intervals.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003
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).
PhD thesis, 2003


  Loading...