| Benchmarking of alignment-free sequence comparison methods A Zielezinski, HZ Girgis, G Bernard, CA Leimeister, K Tang, T Dencker, ... Genome biology 20, 1-18, 2019 | 185 | 2019 |
| Alignment-free phylogeny of whole genomes using underlying subwords M Comin, D Verzotto Algorithms for Molecular Biology 7, 1-12, 2012 | 73 | 2012 |
| MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures S Girotto, C Pizzi, M Comin Bioinformatics 32 (17), i567-i575, 2016 | 70 | 2016 |
| VARUN: discovering extensible motifs under saturation constraints A Apostolico, M Comin, L Parida IEEE/ACM Transactions on Computational Biology and Bioinformatics 7 (4), 752-762, 2008 | 37 | 2008 |
| PROuST: a comparison method of three-dimensional structures of proteins using indexing techniques M Comin, C Guerra, G Zanotti Journal of Computational Biology 11 (6), 1061-1072, 2004 | 35 | 2004 |
| Conservative extraction of over-represented extensible motifs A Apostolico, M Comin, L Parida ISMB (Supplement of Bioinformatics) 21, 9-18, 2005 | 33 | 2005 |
| Clustering of reads with alignment-free measures and quality values M Comin, A Leoni, M Schimd Algorithms for Molecular Biology 10, 1-10, 2015 | 32 | 2015 |
| The irredundant class method for remote homology detection of protein sequences M Comin, D Verzotto Journal of Computational Biology 18 (12), 1819-1829, 2011 | 26 | 2011 |
| Mining, compressing and classifying with extensible motifs A Apostolico, M Comin, L Parida Algorithms for Molecular Biology 1, 1-7, 2006 | 25 | 2006 |
| Comparison of microbiome samples: methods and computational challenges M Comin, B Di Camillo, C Pizzi, F Vandin Briefings in bioinformatics 22 (1), 88-95, 2021 | 22 | 2021 |
| Efficient parallel construction of suffix trees for genomes larger than main memory M Comin, M Farreras Proceedings of the 20th European MPI Users' Group Meeting, 211-216, 2013 | 22 | 2013 |
| Classification of protein sequences by means of irredundant patterns M Comin, D Verzotto BMC bioinformatics 11, 1-11, 2010 | 22 | 2010 |
| Assembly-free genome comparison based on next-generation sequencing reads and variable length patterns M Comin, M Schimd BMC bioinformatics 15, 1-10, 2014 | 20 | 2014 |
| Beyond fixed-resolution alignment-free measures for mammalian enhancers sequence comparison M Comin, D Verzotto IEEE/ACM Transactions on Computational Biology and Bioinformatics 11 (4 …, 2014 | 20 | 2014 |
| Fast entropic profiler: An information theoretic approach for the discovery of patterns in genomes M Comin, M Antonello IEEE/ACM Transactions on Computational Biology and Bioinformatics 11 (3 …, 2014 | 20 | 2014 |
| Whole-genome phylogeny by virtue of unic subwords M Comin, D Verzotto 2012 23rd International Workshop on Database and Expert Systems Applications …, 2012 | 20 | 2012 |
| Bridging lossy and lossless compression by motif pattern discovery A Apostolico, M Comin, L Parida General theory of information transfer and combinatorics, 793-813, 2006 | 20 | 2006 |
| MetaCon: unsupervised clustering of metagenomic contigs with probabilistic k-mers statistics and coverage J Qian, M Comin BMC bioinformatics 20, 1-12, 2019 | 19 | 2019 |
| Fast computation of entropic profiles for the detection of conservation in genomes M Comin, M Antonello Pattern Recognition in Bioinformatics: 8th IAPR International Conference …, 2013 | 18 | 2013 |
| Motifs in ziv-lempel-welch clef A Apostolico, M Comin, L Parida Data Compression Conference, 2004. Proceedings. DCC 2004, 72-81, 2004 | 18 | 2004 |
Davide Verzotto, Eng., Ph.D.Assistant Professor of Computer Science, CASD, Stato Maggiore della Difesa, RomeVerified email at ssuos.difesa.it
