Skip to Main content

Researcher identifiers

  • IdHAL : anthony-labarre
Number of documents

22


Journal articles11 documents

  • Simona Grusea, Anthony Labarre. Central limit theorem for the prefix exchange distance under Ewens sampling formula. Discrete Mathematics, Elsevier, 2021, 344 (2), pp.Article 112206. ⟨hal-02494137⟩
  • Laurent Bulteau, Danny Hermelin, Dušan Knop, Anthony Labarre, Stéphane Vialette. The Clever Shopper Problem. Theory of Computing Systems, Springer Verlag, In press, ⟨10.1007/s00224-019-09917-z⟩. ⟨hal-01998054⟩
  • Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette. Sorting With Forbidden Intermediates. Discrete Applied Mathematics, Elsevier, In press, ⟨10.1016/j.dam.2019.10.025⟩. ⟨hal-02341509⟩
  • Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discrete Applied Mathematics, Elsevier, 2018, 246, pp.62-79. ⟨10.1016/j.dam.2017.07.015⟩. ⟨hal-01575001⟩
  • Simona Grusea, Anthony Labarre. Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution. Advances in Applied Mathematics, Elsevier, 2016, 78, pp.94-113. ⟨10.1016/j.aam.2016.04.002⟩. ⟨hal-01242140⟩
  • Anthony Labarre, Sicco Verwer. Merging partially labelled trees: hardness and a declarative programming solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2014, 11 (2), pp.389-397. ⟨10.1109/TCBB.2014.2307200⟩. ⟨hal-00855669⟩
  • Anthony Labarre. Lower bounding edit distances between permutations. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2013, 27 (3), pp.1410-1428. ⟨10.1137/13090897X⟩. ⟨hal-00826968⟩
  • Simona Grusea, Anthony Labarre. The distribution of cycles in breakpoint graphs of signed permutations. Discrete Applied Mathematics, Elsevier, 2013, 161 (10-11), pp.1448-1466. ⟨10.1016/j.dam.2013.02.002⟩. ⟨hal-00809299⟩
  • Anthony Labarre, Josef Cibulka. Polynomial-time sortable stacks of burnt pancakes. Theoretical Computer Science, Elsevier, 2011, 412 (8-10), pp.695-702. ⟨hal-00728920⟩
  • Jean-Paul Doignon, Anthony Labarre. On Hultman numbers. Journal of Integer Sequences, University of Waterloo, 2007, 10 (6), pp.13. ⟨hal-00728923⟩
  • Anthony Labarre. New bounds and tractable instances for the transposition distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2006, 3 (4), pp.380-394. ⟨10.1109/TCBB.2006.56⟩. ⟨hal-00728947⟩

Conference papers8 documents

  • Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette. The Clever Shopper Problem. The 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩. ⟨hal-01715824⟩
  • Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three. The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨hal-01309152⟩
  • Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette. Sorting With Forbidden Intermediates. Third International Conference on Algorithms for Computational Biology (AlCoB 2016), María Botón-Fernández; Carlos Martín-Vide; Miguel A. Vega-Rodríguez; Florentina Lilica Voicu, Jun 2016, Trujillo, Spain. ⟨hal-01287040⟩
  • Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015, Apr 2015, Varsovie, Poland. pp.96-107, ⟨10.1007/978-3-319-16706-0_12⟩. ⟨hal-01116231⟩
  • Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015, Oct 2015, Verona, Italy. pp.197-208, ⟨10.1007/978-3-319-29516-9_17⟩. ⟨hal-01226035⟩
  • Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes de Cat, Stef de Pooter, et al.. Modeling Machine Learning and Data Mining Problems with FO(*). The 28th International Conference on Logic Programming (ICLP'12), Sep 2012, Hungary. pp.14-25. ⟨hal-00731459⟩
  • Anthony Labarre. Edit distances and factorisations of even permutations. Proceedings of the Sixteenth Annual European Symposium on Algorithms (ESA), Sep 2008, Germany. pp.635-646, ⟨10.1007/978-3-540-87744-8_53⟩. ⟨hal-00728921⟩
  • Anthony Labarre. A new tight upper bound on the transposition distance. Workshop on Algorithms in Bioinformatics (WABI), Sep 2005, Spain. pp.216-227, ⟨10.1007/11557067_18⟩. ⟨hal-00728796⟩

Books1 document

  • Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette. Combinatorics of Genome Rearrangements. MIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4. ⟨hal-00416453⟩

Preprints, Working Papers, ...1 document

Theses1 document

  • Anthony Labarre. Combinatorial aspects of genome rearrangements and haplotype networks. Computer Science [cs]. Université Libre de Bruxelles, 2008. English. ⟨tel-00482196⟩