Sébastien Angibaud

According to our database¹, Sébastien Angibaud authored at least 9 papers between 2006 and 2009.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2009

Comparaisons de génomes avec gènes dupliqués : étude théorique et algorithmes. (Comparative genomics with duplicated genes: theoretical study and algorithms).

[BibT_eX]

[DOI]

Sébastien Angibaud

PhD thesis, 2009

On the Approximability of Comparing Genomes with Duplicates.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Pseudo Boolean Programming for Partially Ordered Genomes.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, International Workshop, 2009

Comparing Bacterial Genomes by Searching Their Common Intervals.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Computational Biology, 2009

2008

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes.

[BibT_eX]

[DOI]

J. Comput. Biol., 2008

On the Approximability of Comparing Genomes with Duplicates.

[BibT_eX]

[DOI]

Sébastien Angibaud

Guillaume Fertin

Irena Rusu

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

2007

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates.

[BibT_eX]

[DOI]

J. Comput. Biol., 2007

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

2006

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, 2006

Sébastien Angibaud

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...