BONIZZONI, PAOLA
 Distribuzione geografica
Continente #
NA - Nord America 18.037
AS - Asia 10.150
EU - Europa 8.190
SA - Sud America 1.343
AF - Africa 209
OC - Oceania 19
Continente sconosciuto - Info sul continente non disponibili 10
Totale 37.958
Nazione #
US - Stati Uniti d'America 17.630
SG - Singapore 3.600
CN - Cina 2.219
IT - Italia 1.859
VN - Vietnam 1.655
HK - Hong Kong 1.143
DE - Germania 1.140
RU - Federazione Russa 1.080
BR - Brasile 993
SE - Svezia 920
IE - Irlanda 702
UA - Ucraina 606
GB - Regno Unito 439
FR - Francia 390
IN - India 300
CA - Canada 284
KR - Corea 243
DK - Danimarca 222
AT - Austria 193
FI - Finlandia 182
BD - Bangladesh 162
AR - Argentina 143
ID - Indonesia 126
TR - Turchia 104
JP - Giappone 100
NL - Olanda 91
ZA - Sudafrica 88
IQ - Iraq 78
MX - Messico 73
PL - Polonia 69
PK - Pakistan 65
CH - Svizzera 56
EC - Ecuador 51
ES - Italia 51
CO - Colombia 50
PH - Filippine 45
SA - Arabia Saudita 44
UZ - Uzbekistan 43
CZ - Repubblica Ceca 33
CL - Cile 28
BE - Belgio 24
MY - Malesia 23
PY - Paraguay 23
JO - Giordania 22
LT - Lituania 21
VE - Venezuela 21
MA - Marocco 20
KE - Kenya 19
SK - Slovacchia (Repubblica Slovacca) 18
AU - Australia 17
IR - Iran 17
TN - Tunisia 17
NP - Nepal 16
TH - Thailandia 16
AE - Emirati Arabi Uniti 15
EG - Egitto 15
AL - Albania 13
IL - Israele 13
HU - Ungheria 12
JM - Giamaica 12
KZ - Kazakistan 12
RO - Romania 12
DZ - Algeria 11
AZ - Azerbaigian 10
BO - Bolivia 10
OM - Oman 10
RS - Serbia 10
UY - Uruguay 10
CR - Costa Rica 9
TW - Taiwan 9
DO - Repubblica Dominicana 8
ET - Etiopia 8
PE - Perù 8
EE - Estonia 7
EU - Europa 7
GE - Georgia 7
GR - Grecia 7
BG - Bulgaria 6
KG - Kirghizistan 6
MN - Mongolia 6
PT - Portogallo 6
CY - Cipro 5
MD - Moldavia 5
NG - Nigeria 5
PA - Panama 5
PS - Palestinian Territory 5
BH - Bahrain 4
LB - Libano 4
LV - Lettonia 4
NI - Nicaragua 4
SR - Suriname 4
SY - Repubblica araba siriana 4
BA - Bosnia-Erzegovina 3
BW - Botswana 3
BY - Bielorussia 3
CI - Costa d'Avorio 3
HR - Croazia 3
KH - Cambogia 3
LK - Sri Lanka 3
MU - Mauritius 3
Totale 37.906
Città #
Ann Arbor 2.989
Ashburn 1.673
Singapore 1.448
Woodbridge 1.358
Fairfield 1.342
Hong Kong 1.120
Houston 866
San Jose 807
Frankfurt am Main 797
Wilmington 773
Chandler 761
Dublin 675
Jacksonville 624
Milan 570
Seattle 497
Santa Clara 439
Cambridge 423
Ho Chi Minh City 415
New York 404
Dearborn 348
Beijing 341
Hanoi 341
Hefei 315
Princeton 279
Chicago 264
Seoul 226
Los Angeles 224
The Dalles 219
Dallas 194
Nanjing 186
Dong Ket 167
Vienna 161
Lauterbourg 146
Altamura 139
Lawrence 123
Shanghai 120
Council Bluffs 115
Bergamo 114
Lachine 103
São Paulo 96
Buffalo 94
Moscow 86
San Diego 86
Guangzhou 81
Jakarta 77
Rome 76
Da Nang 65
Nanchang 59
London 58
Toronto 56
Tokyo 54
Andover 53
Boardman 52
Shenyang 51
Helsinki 50
Tianjin 47
Haiphong 46
Orem 45
Zurich 45
Johannesburg 44
Hebei 41
Ottawa 39
Warsaw 39
Huizen 38
Munich 38
Chennai 36
Nuremberg 36
Phoenix 36
Atlanta 35
Jinan 34
Sacramento 34
Tashkent 34
Baghdad 33
Denver 32
Hangzhou 32
Stockholm 31
Dhaka 30
Montreal 30
Brooklyn 29
Changsha 29
Fremont 28
Mountain View 27
Norwalk 27
Rio de Janeiro 27
Jiaxing 25
Mexico City 25
Mumbai 25
Philadelphia 24
Poplar 24
Salt Lake City 24
Columbus 23
Ningbo 23
Verona 23
Brussels 22
Elk Grove Village 22
Lodi 22
Biên Hòa 21
Amman 20
Amsterdam 20
Lahore 20
Totale 24.585
Nome #
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era 525
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach 490
Shark: fishing relevant reads in an RNA-Seq sample 466
ASGAL: Aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events 445
MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants 437
Identification of Chimeric RNAs: A Novel Machine Learning Perspective 420
Effective clustering for single cell sequencing cancer data 419
Computing the multi-string BWT and LCP array in external memory 415
The complexity of multiple sequence alignment with SP-score that is a metric 409
Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words 408
SVDSS: structural variation discovery in hard-to-call genomic regions using sample-specific strings from accurate long reads 403
Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext 399
An External-Memory Algorithm for String Graph Construction 398
HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads 397
The haplotyping problem: An overview of computational models and solutions 396
Multithread multistring burrows-wheeler transform and longest common prefix array 395
An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis 394
Anonymizing binary and small tables is hard to approximate 376
Inferring Cancer Progression from Single-Cell Sequencing while Allowing Mutation Losses 376
γ-TRIS: A graph-algorithm for comprehensive identification of vector genomic insertion sites 374
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels 374
FSG: Fast String Graph Construction for de Novo Assembly 370
HapCol: Accurate and memory-efficient haplotype assembly from long reads 369
Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages 354
On the regularity of circular splicing languages: A survey and new developments 347
Divide and conquer computation of the multi-string BWT and LCP array 346
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 344
ASGAL: Aligning RNA-Seq Data to a Splicing Graph to Detect Novel Alternative Splicing Events 339
Beyond Perfect phylogeny: Multisample Phylogeny reconstruction via ILP 332
Reconciling a Gene Tree to a Species Tree Under the Duplication Cost Model 331
GPPS: an ILP-based approach for inferring cancer progression with mutation losses from single cell data 327
A rearrangement distance for fully-labelled trees 326
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning 326
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly 324
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas 308
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 308
A colored graph approach to perfect phylogeny with persistent characters 302
FSG: Fast string graph construction for de novo assembly of reads data 301
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties 298
Picture languages generated by assembling tiles 291
Multiallelic Maximal Perfect Haplotype Blocks with Wildcards via PBWT 287
Exemplar longest common subsequence 285
The k-anonymity problem is hard 284
Computational graph pangenomics: a tutorial on data structures and their applications 283
Species-driven persistent phylogeny 271
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective 270
Accurate and fast clade assignment via deep learning and frequency chaos game representation 265
MALVIRUS: an integrated application for viral variant analysis 265
Explaining evolution via constrained persistent perfect phylogeny 260
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text 259
ASPicDB: A database resource for alternative splicing analysis 257
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs 257
Minimum factorization agreement of spliced ests 251
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization 247
Identification of Chimeric RNAs: a novel machine learning perspective 244
Further Steps in TANGO: Improved Taxonomic Assignment in Metagenomics 244
On the fixed parameter tractability and approximability of the minimum error correction problem 243
Pure parsimony xor haplotyping 242
Separating some splicing models 237
Differential analysis of alternative splicing events in gene regions using residual neural networks 236
Approximating the maximum isomorphic agreement subtree is hard 235
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text 234
Experimenting an approximation algorithm for the LCS 233
The Haplotyping Problem: An Overview of Computational Models and Solutions 232
When and How the Perfect Phylogeny Model Explains Evolution 231
KFinger: Capturing Overlaps Between Long Reads by Using Lyndon Fingerprints 230
Covering Pairs in Directed Acyclic Graphs 230
Finding Maximal Exact Matches Using the r-Index 230
Comparative genome analysis using sample-specific string detection in accurate long reads 230
Circular splicing and regularity 229
Effective Clustering for Single Cell Sequencing Cancer Data 229
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences 228
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability 228
Reconstructing isoform graphs from RNA-Seq data 227
RecGraph: recombination-aware alignment of sequences to variation graphs 226
Experimental analysis of a new algorithm for partial haplotype completion 226
Detecting alternative gene structures from spliced ESTs: A computational approach 225
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information 224
Inverse Lyndon words and inverse Lyndon factorizations of words 222
μ-PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data 221
Fingerprint Clustering with Bounded Number of Missing Values 221
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations 221
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes 221
Variants of constrained longest common subsequence 220
On Two Measures of Distance between Fully-Labelled Trees 220
Computational methods for alternative splicing prediction 218
Parameterized Complexity of k-Anonymity: Hardness and Tractability 218
Transcriptome assembly and alternative splicing analysis 218
Existence of constants in regular splicing languages 217
Decision problems for linear and circular splicing systems 216
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing 216
Experimenting an Approximation Algorithm for the LCS 215
Linear splicing and syntactic monoid 213
The comparison of phylogenetic networks: algorithms and complexity 213
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches 212
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information 211
Haplotype Inference on Pedigrees with Recombinations and Mutations 210
Parameterized complexity of k-anonymity: hardness and tractability 210
Correlation Clustering and Consensus Clustering 209
Covering Pairs in Directed Acyclic Graphs 208
Totale 29.023
Categoria #
all - tutte 116.138
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 116.138


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021706 0 0 0 0 0 0 0 0 0 0 229 477
2021/20222.396 182 208 331 224 241 182 102 106 117 141 207 355
2022/20233.468 386 1.007 363 260 254 473 82 188 222 101 90 42
2023/20242.392 83 73 73 215 287 551 461 116 218 47 34 234
2024/20256.200 323 558 331 207 419 271 335 315 573 799 844 1.225
2025/202611.553 1.327 1.002 934 1.538 1.371 597 1.732 699 1.142 1.195 16 0
Totale 38.960