Stebėti
Matteo Comin
Pavadinimas
Cituota
Cituota
Metai
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
1932019
MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures
S Girotto, C Pizzi, M Comin
Bioinformatics 32 (17), i567-i575, 2016
732016
Alignment-free phylogeny of whole genomes using underlying subwords
M Comin, D Verzotto
Algorithms for Molecular Biology 7, 1-12, 2012
732012
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
372008
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
352004
Conservative extraction of over-represented extensible motifs
A Apostolico, M Comin, L Parida
Bioinformatics 21 (suppl_1), i9-i18, 2005
332005
Clustering of reads with alignment-free measures and quality values
M Comin, A Leoni, M Schimd
Algorithms for Molecular Biology 10, 1-10, 2015
322015
The irredundant class method for remote homology detection of protein sequences
M Comin, D Verzotto
Journal of Computational Biology 18 (12), 1819-1829, 2011
262011
Mining, compressing and classifying with extensible motifs
A Apostolico, M Comin, L Parida
Algorithms for Molecular Biology 1, 1-7, 2006
252006
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
222021
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
222013
Classification of protein sequences by means of irredundant patterns
M Comin, D Verzotto
BMC bioinformatics 11, 1-11, 2010
222010
MetaCon: unsupervised clustering of metagenomic contigs with probabilistic k-mers statistics and coverage
J Qian, M Comin
BMC bioinformatics 20, 1-12, 2019
212019
Assembly-free genome comparison based on next-generation sequencing reads and variable length patterns
M Comin, M Schimd
BMC bioinformatics 15, 1-10, 2014
202014
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
202014
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
202014
Whole-genome phylogeny by virtue of unic subwords
M Comin, D Verzotto
2012 23rd International Workshop on Database and Expert Systems Applications …, 2012
202012
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
202006
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
182013
Motifs in ziv-lempel-welch clef
A Apostolico, M Comin, L Parida
Data Compression Conference, 2004. Proceedings. DCC 2004, 72-81, 2004
182004
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20