Skip to Main content

Keywords

Number of documents

27


Journal articles10 documents

Conference papers9 documents

  • Sung Park, Bastien Cazaux, Kunsoo Park, Eric Rivals. Efficient Construction of Hierarchical Overlap Graphs. 27th International Symposium on String Processing and Information Retrieval (SPIRE), Oct 2020, Orlando, FL, United States. pp.277-290, ⟨10.1007/978-3-030-59212-7_20⟩. ⟨lirmm-03014336⟩
  • Bastien Cazaux, Eric Rivals. Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. 30th Annual Symposium on Combinatorial Pattern Matching (CPM), University of Pisa, Jun 2019, Pise, Italy. pp.24:1--24:20, ⟨10.4230/LIPIcs.CPM.2019.24⟩. ⟨lirmm-02382066⟩
  • Eric Rivals, Bastien Cazaux. Superstrings with multiplicities. 29th Annual Symposium on Combinatorial Pattern Matching (CPM), Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩. ⟨lirmm-01843225⟩
  • Bastien Cazaux, Samuel Juhel, Eric Rivals. Practical lower and upper bounds for the Shortest Linear Superstring. SEA: Symposium on Experimental Algorithms, Jun 2018, L'Aquilla, Italy. pp.18:1--18:14, ⟨10.4230/LIPIcs.SEA.2018.18⟩. ⟨lirmm-01929399⟩
  • Bastien Cazaux, Rodrigo Cánovas, Eric Rivals. Shortest DNA cyclic cover in compressed space. DCC: Data Compression Conference, Mar 2016, Snowbird, UT, United States. pp.536-545, ⟨10.1109/DCC.2016.79⟩. ⟨lirmm-01314330⟩
  • Bastien Cazaux, Gustavo Sacomoto, Eric Rivals. Superstring Graph: A New Approach for Genome Assembly. AAIM: Algorithmic Aspects in Information and Management, Università degli Studi di Bergamo, Jul 2016, Bergamo, Italy. pp.39-52, ⟨10.1007/978-3-319-41168-2_4⟩. ⟨lirmm-01446428⟩
  • Bastien Cazaux, Thierry Lecroq, Eric Rivals. Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. LATA: Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.109-120, ⟨10.1007/978-3-319-15579-1_8⟩. ⟨hal-01955978⟩
  • Bastien Cazaux, Thierry Lecroq, Eric Rivals. From Indexing Data Structures to de Bruijn Graphs. CPM: Combinatorial Pattern Matching, Moscow State University, Jun 2014, Moscow, Russia. pp.89-99, ⟨10.1007/978-3-319-07566-2_10⟩. ⟨lirmm-01081429⟩
  • Bastien Cazaux, Eric Rivals. Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. PSC: Prague Stringology Conference, Czech Technical University in Prague, Sep 2014, Prague, Czech Republic. pp.148-161. ⟨lirmm-01100683⟩

Poster communications2 documents

  • Bastien Cazaux, Guillaume Castel, Eric Rivals. AquaPony: Visualization and interpretation of phylogeographic information on phylogenetic trees. Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM), Jul 2018, Marseilles, France. 2018, Journées Ouvertes en Biologie, Informatique et Mathématiques : JOBIM 2018 Abstracts. ⟨hal-02733925⟩
  • Caroline Tatard, Maxime Galan, Bastien Cazaux, Adelaïde Dubois, Sarah Madrières, et al.. Etude de l’évolution de la diversité génétique intrahôte du virus Puumala lors d’infections expérimentales. 20èmes Journées Francophones de Virologie, Mar 2018, Paris, France. 2018. ⟨hal-02789410⟩

Preprints, Working Papers, ...1 document

  • Bastien Cazaux, Guillaume Castel, Eric Rivals. AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees. 2018. ⟨lirmm-01702654v3⟩

Reports4 documents

  • Bastien Cazaux, Eric Rivals. A linear time algorithm for Shortest Cyclic Cover of Strings. [Research Report] IBC; LIRMM. 2015. ⟨lirmm-01240278⟩
  • Bastien Cazaux, Thierry Lecroq, Eric Rivals. From Indexing Data Structures to de Bruijn Graphs. [Research Report] RR-14004, LIRMM. 2014. ⟨lirmm-00950983v2⟩
  • Bastien Cazaux, Eric Rivals. 3-Shortest Superstring is 2-approximable by a greedy algorithm. [Research Report] RR-14009, LIRMM. 2014. ⟨lirmm-01070596⟩
  • Bastien Cazaux, Eric Rivals. Approximation of greedy algorithms for Max-ATSP, Maximal Compression, and Shortest Cyclic Cover of Strings. RR-14001, 2013, pp.12. ⟨lirmm-00932660⟩

Theses1 document