| KIS SPLICE: de-novo calling alternative splicing events from RNA-seq data GAT Sacomoto, J Kielbassa, R Chikhi, R Uricaru, P Antoniou, MF Sagot, ... BMC bioinformatics 13, 1-12, 2012 | 131 | 2012 |
| Optimal listing of cycles and st-paths in undirected graphs E Birmelé, R Ferreira, R Grossi, A Marino, N Pisanti, R Rizzi, G Sacomoto Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 120 | 2013 |
| Using cascading Bloom filters to improve the memory usage for de Brujin graphs K Salikhov, G Sacomoto, G Kucherov Algorithms for Molecular Biology 9, 1-10, 2014 | 90 | 2014 |
| Using cascading Bloom filters to improve the memory usage for de Brujin graphs K Salikhov, G Sacomoto, G Kucherov International Workshop on Algorithms in Bioinformatics, 364-376, 2013 | 62 | 2013 |
| Complementarity of assembly-first and mapping-first approaches for alternative splicing annotation and differential analysis from RNAseq data C Benoit-Pilven, C Marchet, E Chautard, L Lima, MP Lambert, ... Scientific reports 8 (1), 4307, 2018 | 40 | 2018 |
| Efficiently Listing Bounded Length st-Paths R Rizzi, G Sacomoto, MF Sagot International Workshop on Combinatorial Algorithms, 318-329, 2014 | 36 | 2014 |
| Lossless filter for multiple repeats with bounded edit distance P Peterlongo, GAT Sacomoto, AP Do Lago, N Pisanti, MF Sagot Algorithms for Molecular Biology 4, 1-20, 2009 | 29 | 2009 |
| Efficient bubble enumeration in directed graphs E Birmelé, P Crescenzi, R Ferreira, R Grossi, V Lacroix, A Marino, ... String Processing and Information Retrieval: 19th International Symposium …, 2012 | 27 | 2012 |
| Computing and Listing st-Paths in Public Transportation Networks K Böhmová, L Häfliger, M Mihalák, T Pröger, G Sacomoto, MF Sagot Theory of Computing Systems 62, 600-621, 2018 | 26 | 2018 |
| Amortized-delay algorithm for listing chordless cycles in undirected graphs R Ferreira, R Grossi, R Rizzi, G Sacomoto, MF Sagot European Symposium on Algorithms, 418-429, 2014 | 24 | 2014 |
| Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads L Lima, B Sinaimeri, G Sacomoto, H Lopez-Maestre, C Marchet, V Miele, ... Algorithms for molecular biology 12, 1-19, 2017 | 23 | 2017 |
| A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data G Sacomoto, V Lacroix, MF Sagot International Workshop on Algorithms in Bioinformatics, 99-111, 2013 | 13 | 2013 |
| Colib’read on galaxy: a tools suite dedicated to biological information extraction from raw NGS reads Y Le Bras, O Collin, C Monjeaud, V Lacroix, É Rivals, C Lemaitre, V Miele, ... GigaScience 5 (1), s13742-015-0105-2, 2016 | 11 | 2016 |
| On bubble generators in directed graphs V Acuna, R Grossi, GF Italiano, L Lima, R Rizzi, G Sacomoto, MF Sagot, ... Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017 | 9 | 2017 |
| Navigating in a sea of repeats in rna-seq without drowning G Sacomoto, B Sinaimeri, C Marchet, V Miele, MF Sagot, V Lacroix International Workshop on Algorithms in Bioinformatics, 82-96, 2014 | 7 | 2014 |
| Algorithms in Bioinformatics K Salikhov, G Sacomoto, G Kucherov Springer, 2013 | 5 | 2013 |
| Complementarity of assembly-first and mapping-first approaches for alternative splicing annotation and differential analysis from RNAseq data. Sci Rep 8: 4307 C Benoit-Pilven, C Marchet, E Chautard, L Lima, MP Lambert, ... | 4 | 2018 |
| Superstring Graph: a new approach for genome assembly B Cazaux, G Sacomoto, E Rivals Algorithmic Aspects in Information and Management: 11th International …, 2016 | 4 | 2016 |
| Efficient algorithms for de novo assembly of alternative splicing events from RNA-seq data G Sacomoto arXiv preprint arXiv:1406.6047, 2014 | 3 | 2014 |
| On bubble generators in directed graphs V Acuna, R Grossi, GF Italiano, L Lima, R Rizzi, G Sacomoto, MF Sagot, ... Algorithmica 82, 898-914, 2020 | 2 | 2020 |
Marie-France SagotDirector of Research, InriaVerified email at inria.fr