Nombre de documents

18


Article dans une revue8 documents

Communication dans un congrès5 documents

  • Eric Rivals, Bastien Cazaux. Superstrings with multiplicities. Gonzalo Navarro; David Sankoff; Binhai Zhu. CPM: Combinatorial Pattern Matching, Jul 2018, Qingdao, China. Leibniz International Proceedings in Informatics (LIPIcs), 105 (21), pp.21:1-21:16, 2018, 29th Annual Symposium on Combinatorial Pattern Matching. 〈http://cpm2018.sdu.edu.cn/index.html〉. 〈10.4230/LIPIcs.CPM.2018.21〉. 〈lirmm-01843225〉
  • Bastien Cazaux, Rodrigo Cánovas, Eric Rivals. Shortest DNA cyclic cover in compressed space. Data Compression Conference, Mar 2016, Snowbird, United States. 〈lirmm-01314330〉
  • Bastien Cazaux, Gustavo Sacomoto, Eric Rivals. Superstring Graph: A New Approach for Genome Assembly. Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri Eleventh International Conference on Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. Springer International Publishing AG Switzerland, Lecture Notes in Computer Science, 9778, pp.39 - 52, 2016, Eleventh International Conference on Algorithmic Aspects in Information and Management. 〈https://aaim2016.wordpress.com/〉. 〈10.1007/978-3-319-41168-2_4〉. 〈lirmm-01446428〉
  • Bastien Cazaux, Thierry Lecroq, Eric Rivals. From Indexing Data Structures to de Bruijn Graphs. Kulikov, Alexander S.; Kuznetsov, Sergei O.; Pevzner, Pavel. CPM: Combinatorial Pattern Matching, Jun 2014, Moscow, Russia. Springer International Publishing, CPM'2014: 25th Annual Symposium on Combinatorial Pattern Matching, LNCS (8486), pp.89-99, 2014, Combinatorial Pattern Matching. 〈http://www.springer.com/computer/image+processing/book/978-3-319-07565-5〉. 〈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. Jan Holub; Jan Zd’arek. PSC'2014: Prague Stringology Conference, Sep 2014, Prague, Czech Republic. Czech Technical University in Prague, Czech Republic, ISBN 978-80-01-05547-2, pp.148-161, 2014, Proceedings of the Prague Stringology Conference 2014. 〈http://www.stringology.org/event/2014/p14.html〉. 〈lirmm-01100683〉

Pré-publication, Document de travail1 document

Rapport4 documents

  • Bastien Cazaux, Eric Rivals. A linear time algorithm for Shortest Cyclic Cover of Strings. [Research Report] IBC; LIRMM. 2015. 〈lirmm-01240278〉
  • Bastien Cazaux, Eric Rivals. 3-Shortest Superstring is 2-approximable by a greedy algorithm. [Research Report] RR-14009, LIRMM. 2014. 〈lirmm-01070596〉
  • 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. Approximation of greedy algorithms for Max-ATSP, Maximal Compression, and Shortest Cyclic Cover of Strings. RR-14001, 2013, pp.12. 〈lirmm-00932660〉