default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Comin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Enrico Rossignolo
, Matteo Comin:
Enhanced Compression of k-Mer Sets with Counters via de Bruijn Graphs. J. Comput. Biol. 31(6): 524-538 (2024)- [c28]Enrico Rossignolo, Matteo Comin:
USTAR2: Fast and Succinct Representation of k-mer Sets Using De Bruijn Graphs. BIOSTEC (1) 2024: 368-378 - 2023
- [j34]Margherita Cavattoni, Matteo Comin:
ClassGraph: Improving Metagenomic Read Classification with Overlap Graphs. J. Comput. Biol. 30(6): 633-647 (2023) - [c27]Eleonora Mian, Enrico Petrucci, Cinzia Pizzi, Matteo Comin:
Efficient Hashing of Multiple Spaced Seeds with Application. BIOINFORMATICS 2023: 155-162 - [c26]Enrico Rossignolo, Matteo Comin:
USTAR: Improved Compression of k-mer Sets with Counters Using de Bruijn Graphs. ISBRA 2023: 202-213 - 2022
- [j33]Diego Santoro, Leonardo Pellegrina, Matteo Comin, Fabio Vandin:
SPRISS: approximating frequent k-mers by sampling reads, and applications. Bioinform. 38(13): 3343-3350 (2022) - [j32]Davide Storato, Matteo Comin:
K2Mem: Discovering Discriminative K-mers From Sequencing Data for Metagenomic Reads Classification. IEEE ACM Trans. Comput. Biol. Bioinform. 19(1): 220-229 (2022) - [c25]Mattia Marcolin, Francesco Andreace, Matteo Comin:
Efficient k-mer Indexing with Application to Mapping-free SNP Genotyping. BIOINFORMATICS 2022: 62-70 - 2021
- [j31]Matteo Comin, Barbara Di Camillo, Cinzia Pizzi, Fabio Vandin:
Comparison of microbiome samples: methods and computational challenges. Briefings Bioinform. 22(1): 88-95 (2021) - [j30]Francesco Andreace, Cinzia Pizzi, Matteo Comin:
MetaProb 2: Metagenomic Reads Binning Based on Assembly Using Minimizers and K-Mers Statistics. J. Comput. Biol. 28(11): 1052-1062 (2021) - [j29]Jens Allmer, Mourad Elloumi, Matteo Comin, Ralf Hofestädt:
Special Issue of the 1st International Applied Bioinformatics Conference (iABC'21). J. Integr. Bioinform. 18(4) (2021) - [j28]Maurilio Monsu, Matteo Comin:
Fast alignment of reads to a variation graph with application to SNP detection. J. Integr. Bioinform. 18(4) (2021) - [c24]Margherita Cavattoni, Matteo Comin:
Boosting Metagenomic Classification with Reads Overlap Graphs. ISBRA 2021: 521-533 - 2020
- [j27]Enrico Petrucci, Laurent Noé, Cinzia Pizzi, Matteo Comin:
Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing. J. Comput. Biol. 27(2): 223-233 (2020) - [c23]Francesco Andreace, Cinzia Pizzi, Matteo Comin:
MetaProb 2: Improving Unsupervised Metagenomic Binning with Efficient Reads Assembly Using Minimizers. ICCABS 2020: 15-25 - [c22]Davide Storato, Matteo Comin:
Improving Metagenomic Classification Using Discriminative k-mers from Sequencing Data. ISBRA 2020: 68-81
2010 – 2019
- 2019
- [j26]Yoshihiro Shibuya, Matteo Comin:
Better quality score compression through sequence-based quality smoothing. BMC Bioinform. 20-S(9): 302:1-302:11 (2019) - [j25]Jia Qian, Matteo Comin:
MetaCon: unsupervised clustering of metagenomic contigs with probabilistic k-mers statistics and coverage. BMC Bioinform. 20-S(9): 367:1-367:12 (2019) - [j24]Yoshihiro Shibuya, Matteo Comin:
Indexing k-mers in linear space for quality value compression. J. Bioinform. Comput. Biol. 17(5): 1940011:1-1940011:15 (2019) - [c21]Yoshihiro Shibuya, Matteo Comin:
Indexing k-mers in Linear-space for Quality Value Compression. BIOINFORMATICS 2019: 21-29 - [c20]Enrico Petrucci, Laurent Noé, Cinzia Pizzi, Matteo Comin:
Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing. ISBRA 2019: 208-219 - 2018
- [j23]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
FSH: fast spaced seed hashing exploiting adjacent hashes. Algorithms Mol. Biol. 13(1): 8:1-8:11 (2018) - [c19]Jia Qian, Matteo Comin, Livio Pianura:
Data-Driven Smart Bike-Sharing System by Implementing Machine Learning Algorithms. ES 2018: 50-55 - 2017
- [j22]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Metagenomic reads binning with spaced seeds. Theor. Comput. Sci. 698: 88-99 (2017) - [c18]Davide Marchiori, Matteo Comin:
SKraken: Fast and Sensitive Classification of Short Metagenomic Reads based on Filtering Uninformative k-mers. BIOINFORMATICS 2017: 59-67 - [c17]Jia Qian, Davide Marchiori, Matteo Comin:
Fast and Sensitive Classification of Short Metagenomic Reads with SKraken. BIOSTEC (Selected Papers) 2017: 212-226 - [c16]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Binning metagenomic reads with probabilistic sequence signatures based on spaced seeds. CIBCB 2017: 1-8 - [c15]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Fast Spaced Seed Hashing. WABI 2017: 7:1-7:14 - [p1]Matteo Comin, Michele Schimd:
Assembly-Free Techniques for NGS Data. Algorithms for Next-Generation Sequencing Data 2017: 327-355 - 2016
- [j21]Samuele Girotto, Cinzia Pizzi, Matteo Comin:
MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures. Bioinform. 32(17): 567-575 (2016) - [j20]Matteo Comin, Morris Antonello:
On the comparison of regulatory sequences with multiple resolution Entropic Profiles. BMC Bioinform. 17: 130 (2016) - [c14]Samuele Girotto, Matteo Comin, Cinzia Pizzi:
Higher recall in metagenomic sequence classification exploiting Overlapping Reads. ICCABS 2016: 1 - 2015
- [j19]Matteo Comin, Andrea Leoni, Michele Schimd:
Clustering of reads with alignment-free measures and quality values. Algorithms Mol. Biol. 10: 4 (2015) - [c13]Matteo Comin, Morris Antonelli:
Fast Alignment-free Comparison for Regulatory Sequences using Multiple Resolution Entropic Profiles. BIOINFORMATICS 2015: 171-177 - 2014
- [j18]Matteo Comin, Michele Schimd:
Assembly-free genome comparison based on next-generation sequencing reads and variable length patterns. BMC Bioinform. 15(S-9): S1 (2014) - [j17]Matteo Comin, Montse Farreras:
Parallel Continuous Flow: A Parallel Suffix Tree Construction Tool for Whole Genomes. J. Comput. Biol. 21(4): 330-344 (2014) - [j16]Matteo Comin, Morris Antonello:
Fast Entropic Profiler: An InformationTheoretic Approach for the Discovery ofPatterns in Genomes. IEEE ACM Trans. Comput. Biol. Bioinform. 11(3): 500-509 (2014) - [j15]Matteo Comin, Davide Verzotto:
Beyond Fixed-Resolution Alignment-Free Measures for Mammalian Enhancers Sequence Comparison. IEEE ACM Trans. Comput. Biol. Bioinform. 11(4): 628-637 (2014) - [c12]Matteo Comin, Andrea Leoni, Michele Schimd:
QCluster: Extending Alignment-Free Measures with Quality Values for Reads Clustering. WABI 2014: 1-13 - [e1]Matteo Comin, Lukas Käll, Elena Marchiori, Alioune Ngom, Jagath C. Rajapakse:
Pattern Recognition in Bioinformatics - 9th IAPR International Conference, PRIB 2014, Stockholm, Sweden, August 21-23, 2014. Proceedings. Lecture Notes in Computer Science 8626, Springer 2014, ISBN 978-3-319-09191-4 [contents] - 2013
- [j14]Matteo Comin, Davide Verzotto:
Filtering Degenerate Patterns with Application to Protein Sequence Analysis. Algorithms 6(2): 352-370 (2013) - [j13]Alberto Apostolico, Matteo Comin, Andreas W. M. Dress, Laxmi Parida:
Ultrametric networks: a new tool for phylogenetic analysis. Algorithms Mol. Biol. 8: 7 (2013) - [c11]Matteo Comin, Davide Verzotto:
Reducing the Space of Degenerate Patterns in Protein Remote Homology Detection. DEXA Workshops 2013: 76-80 - [c10]Matteo Comin, Morris Antonello:
Fast Computation of Entropic Profiles for the Detection of Conservation in Genomes. PRIB 2013: 277-288 - [c9]Matteo Comin, Montse Farreras:
Efficient parallel construction of suffix trees for genomes larger than main memory. EuroMPI 2013: 211-216 - 2012
- [j12]Matteo Comin, Davide Verzotto:
Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms Mol. Biol. 7: 34 (2012) - [c8]Matteo Comin, Davide Verzotto:
Whole-Genome Phylogeny by Virtue of Unic Subwords. DEXA Workshops 2012: 190-194 - 2011
- [j11]Matteo Comin, Davide Verzotto:
The Irredundant Class Method for Remote Homology Detection of Protein Sequences. J. Comput. Biol. 18(12): 1819-1829 (2011) - 2010
- [j10]Matteo Comin, Davide Verzotto:
Classification of protein sequences by means of irredundant patterns. BMC Bioinform. 11(S-1): 16 (2010) - [j9]Alberto Apostolico, Matteo Comin, Laxmi Parida:
VARUN: Discovering Extensible Motifs under Saturation Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 752-762 (2010) - [i1]Matteo Comin, Davide Verzotto:
Remote Homology Detection of Protein Sequences. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010
2000 – 2009
- 2009
- [j8]Matteo Comin, Concettina Guerra, Frank Dellaert:
Binding Balls: Fast Detection of Binding Sites Using a Property of Spherical Fourier Transform. J. Comput. Biol. 16(11): 1577-1591 (2009) - 2008
- [j7]Matteo Comin, Concettina Guerra, Giuseppe Zanotti:
Mining Overrepresented 3D Patterns of Secondary Structures in proteins. J. Bioinform. Comput. Biol. 6(6): 1067-1087 (2008) - [j6]Matteo Comin, Laxmi Parida:
Detection of subtle variations as consensus motifs. Theor. Comput. Sci. 395(2-3): 158-170 (2008) - 2007
- [j5]Giovanni Ciriello, Matteo Comin, Concettina Guerra:
Algorithmic re-structuring and data replication for protein structure comparison on a GRID. Future Gener. Comput. Syst. 23(3): 391-397 (2007) - [c7]Matteo Comin, Laxmi Parida:
Subtle Motif Discovery for Detection of DNA Regulatory Sites. APBC 2007: 27-36 - 2006
- [j4]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Mining, compressing and classifying with extensible motifs. Algorithms Mol. Biol. 1 (2006) - [c6]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Bridging Lossy and Lossless Compression by Motif Pattern Discovery. GTIT-C 2006: 793-813 - [c5]Giovanni Ciriello, Matteo Comin, Concettina Guerra:
Application re-structuring and data management on a grid environment: a case study for bioinformatics. IPDPS 2006 - 2005
- [j3]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Bridging Lossy and Lossless Compression by Motif Pattern Discovery. Electron. Notes Discret. Math. 21: 219-225 (2005) - [c4]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Off-Line Compression by Extensible Motifs. DCC 2005: 450 - [c3]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Conservative extraction of over-represented extensible motifs. ISMB (Supplement of Bioinformatics) 2005: 9-18 - 2004
- [j2]Matteo Comin, Concettina Guerra, Giuseppe Zanotti:
PROuST: A Comparison Method of Three-Dimensional Structures of Proteins Using Indexing Techniques. J. Comput. Biol. 11(6): 1061-1072 (2004) - [j1]Matteo Comin, Carlo Ferrari, Concettina Guerra:
Grid Deployment Of Bioinformatics Applications: A Case Study In Protein Similarity Determination. Parallel Process. Lett. 14(2): 163-176 (2004) - [c2]Alberto Apostolico, Matteo Comin, Laxmi Parida:
Motifs in Ziv-Lempel-Welch Clef. Data Compression Conference 2004: 72-81 - [c1]Mario Cannataro, Matteo Comin, Carlo Ferrari, Concettina Guerra, Antonella Guzzo, Pierangelo Veltri:
Modelling a Protein Structure Comparison Application on the Grid Using PROTEUS. SAG 2004: 75-85
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
