BC
        
    
                            Bastien Cazaux
                                    32 
                                    
                            Documents
                                Présentation
Publications
                    
                    
                    29
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    3
                
                            
                    
                    
                    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
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    6
                
                            
                    
                    
                    7
                
                            
                    
                    
                    2
                
                            
                    
                    
                    5
                
                            
                    
                    
                    1
                
                    
                    
                    
                    11
                
                            
                    
                    
                    10
                
                            
                    
                    
                    7
                
                            
                    
                    
                    5
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    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
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    Publications
| 
        
                             | 
        
        
            Toward Optimal Fingerprint Indexing for Large Scale GenomicsWABI 2022 - 22nd International Workshop on Algorithms in Bioinformatics, Sep 2022, Postdam, Germany. pp.25:1-25:15, ⟨10.4230/LIPIcs.WABI.2022.25⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-04121819
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            A Linear Time Algorithm for Constructing Hierarchical Overlap GraphsCPM 2021 - 32nd Annual Symposium on Combinatorial Pattern Matching, Institute of Computer Science of University of Wrocław, Poland., Jul 2021, Wrocław, Poland. pp.22:1--22:9, ⟨10.4230/LIPIcs.CPM.2021.22⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-03431830
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Efficient Construction of Hierarchical Overlap GraphsSPIRE 2020 - 27th International Symposium on String Processing and Information Retrieval, Oct 2020, Orlando, FL, United States. pp.277-290, ⟨10.1007/978-3-030-59212-7_20⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-03014336
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length EncodingCPM 2019 - 30th Annual Symposium on Combinatorial Pattern Matching, University of Pisa, Jun 2019, Pise, Italy. pp.24:1--24:20, ⟨10.4230/LIPIcs.CPM.2019.24⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-02382066
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Superstrings with multiplicities29th Annual Symposium on Combinatorial Pattern Matching (CPM), Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-01843225
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Practical lower and upper bounds for the Shortest Linear SuperstringSEA: Symposium on Experimental Algorithms, Jun 2018, L'Aquilla, Italy. pp.18:1--18:14, ⟨10.4230/LIPIcs.SEA.2018.18⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-01929399
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Superstring Graph: A New Approach for Genome AssemblyAAIM: 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⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-01446428
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Shortest DNA cyclic cover in compressed spaceDCC: Data Compression Conference, Mar 2016, Snowbird, UT, United States. pp.536-545, ⟨10.1109/DCC.2016.79⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-01314330
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Construction of a de Bruijn Graph for Assembly from a Truncated Suffix TreeLATA: Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.109-120, ⟨10.1007/978-3-319-15579-1_8⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    hal-01955978
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of StringsPSC: Prague Stringology Conference, Czech Technical University in Prague, Sep 2014, Prague, Czech Republic. pp.148-161 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-01100683
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            From Indexing Data Structures to de Bruijn GraphsCPM: Combinatorial Pattern Matching, Moscow State University, Jun 2014, Moscow, Russia. pp.89-99, ⟨10.1007/978-3-319-07566-2_10⟩ 
                 Communication dans un congrès
                    
        
        
            
                
                    lirmm-01081429
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Search algorithms for dinucleotide Position Weight MatricesSociété Française de Bioinformatique (S.F.B.I.). Journées Ouvertes en Biologie, Informatique et Mathématiques 2021, Jul 2021, Paris, France. , pp.100, 2021, Actes des Journées Ouvertes en Biologie, Informatique et Mathématiques 2021 
                 Poster de conférence
                    
        
        
            
                
                    lirmm-03442434
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Etude de l’évolution de la diversité génétique intrahôte du virus Puumala lors d’infections expérimentales20èmes Journées Francophones de Virologie, Mar 2018, Paris, France. 2018 
                 Poster de conférence
                    
        
        
            
                
                    hal-02789410
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            AquaPony: Visualization and interpretation of phylogeographic information on phylogenetic treesJOBIM 2018 - 19es Journées Ouvertes en Biologie, Informatique et Mathématiques, Jul 2018, Marseille, France. , 2018 
                 Poster de conférence
                    
        
        
            
                
                    hal-02733925
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring2021 
                 Pré-publication, Document de travail
                    
        
        
            
                
                    lirmm-03442437
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees2018 
                 Pré-publication, Document de travail
                    
        
        
            
                
                    lirmm-01702654
                                            v3
                                    
            
        
     | 
| 
        
                             | 
        
        
            A linear time algorithm for Shortest Cyclic Cover of Strings[Research Report] IBC; LIRMM. 2015 
                 Rapport
                             (rapport de recherche)
                    
        
        
            
                
                    lirmm-01240278
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            From Indexing Data Structures to de Bruijn Graphs[Research Report] RR-14004, LIRMM. 2014 
                 Rapport
                             (rapport de recherche)
                    
        
        
            
                
                    lirmm-00950983
                                            v2
                                    
            
        
     | 
| 
        
                             | 
        
        
            3-Shortest Superstring is 2-approximable by a greedy algorithm[Research Report] RR-14009, LIRMM. 2014 
                 Rapport
                             (rapport de recherche)
                    
        
        
            
                
                    lirmm-01070596
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Approximation of greedy algorithms for Max-ATSP, Maximal Compression, and Shortest Cyclic Cover of StringsRR-14001, 2013, pp.12 
                 Rapport
                    
        
        
            
                
                    lirmm-00932660
                                            v1
                                    
            
        
     | 
| 
        
                             | 
        
        
            Approximation de superchaîne, indexation et assemblage de génomeAutre [cs.OH]. Université Montpellier, 2016. Français. ⟨NNT : 2016MONTT307⟩ 
                 Thèse
                    
        
        
            
                
                    tel-01816974
                                            v1
                                    
            
        
     | 
                Chargement...
            
            Chargement...