Welcome!

(Etudiants: ce qui vous concerne se trouve dans la section Teaching)

I am Dr. Anthony Labarre, Associate Professor in Computer Science at the Université Paris-Est Marne-la-Vallée, member of the Algorithms research group of the LIGM . My research interests include genome rearrangements (have a look at my book), data compression, DNA computing, and lie more generally in the application of combinatorial and algorithmic techniques to all kinds of problems (mostly from biology up to now, but anything fun will do).

News

2023-03-28: The journal version of "Sorting by prefix block-interchanges" will appear in Theoretical Computer Science. Software has been updated accordingly, and features in particular a new 4/3-approximation for simple permutations.
2022-09-20: I went back to using bibtex2html for my publications page. This will be improved eventually, but at least it's working now.
2022-08-20: "Sorting Genomes by Prefix Double-Cut-and-Joins", a joint work with Guillaume Fertin and Géraldine Jean, has been accepted to SPIRE 2022. An arxiv version is available here.
2021-11-03: My publication page has mysteriously stopped working. Until the issue gets resolved, you are welcome to download everything you want from this ugly listing if you need any of the papers listed at DBLP.
2021-08-13: The decompositions Python library is now available. It contains the polynomial-time algorithms for decomposing subcubic graphs described in my my paper "Decomposing subcubic graphs into claws, paths or triangles". Head over to the software page to obtain it.
2021-07-21: The Journal of Graph Theory has published my paper "Decomposing subcubic graphs into claws, paths or triangles", with Laurent Bulteau, Guillaume Fertin, Romeo Rizzi and Irena Rusu. An implementation of the algorithms it contains will soon be available.
2021-01-09: permgr now includes the results from my ISAAC 2020 paper on sorting by prefix block-interchanges. Head over to the software page to obtain it.
2020-12-14: the slides of my ISAAC 2020 talk are available in the talks section.
2020-10-30: The permgr Python library is now available. The plan is to progressively fill it with everything I've done on genome rearrangements; so far, it contains most of the results I've obtained on sorting by transpositions. Head over to the software page to obtain it.
2020-10-28: "Central limit theorem for the prefix exchange distance under Ewens sampling formula", with Simona Grusea, has been accepted by Discrete Mathematics. You can read it here.
2020-08-31: "Sorting by prefix block-interchanges" will appear in the proceedings of ISAAC 2020. An arxiv version is available here.