Publications

(by category and reverse chronological order)

Other pages are available on Google Scholar, DBLP, ResearcherID, Mendeley, and The Collection of Computer Science Bibliographies.

[1] Fertin, G., Labarre, A., Rusu, I., Tannier, E., and Vialette, S. Combinatorics of Genome Rearrangements. Computational Molecular Biology. The MIT Press, 2009.
Zentralblatt | MathSciNet | Publisher's page ]

Combinatorics of Genome Rearrangements: front cover
[18] Gambette, P., Gunawan, A., Labarre, A., Vialette, S. & Zhang, L.. Solving the Tree Containment Problem in Linear-Time for Nearly Stable Phylogenetic Networks. Discrete Applied Mathematics, 2017, (to appear).
[17] Bulteau, L., Fertin, G., Labarre, A., Rizzi, R. & Rusu, I.. Decomposing Cubic Graphs Into Connected Subgraphs of Size Three. In Proceedings of the 22nd International Computing and Combinatorics Conference (COCOON), 9797:393-404, Springer, 2016
[16] Grusea, S. & Labarre, A. Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution. Advances in Applied Mathematics, 78:94-13, 2016
[15] Comin, C., Labarre, A., Rizzi, R. & Vialette, S.. Sorting with Forbidden Intermediates. In Proceedings of the Third International Conference on Algorithms for Computational Biology (AlCoB), 9702:133-144, Springer, 2016
[14] Gambette, P., Gunawan, A., Labarre, A., Vialette, S. & Zhang, L.. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. In Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA), 9538:197-208, Springer, 2016
[13] Gambette, P., Gunawan, A., Labarre, A., Vialette, S. & Zhang, L.. Locating a Tree in a Phylogenetic Network in Quadratic Time. In Proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology (RECOMB), 9029:96-107, Springer, 2015
[12] Labarre, A. & Verwer, S.. Merging partially labelled trees: hardness and a declarative programming solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 11(2):389-397, 2014
[11] Blockeel, H., Bogaerts, B., Bruynooghe, M., De Cat, B., De Pooter, S., Denecker, M., Jansen, J., Labarre, A., Ramon, J. & Verwer, S.. Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3. Theory and Practice of Logic Programming, 15(6):783-817, 2015
[10] Labarre, A. Review of graph algorithms (2nd edition) by Shimon Even, edited by Guy Even. SIGACT News, 44(3):15-16, 2013
[9] Labarre, A. Lower Bounding Edit Distances between Permutations. SIAM Journal on Discrete Mathematics, 27(3):1410-1428, 2013
[8] Grusea, S. & Labarre, A. The distribution of cycles in breakpoint graphs of signed permutations. Discrete Applied Mathematics, 161(10-11):1448-1466, 2013
[7] Labarre, A. Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente. SIGACT News, 43(3):48-50, 2012
[6] Blockeel, H., Bogaerts, B., Bruynooghe, M., De Cat, B., De Pooter, S., Denecker, M., Labarre, A., Ramon, J. & Verwer, S.. Modeling Machine Learning Problems with FO(\cdot). In Technical Communications of the Twenty-Eighth International Conference on Logic Programming (ICLP), 17:14-25, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2012
[5] Labarre, A. & Cibulka, J.. Polynomial-time sortable stacks of burnt pancakes. Theoretical Computer Science, 412(8-10):695-702, 2011
[4] Labarre, A. Edit Distances and Factorisations of Even Permutations. In Proceedings of the Sixteenth Annual European Symposium on Algorithms (ESA), 5193:635-646, Springer-Verlag, 2008
[3] Doignon, J.P. & Labarre, A. On Hultman Numbers. Journal of Integer Sequences, 10(6):13, 2007, (Article 07.6.2).
[2] Labarre, A. New Bounds and Tractable Instances for the Transposition Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):380-394, IEEE Computer Society, 2006
[1] Labarre, A. A New Tight Upper Bound on the Transposition Distance. In Proceedings of the Fifth Workshop on Algorithms in Bioinformatics (WABI), 3692:216-227, Springer-Verlag, 2005
[1] Labarre, A. Combinatorial aspects of genome rearrangements and haplotype networks. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium, Sept. 2008.
pdf | Publisher's page ]
[2] Labarre, A. Distance des transpositions. Master's thesis, Université Libre de Bruxelles, Brussels, Belgium, June 2005.
pdf | Errata ]
[3] Labarre, A. Réarrangement de génomes, tri par inversions et distances entre permutations. Master's thesis, Université Libre de Bruxelles, Brussels, Belgium, June 2004.
pdf | Errata ]
[13] Labarre, A. Distributions de cycles et distances entre génomes.
[12] Labarre, A. Sorting With Forbidden Intermediates. , 2016, (Pattern Avoidance and Genome Sorting Workshop at Dagstuhl).
[11] Labarre, A. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. , 2015, (International Workshop on Combinatorial Algorithms (IWOCA)).
[10] Labarre, A. Permutations in comparative genomics. , 2012, (Workshop on Algorithms and Permutations, Paris, France (invited talk)).
[9] Labarre, A. Decomposing Cubic Graphs Into Connected Subgraphs of Size Three. , 2016, (International Computing and Combinatorics Conference (COCOON)).
[8] Labarre, A. Cycle distributions and genomic (dis)similarity. , 2011, (Spring Workshop on Mining and Learning (SML), Prüm, Germany).
[7] Labarre, A. Edit distances and factorisations of even permutations. , 2008, (Sixteenth European Symposium on Algorithms (ESA), Karlsruhe, Germany).
[6] Labarre, A. Distances d'édition et factorisations de permutations paires. , 2008, (Invited talk at the Séminaire de bioinformatique de l'équipe SEQUOIA, Lille, France).
[5] Labarre, A. Minimum common supergraphs and haplotype networks. , 2007, (Future Directions in Phylogenetic Methods and Models (PLGW03), Cambridge, United Kingdom).
[4] Labarre, A. Exploiting the disjoint cycle decomposition in genome rearrangements. , 2007, (Ordinal and Symbolic Data Analysis (OSDA), Gent, Belgium).
[3] Labarre, A. Graphs, permutations and sets in genome rearrangements. , 2006, (Computers in Scientific Discovery III (CSD3), Gent, Belgium).
[2] Labarre, A. Nouveaux résultats sur le tri par transpositions. , 2006, (Alignement et Phylogénie (ALPHY/GTGC), Lyon, France).
[1] Labarre, A. A new tight upper bound on the transposition distance. , 2005, (Fifth Workshop on Algorithms in Bioinformatics (WABI), Palma de Mallorca, Spain).

Posters

Slides for other people

  1. Géométrie de Paix: slides made for a talk given by Brussels, Belgium, June 3, 2005