- 21
- 8
- 6
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
AC
Annie CHATEAU
50
Documents
Identifiants chercheurs
- annie-chateau
- 0000-0003-4760-8171
- IdRef : 227798856
Présentation
Publications
- 6
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 22
- 18
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 44
- 8
- 1
- 1
- 1
- 1
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 4
- 1
- 5
- 7
- 6
- 7
- 5
- 3
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 3
- 1
- 1
|
Linearizing Genomes: Exact Methods and Local SearchSOFSEM 2020 - 46th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2020, Limassol, Cyprus. pp.505-518, ⟨10.1007/978-3-030-38919-2_41⟩
Communication dans un congrès
lirmm-02332049v2
|
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic GraphsIWOCA 2019 - 30th International Workshop on Combinatorial Algorithms, Jul 2019, Pisa, Italy. pp.122-135, ⟨10.1007/978-3-030-25005-8_11⟩
Communication dans un congrès
hal-02359076v1
|
|
|
Weighted minimum-length rearrangement scenariosWABI 2019 - 19th International Workshop on Algorithms in Bioinformatics, Sep 2019, Niagara Falls, NY, United States. pp.13:1-13:17, ⟨10.4230/LIPIcs.WABI.2019.13⟩
Communication dans un congrès
lirmm-02410451v1
|
|
New Polynomial-Time Algorithm around the Scaffolding ProblemAlCoB 2019 - 6th International Conference on Algorithms for Computational Biology, May 2019, Berkeley, United States. pp.25-38, ⟨10.1007/978-3-030-18174-1_2⟩
Communication dans un congrès
lirmm-02047701v1
|
|
New Results About the Linearization of Scaffolds Sharing Repeated ContigsCOCOA 2018 - 12th International Conference on Combinatorial Optimization and Applications, Sep 2018, Atlanta, GA, United States. pp.94-107, ⟨10.1007/978-3-030-04651-4_7⟩
Communication dans un congrès
lirmm-01900389v2
|
|
A General Framework for Genome Rearrangement with Biological ConstraintsRECOMB-CG: Comparative Genomics, Oct 2018, Magog-Orford, QC, Canada. pp.49-71, ⟨10.1007/978-3-030-00834-5_3⟩
Communication dans un congrès
lirmm-02067487v1
|
|
On the hardness of approximating Linearization of Scaffolds sharing Repeated ContigsRECOMB-CG: Comparative Genomics, Oct 2018, Magog-Orford, QC, Canada. pp.91-107, ⟨10.1007/978-3-030-00834-5_5⟩
Communication dans un congrès
lirmm-01900395v2
|
|
Improved Complexity for Power Edge Set ProblemIWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩
Communication dans un congrès
hal-01715909v1
|
|
Measuring Differences To Compare Sets Of Models And Improve Diversity In MDEICSEA: International Conference on Software Engineering Advances, Oct 2017, Athenes, Greece
Communication dans un congrès
hal-01586827v1
|
|
Surveiller un réseau électrique en plaçant des dispositifs sur ses liens : un problème difficileAlgoTel: Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Communication dans un congrès
hal-01516931v1
|
On the Linearization of Scaffolds Sharing Repeated ContigsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.509-517, ⟨10.1007/978-3-319-71147-8_38⟩
Communication dans un congrès
lirmm-01672893v1
|
|
|
Une modélisation par Contrainte de graphe pour résoudre l’échafaudage de génomeROADEF 2017 - 18e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2017, Metz, France
Communication dans un congrès
lirmm-01875591v1
|
New Insights for Power Edge Set ProblemCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194, ⟨10.1007/978-3-319-71150-8_17⟩
Communication dans un congrès
lirmm-01672895v1
|
|
Instance Guaranteed Ratio on Greedy Heuristic for Genome ScaffoldingCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.294-308, ⟨10.1007/978-3-319-48749-6_22⟩
Communication dans un congrès
lirmm-01378584v1
|
|
|
A Graph Constraints Formulation for Contigs ScaffoldingWCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. pp.136-149
Communication dans un congrès
lirmm-01360463v1
|
|
Comment la reconstruction de génomes ancestraux peut aider à l'assemblage de génomes actuelsJournées Ouvertes Biologie Informatique Mathématiques, 2016, Lyon, France
Communication dans un congrès
hal-01394409v1
|
On Residual Approximation in Solution Extension ProblemsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476, ⟨10.1007/978-3-319-48749-6_34⟩
Communication dans un congrès
lirmm-01378581v1
|
|
|
Genetic Algorithm to Improve Diversity in MDEMETA: Metaheuristics and Nature Inspired Computing, Oct 2016, Marrakech, Morocco
Communication dans un congrès
lirmm-01397321v1
|
|
A Model-Driven Approach to Generate Relevant and Realistic DatasetsSEKE: Software Engineering and Knowledge Engineering, Jul 2016, Redwood City, San Francisco Bay, United States. pp.105-109, ⟨10.18293/SEKE2016-029⟩
Communication dans un congrès
lirmm-01397311v1
|
|
Instantiation of meta-models constrained with OCL: A CSP approachMODELSWARD: Model-Driven Engineering and Software Development, Feb 2015, Angers, France. pp.213-222, ⟨10.5220/0005231402130222⟩
Communication dans un congrès
lirmm-01232891v1
|
On the Complexity of Scaffolding Problems: From Cliques to Sparse GraphsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2015, Houston, United States. pp.409-423, ⟨10.1007/978-3-319-26626-8_30⟩
Communication dans un congrès
lirmm-01250982v1
|
|
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding ProblemAlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. pp.47-58, ⟨10.1007/978-3-319-07953-0_4⟩
Communication dans un congrès
lirmm-01007556v1
|
|
|
An integer linear programming approach for genome scaffoldingWCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2014, Lyon, France. 16 p
Communication dans un congrès
hal-01198359v1
|
|
A CSP Approach for Metamodel InstantiationICTAI: International Conference on Tools with Artificial Intelligence, Nov 2013, Washington, United States. pp.1044-1051, ⟨10.1109/ICTAI.2013.156⟩
Communication dans un congrès
lirmm-01007571v1
|
|
Approximate Common Intervals in Multiple Genome ComparisonBIBM'11: Bioinformatics and Biomedicine, Nov 2011, Atlanta, United States. pp.131-134, ⟨10.1109/BIBM.2011.96⟩
Communication dans un congrès
lirmm-00659473v1
|
|
Perfect DCJ rearrangementRECOMB-CG: Comparative Genomics, Oct 2008, Paris, France. pp.158-169, ⟨10.1007/978-3-540-87989-3_12⟩
Communication dans un congrès
lirmm-00327258v1
|
|
Exploring Genome Rearrangements using Virtual HybridizationAPBC'07: 5th Asia-Pacific Bioinformatics Conference, Jan 2007, Hong Kong, China. pp.205-214
Communication dans un congrès
lirmm-00203873v1
|
|
Inferring Positional Homologs with Common Intervals of Sequences4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montreal, Canada. pp.24-38
Communication dans un congrès
hal-00620367v1
|
From Sequences to Graphs: Discrete Methods and Structures for BioinformaticsWiley, 2022, ⟨10.1002/9781394169641⟩
Ouvrages
hal-03920813v1
|
|
Mathématiques pour l'agrégationDunod, pp.736, 2007
Ouvrages
inria-00173250v1
|
|
RedOak: a reference-free and alignment-free structure for indexing a collection of similar genomes2021
Pré-publication, Document de travail
lirmm-03117453v1
|
|
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 infiniesMathématiques [math]. Université d'Auvergne - Clermont-Ferrand I, 2003. Français. ⟨NNT : ⟩
Thèse
tel-00011983v1
|