- 12
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
AL
Anthony Labarre
Maître de conférences à l'Université Gustave Eiffel.
25
Documents
Researcher identifiers
anthony-labarre
-
0000-0002-9945-6774
- IdRef : 197512712
- Google Scholar : https://scholar.google.fr/citations?user=Ot-5hRQAAAAJ
Presentation
Publications
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 8
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 2
- 3
- 2
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 2
Sorting Genomes by Prefix Double-Cut-and-JoinsString Processing and Information Retrieval, 29th International Symposium, SPIRE 2022, Nov 2022, Concepcion, Chile. pp.178-190, ⟨10.1007/978-3-031-20643-6_13⟩
Conference papers
hal-03958465v1
|
|
|
Sorting by prefix block-interchangesISAAC 2020, Dec 2020, Hong-Kong, China. pp.55:1-55:15, ⟨10.4230/LIPIcs.ISAAC.2020.55⟩
Conference papers
hal-02926790v1
|
The Clever Shopper ProblemThe 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩
Conference papers
hal-01715824v1
|
|
|
Sorting With Forbidden IntermediatesThird 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. ⟨10.1016/j.dam.2019.10.025⟩
Conference papers
hal-01287040v1
|
|
Decomposing Cubic Graphs into Connected Subgraphs of Size ThreeThe 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩
Conference papers
hal-01309152v1
|
|
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic TimeIWOCA 2015, Oct 2015, Verona, Italy. pp.197-208, ⟨10.1007/978-3-319-29516-9_17⟩
Conference papers
hal-01226035v1
|
|
Locating a Tree in a Phylogenetic Network in Quadratic TimeRECOMB 2015, Apr 2015, Varsovie, Poland. pp.96-107, ⟨10.1007/978-3-319-16706-0_12⟩
Conference papers
hal-01116231v1
|
|
Modeling Machine Learning and Data Mining Problems with FO(*)The 28th International Conference on Logic Programming (ICLP'12), Sep 2012, Hungary. pp.14-25
Conference papers
hal-00731459v1
|
|
Edit distances and factorisations of even permutationsProceedings of the Sixteenth Annual European Symposium on Algorithms (ESA), Sep 2008, Germany. pp.635-646, ⟨10.1007/978-3-540-87744-8_53⟩
Conference papers
hal-00728921v1
|
|
A new tight upper bound on the transposition distanceWorkshop on Algorithms in Bioinformatics (WABI), Sep 2005, Spain. pp.216-227, ⟨10.1007/11557067_18⟩
Conference papers
hal-00728796v1
|
Combinatorics of Genome RearrangementsMIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Books
hal-00416453v1
|
|
Combinatorial aspects of genome rearrangements and haplotype networksComputer Science [cs]. Université Libre de Bruxelles, 2008. English. ⟨NNT : ⟩
Theses
tel-00482196v1
|