Christian Baudet
27
Documents
Presentation
Research Interests
------------------
My research interests are mainly linked with Bioinformatics and Computational Biology.
My past research includes works related to Strucutural Bioinformatics, Trimming Procedures for EST sequencing projects and study of Genome Rearrangement Problems.
During my postdoc, I explored methods for detecting genomic rearrangement breakpoints, cophylogeny reconciliation and theoretical computer science problems related to distance between pairs of trees: rSPR (rooted Subtree Prune and Regraft) distance and its closely related problem MAF (Maximum Agreement Forest).
Currently, I have a position at the Bioinformatics Platform "Gilles Thomas" of the Centre Léon Bérard, a Cancer Research Center located at Lyon, France.
**Here you can access my Curriculum Vitae (full version [in english](http://www.ic.unicamp.br/~baudet/CV/baudet_cv.pdf) or short version [in french](http://www.ic.unicamp.br/~baudet/CV/baudet_cv_short_fr.pdf))**
Background
----------
In December 2003, I received my Engineer degree in Computer Engineering from the University of Campinas ([Unicamp](http://www.unicamp.br/unicamp/?language=en)).
During my studies, from January 2002 to June 2003, I had the opportunity of working as programmer at the [Computational Biology Research Group](http://www.nbi.cnptia.embrapa.br/) located at [Embrapa Informática Agropecuária](http://www.cnptia.embrapa.br/). In this group, I actively participated on the implementation of several softwares, for visualization of protein parameters, which form the suite [STING](http://www.nbi.cnptia.embrapa.br/SMS/).
In July 2003, I was recruited as Analyst Developer at [Scylla Bioinformatics](http://www.scylla.com.br/index-en.html), one of the first private companies strictly linked to the Bioinformatics area
in Brazil. Working with all aspects of the development cycle (analysis of user requirements, design of system and database, code implementation, test, documentation and maintenance) I was responsible for the development of systems for:
 EST Sequecing Project Management
 Whole Genome Sequecing Project Management
 Marker Assisted Selection System
My contract with Scylla Bioinformatics ended in January 2009.
In 2004, I joined the Computer Science Master program of the [Institute of Computing](http://www.ic.unicamp.br/en) at the University of Campinas. My master dissertation involved the EST trimming procedure developed at Scylla Bioinformatics for the EST Sequencing Project Management system. In December 2006, I presented my dissertation before a jury to obtain my Master Degree.
In 2006, I joined the Computer Science PhD program in the same
institute. The research developed during my thesis involved two genome rearrangement problems:
 Enumeration of Traces for the Sorting by Signed Reversals Problem
 Detection of genomic rearrangement breakpoints.
Part of this work was developed during a PhD Sandwich program, which was funded by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior ([CAPES](http://www.capes.gov.br/)), a Brazilian governmental institution. The program started in March 2009 and ended in May 2010 and took place at the UMR CNRS 5558 Laboratoire de Biométrie et Biologie Évolutive ([LBBE](http://lbbe.univ-lyon1.fr/)) with the [Baobab-Bamboo team](https://team.inria.fr/bamboo/en), a CNRS-INRIA-UCBL team.
To obtain my PhD degree, I presented my thesis before a jury in December 2010.
After obtaining my PhD degree, I rejoined the Baobab-Bamboo team in a Post-doc position that started at January 2011. Since then, I’m working with three main topics:
 Detection of genome rearrangement breakpoints
 Algorithms for cophylogeny reconciliation
 Phylogenetic tree distances
Software
--------
**[Coala - COevolution Assessment by a Likelihood-free Approach](http://coala.gforge.inria.fr/)**Despite an increasingly vaster literature on cophylogenetic reconstructions for studying host-parasite associations, understanding the common evolutionary history of such systems remains a problem that is far from being solved. Many of the most used algorithms do the host-parasite reconciliation analysis using an event-based model, where the events include in general (a subset of) cospeciation, duplication, loss, and host-switch. All known event-based methods then assign a cost to each type of event in order to find a reconstruction of minimum cost. The main problem with this approach is that the cost of the events strongly influence the reconciliation obtained.
To deal with this problem, we developed an algorithm, called Coala, for estimating the frequency of the events based on an approximate Bayesian computation approach.
[Official webpage](http://coala.gforge.inria.fr/)
---
[**Eucalypt - EnUmerator of Coevolutionary Associations in PoLYnomial-Time delay**](http://eucalypt.gforge.inria.fr/)Phylogenetic tree reconciliation is the approach of choice for investigating the coevolution of sets of organisms such as hosts and parasites. It consists in a mapping between the parasite tree and the host tree using event-based maximum parsimony.
Eucalypt is a polynomial-delay algorithm for enumerating all optimal reconciliations for a pair of host and parasite trees.
[Official webpage](http://eucalypt.gforge.inria.fr/)
---
[**Cassis : Detection of genomic rearrangement breakpoints**](http://pbil.univ-lyon1.fr/software/Cassis/)The package Cassis implements methods for precise detection of genomic rearrangement breakpoints.
[Official webpage](http://pbil.univ-lyon1.fr/software/Cassis/)
---
[**BD2006Trimmer - Perl Script for EST sequence trimming**](http://www.ic.unicamp.br/~baudet/BD2006Trimmer/bd2006trimmer.zip)Perl script developed during my Master dissertation.
[Download script](http://www.ic.unicamp.br/~baudet/BD2006Trimmer/bd2006trimmer.zip)
Research Interests
------------------
My research interests are mainly linked with Bioinformatics and Computational Biology.
My past research includes works related to Strucutural Bioinformatics, Trimming Procedures for EST sequencing projects and study of Genome Rearrangement Problems.
During my postdoc, I explored methods for detecting genomic rearrangement breakpoints, cophylogeny reconciliation and theoretical computer science problems related to distance between pairs of trees: rSPR (rooted Subtree Prune and Regraft) distance and its closely related problem MAF (Maximum Agreement Forest).
Currently, I have a position at the Bioinformatics Platform "Gilles Thomas" of the Centre Léon Bérard, a Cancer Research Center located at Lyon, France.
**Here you can access my Curriculum Vitae (full version [in english](http://www.ic.unicamp.br/~baudet/CV/baudet_cv.pdf) or short version [in french](http://www.ic.unicamp.br/~baudet/CV/baudet_cv_short_fr.pdf))**
Background
----------
In December 2003, I received my Engineer degree in Computer Engineering from the University of Campinas ([Unicamp](http://www.unicamp.br/unicamp/?language=en)).
During my studies, from January 2002 to June 2003, I had the opportunity of working as programmer at the [Computational Biology Research Group](http://www.nbi.cnptia.embrapa.br/) located at [Embrapa Informática Agropecuária](http://www.cnptia.embrapa.br/). In this group, I actively participated on the implementation of several softwares, for visualization of protein parameters, which form the suite [STING](http://www.nbi.cnptia.embrapa.br/SMS/).
In July 2003, I was recruited as Analyst Developer at [Scylla Bioinformatics](http://www.scylla.com.br/index-en.html), one of the first private companies strictly linked to the Bioinformatics area
in Brazil. Working with all aspects of the development cycle (analysis of user requirements, design of system and database, code implementation, test, documentation and maintenance) I was responsible for the development of systems for:
 EST Sequecing Project Management
 Whole Genome Sequecing Project Management
 Marker Assisted Selection System
My contract with Scylla Bioinformatics ended in January 2009.
In 2004, I joined the Computer Science Master program of the [Institute of Computing](http://www.ic.unicamp.br/en) at the University of Campinas. My master dissertation involved the EST trimming procedure developed at Scylla Bioinformatics for the EST Sequencing Project Management system. In December 2006, I presented my dissertation before a jury to obtain my Master Degree.
In 2006, I joined the Computer Science PhD program in the same
institute. The research developed during my thesis involved two genome rearrangement problems:
 Enumeration of Traces for the Sorting by Signed Reversals Problem
 Detection of genomic rearrangement breakpoints.
Part of this work was developed during a PhD Sandwich program, which was funded by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior ([CAPES](http://www.capes.gov.br/)), a Brazilian governmental institution. The program started in March 2009 and ended in May 2010 and took place at the UMR CNRS 5558 Laboratoire de Biométrie et Biologie Évolutive ([LBBE](http://lbbe.univ-lyon1.fr/)) with the [Baobab-Bamboo team](https://team.inria.fr/bamboo/en), a CNRS-INRIA-UCBL team.
To obtain my PhD degree, I presented my thesis before a jury in December 2010.
After obtaining my PhD degree, I rejoined the Baobab-Bamboo team in a Post-doc position that started at January 2011. Since then, I’m working with three main topics:
 Detection of genome rearrangement breakpoints
 Algorithms for cophylogeny reconciliation
 Phylogenetic tree distances
Software
--------
**[Coala - COevolution Assessment by a Likelihood-free Approach](http://coala.gforge.inria.fr/)**Despite an increasingly vaster literature on cophylogenetic reconstructions for studying host-parasite associations, understanding the common evolutionary history of such systems remains a problem that is far from being solved. Many of the most used algorithms do the host-parasite reconciliation analysis using an event-based model, where the events include in general (a subset of) cospeciation, duplication, loss, and host-switch. All known event-based methods then assign a cost to each type of event in order to find a reconstruction of minimum cost. The main problem with this approach is that the cost of the events strongly influence the reconciliation obtained.
To deal with this problem, we developed an algorithm, called Coala, for estimating the frequency of the events based on an approximate Bayesian computation approach.
[Official webpage](http://coala.gforge.inria.fr/)
---
[**Eucalypt - EnUmerator of Coevolutionary Associations in PoLYnomial-Time delay**](http://eucalypt.gforge.inria.fr/)Phylogenetic tree reconciliation is the approach of choice for investigating the coevolution of sets of organisms such as hosts and parasites. It consists in a mapping between the parasite tree and the host tree using event-based maximum parsimony.
Eucalypt is a polynomial-delay algorithm for enumerating all optimal reconciliations for a pair of host and parasite trees.
[Official webpage](http://eucalypt.gforge.inria.fr/)
---
[**Cassis : Detection of genomic rearrangement breakpoints**](http://pbil.univ-lyon1.fr/software/Cassis/)The package Cassis implements methods for precise detection of genomic rearrangement breakpoints.
[Official webpage](http://pbil.univ-lyon1.fr/software/Cassis/)
---
[**BD2006Trimmer - Perl Script for EST sequence trimming**](http://www.ic.unicamp.br/~baudet/BD2006Trimmer/bd2006trimmer.zip)Perl script developed during my Master dissertation.
[Download script](http://www.ic.unicamp.br/~baudet/BD2006Trimmer/bd2006trimmer.zip)
Publications
- 3
- 2
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 4
- 1
- 2
- 3
- 1
- 8
- 4
- 8
|
Sorting Signed Circular Permutations by Super Short Reversals11th International Symposium on Bioinformatics Research and Applications, Jun 2015, Norfolk, Virginia, United States. pp.272-283, ⟨10.1007/978-3-319-19048-8_23⟩
Conference papers
hal-01316993v1
|
|
Length and Symmetry on the Sorting by Weighted Inversions Problem9th Brazilian Symposium on Bioinformatics, BSB 2014, Oct 2014, Belo Horizonte, Brazil. pp.99 - 106, ⟨10.1007/978-3-319-12418-6_13⟩
Conference papers
hal-01092607v1
|
|
Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary InversionsProceedings of the 4th ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics (ACM BCB 2013), ACM Special Interest Group on Bioinformatics, Computational Biology, and Biomedical Informatics, Sep 2013, Maryland, United States. pp.181--190, ⟨10.1145/2506583.2506614⟩
Conference papers
hal-00922670v1
|
Partial enumeration of solutions traces for the problem of sorting by signed reversalsProceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, Aug 2011, Chicago, United States. pp.505--507, ⟨10.1145/2147805.2147884⟩
Conference papers
hal-00748607v1
|
|
An improved algorithm to enumerate all traces that sort a signed permutation by reversalsACM Symposium on Applied Computing (SAC), Mar 2010, Sierre, Switzerland. pp.1521-1525, ⟨10.1145/1774088.1774416⟩
Conference papers
hal-00748579v1
|
|
Chronological order of reversal events on Rickettsia genusProceedings of the International Symposium on Biocomputing, Feb 2010, Calicut, Kerala, India. pp.1:1--1:5, ⟨10.1145/1722024.1722026⟩
Conference papers
hal-00748584v1
|
|
Desenvolvimento de um teclado virtual com diversos layouts e varredurasV Congresso Ibero-americano de Informática na Educação Especial (CIIEE2005), Jul 2005, Montevideo, Uruguay. pp.141 - 161
Conference papers
hal-01093636v1
|
|
|
TFLEX: Proposta de Simulador de Teclado com Diferentes Varreduras e LayoutsVII Congreso Iberoamericano de Informática Educativa (RIBIE 2004), Oct 2004, Monterrey, Mexico. pp.630 - 639
Conference papers
hal-01093641v1
|
|
TFlex: Um Simulador de Teclado com Múltiplos Modos de VarreduraVI Simpósio sobre Fatores Humanos em Sistemas Computacionais (IHC 2004), Dec 2004, Curitiba, Brazil
Conference papers
hal-01093638v1
|
|
Enumeração de traces e Identificação de Breakpoints : Estudo de aspectos da evolução.Computer Science [cs]. UNICAMP (Université de Campinas), Brésil, 2010. Portuguese. ⟨NNT : ⟩
Theses
tel-01092714v1
|