COMIN, MATTEO
 Distribuzione geografica
Continente #
NA - Nord America 4.238
EU - Europa 422
AS - Asia 388
SA - Sud America 2
OC - Oceania 1
Totale 5.051
Nazione #
US - Stati Uniti d'America 4.238
CN - Cina 206
SG - Singapore 176
IT - Italia 129
FI - Finlandia 81
FR - Francia 43
UA - Ucraina 43
GB - Regno Unito 41
DE - Germania 39
SE - Svezia 30
IE - Irlanda 10
IN - India 4
CH - Svizzera 2
CL - Cile 2
NL - Olanda 2
AT - Austria 1
AU - Australia 1
CZ - Repubblica Ceca 1
ID - Indonesia 1
TR - Turchia 1
Totale 5.051
Città #
Fairfield 840
Woodbridge 512
Houston 333
Ann Arbor 315
Ashburn 311
Seattle 262
Cambridge 252
Wilmington 249
Jacksonville 226
Chandler 160
Singapore 127
San Diego 109
Princeton 92
Medford 63
Padova 60
Beijing 47
Des Moines 40
Nanjing 33
Helsinki 31
Boardman 28
Roxbury 24
Los Angeles 15
Shenyang 15
Hebei 13
Milan 13
Santa Clara 13
Guangzhou 12
Dublin 10
London 9
Jiaxing 8
Nanchang 8
Ogden 8
Norwalk 7
Argenta 5
Kilburn 5
San Francisco 5
Chicago 4
Falls Church 4
Hefei 4
Palermo 4
Schio 4
Tappahannock 4
Zhengzhou 4
Dearborn 3
Islington 3
Jinan 3
New York 3
Tianjin 3
Atlanta 2
Azzano Decimo 2
Castel 2
Castelfranco Veneto 2
Changsha 2
Chiswick 2
Haikou 2
Hanover 2
Indiana 2
Livorno 2
Prescot 2
Rockville 2
Rosà 2
Santa Lucia Di Piave 2
Santiago 2
Taizhou 2
Treviso 2
Zurich 2
Acton 1
Agordo 1
Amsterdam 1
Ariano nel Polesine 1
Bagnaria Arsa 1
Beaverton 1
Borås 1
Cassino 1
College Station 1
Conegliano 1
Dallas 1
Frankfurt am Main 1
Greeley 1
Hounslow 1
Istanbul 1
Kharkiv 1
Lappeenranta 1
Mestre 1
New Bedfont 1
Nuremberg 1
Rome 1
Selargius 1
Sesto Fiorentino 1
Shanghai 1
Southwark 1
Stockholm 1
Sydney 1
Venice 1
Wandsworth 1
Wuhan 1
Totale 4.369
Nome #
Bridging lossy and lossless compression by motif pattern discovery 133
Whole-Genome Phylogeny by Virtue of Unic Subwords 112
Data-driven smart bike-sharing system by implementing machine learning algorithms 110
Application Re-Structuring and Data Management on a GRID Environment: a Case Study for Bioinformatics 107
Better quality score compression through sequence-based quality smoothing 106
Classification of Protein Sequences by means of Irredundant Patterns 103
Algorithmic Re-Structuring and Data Replication for Protein Structure Comparison on a Grid 100
Conservative Extraction of Over-represented Extensible Motifs 98
Grid Deployment of Bioinformatics Applications: a Case Study in Protein Similarity Determination 98
Bridging Lossy and Lossless Compression by Motif Pattern Discovery 96
MetaProb: Accurate metagenomic reads binning based on probabilistic sequence signatures 95
Higher recall in metagenomic sequence classification exploiting Overlapping Reads 95
Detection of Subtle Variations as Consensus Motifs 94
QCluster: Extending Alignment-Free Measures with Quality Values for Reads ClusteringAlgorithms in Bioinformatics 94
Clustering of reads with alignment-free measures and quality values 91
Modelling a Protein Structure Comparison Application on the Grid using PROTEUS 91
Motifs in Ziv-Lempel-Welch Clef 89
Benchmarking of alignment-free sequence comparison methods 88
VARUN: Discovering Extensible Motifs under Saturation Constraints 87
Beyond fixed-resolution alignment-free measures for mammalian enhancers sequence comparison 87
Modelling a Protein Structure Comparison Application on the Grid Using PROTEUS 86
The IrredundantClass Method for Remote Homology Detection of Protein Sequences 85
Fast Alignment-free Comparison for Regulatory Sequences using Multiple Resolution Entropic Profiles 84
SKraken: Fast and Sensitive Classification of Short Metagenomic Reads based on Filtering Uninformative k-mers 82
Fast and sensitive classification of short metagenomic reads with SKraken 82
Higher recall in metagenomic sequence classification exploiting overlapping reads 81
MetaCon: unsupervised clustering of metagenomic contigs with probabilistic k-mers statistics and coverage 81
Protein Structure Comparison, High Performance Computing 79
Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and k-mer Hashing 77
On the comparison of regulatory sequences with multiple resolution Entropic Profiles 77
Fast Entropic Profiler: An Information Theoretic Approach for the Discovery of Patterns in Genomes 76
Alignment-Free Phylogeny of Whole Genomes using Underlying Subwords 74
Mining Over-Represented 3D Patterns of Secondary Structures in Proteins 71
Binning metagenomic reads with probabilistic sequence signatures based on spaced seeds 71
Mining Over-Represented 3D Patterns of Secondary Structures in Proteins 70
Assembly-free techniques for NGS data 70
Metagenomic reads binning with spaced seeds 68
Assembly-free genome comparison based on next-generation sequencing reads and variable length patterns 68
Binding Balls: Fast detection of Binding Sites using a property of Spherical Fourier Transform 67
PROuST: a server based comparison method of three-dimensional structures of proteins using indexing techniques 66
Fast Computation of Entropic Profiles for the Detection of Conservation in Genomes 66
Efficient computation of spaced seed hashing with block indexing 65
Alignment-Free Measures for Whole-Genome Comparison 64
Invariant geometric properties of secondary structure elements in proteins 63
Comparing ranking and filtering motifs with character classes: application to biological sequence analysis 63
Pattern Recognition in Bioinformatics 63
FSH: Fast spaced seed hashing exploiting adjacent hashes 62
Mining, Compressing and Classifying with Extensible Motifs 62
Improving Metagenomic Classification Using Discriminative k-mers from Sequencing Data 59
Parallel Continuous Flow: A Parallel Suffix Tree Construction Tool for Whole Genomes 58
Efficient parallel construction of suffix trees for genomes larger than main memoryProceedings of the 20th European MPI Users' Group Meeting on - EuroMPI '13 55
Ultrametric networks: a new tool for phylogenetic analysis 55
Iterative Spaced Seed Hashing: Closing the Gap between Spaced Seed Hashing and k-mer Hashing 55
Fast comparison of genomic and meta-genomic reads with alignment-free measures based on quality values 54
Off-line Compression by Extensible Motifs 54
Indexing k-mers in linear space for quality value compression 52
Comparison of microbiome samples: methods and computational challenges 47
Filtering Degenerate Patterns with Application to Protein Sequence Analysis 45
Indexing k-mers in linear-space for quality value compression 45
Remote Homology Detection of Protein Sequences 44
Reducing the Space of Degenerate Patterns in Protein Remote Homology Detection2013 24th International Workshop on Database and Expert Systems Applications 40
Method and apparatus for detection consensus motifs in data sequences 37
High-Performance Protein Structure Comparison 36
Method and structure for lossy compression of continuous data with extensible motifs 36
MetaProb 2: Metagenomic Reads Binning Based on Assembly Using Minimizers and K-Mers Statistics 33
MetaProb 2: Improving Unsupervised Metagenomic Binning with Efficient Reads Assembly Using Minimizers 32
Methods and systems for conservative extraction of over-represented extensible motifs 28
Comparing, ranking, and filtering motifs with character classes: Application to biological sequences analysis 25
Boosting Metagenomic Classification with Reads Overlap Graphs 25
Fast alignment of reads to a variation graph with application to SNP detection 23
SPRISS: Approximating Frequent K-mers by Sampling Reads, and Applications 21
Efficient Hashing of Multiple Spaced Seeds with Application 21
Fast spaced seed hashing 21
Subtle Motifs Discovery for Detection of DNA Regulatory Sites 20
K2Mem: Discovering Discriminative K-mers from Sequencing Data for Metagenomic Reads Classification 20
Efficient k-mer Indexing with Application to Mapping-free SNP Genotyping 15
Covid-19 Pandemic’s Enduring Impact on Urban Mobility: The Case of Free-Floating Bike Sharing in Padova, Italy 14
Special Issue of the 1st International Applied Bioinformatics Conference (iABC'21) 14
ClassGraph: Improving Metagenomic Read Classification with Overlap Graphs 13
USTAR: Improved Compression of k-mer Sets with Counters Using de Bruijn Graphs 13
Enhanced Compression of k-Mer Sets with Counters via de Bruijn Graphs 5
USTAR2: Fast and Succinct Representation of k-mer Sets Using De Bruijn Graphs 3
MISSH: Fast Hashing of Multiple Spaced Seeds 1
Totale 5.116
Categoria #
all - tutte 20.683
article - articoli 10.821
book - libri 212
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 359
selected - selezionate 0
volume - volumi 2.696
Totale 34.771


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020985 0 0 0 83 133 110 117 153 163 94 81 51
2020/2021753 44 61 56 46 32 45 24 80 118 80 116 51
2021/2022966 23 76 159 66 57 43 66 124 53 15 112 172
2022/2023483 123 8 5 36 88 64 2 40 65 6 30 16
2023/2024314 22 31 47 40 8 10 18 13 16 19 34 56
2024/2025255 25 98 70 62 0 0 0 0 0 0 0 0
Totale 5.116