BONIZZONI, PAOLA
 Distribuzione geografica
Continente #
NA - Nord America 19.004
AS - Asia 10.172
EU - Europa 8.271
SA - Sud America 1.343
AF - Africa 209
OC - Oceania 20
Continente sconosciuto - Info sul continente non disponibili 10
Totale 39.029
Nazione #
US - Stati Uniti d'America 17.872
SG - Singapore 3.603
CN - Cina 2.226
IT - Italia 1.933
VN - Vietnam 1.655
HK - Hong Kong 1.143
DE - Germania 1.140
RU - Federazione Russa 1.080
CA - Canada 1.009
BR - Brasile 993
SE - Svezia 920
IE - Irlanda 702
UA - Ucraina 606
GB - Regno Unito 441
FR - Francia 394
IN - India 300
KR - Corea 243
DK - Danimarca 222
AT - Austria 193
FI - Finlandia 182
BD - Bangladesh 174
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
AU - Australia 18
SK - Slovacchia (Repubblica Slovacca) 18
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
GR - Grecia 8
PE - Perù 8
EE - Estonia 7
EU - Europa 7
GE - Georgia 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 38.977
Città #
Ann Arbor 2.989
Ashburn 1.681
Singapore 1.448
Woodbridge 1.358
Fairfield 1.342
Hong Kong 1.120
Houston 867
San Jose 825
Frankfurt am Main 797
Toronto 774
Wilmington 773
Chandler 761
Dublin 675
Jacksonville 624
Milan 581
Seattle 497
Santa Clara 441
New York 425
Cambridge 423
Ho Chi Minh City 415
Dearborn 348
Beijing 341
Hanoi 341
Hefei 315
Princeton 279
Chicago 268
Los Angeles 231
Seoul 226
The Dalles 219
Dallas 205
Nanjing 186
Dong Ket 167
Vienna 161
Lauterbourg 146
Council Bluffs 142
Altamura 139
Lawrence 123
Shanghai 120
Bergamo 114
Lachine 103
Buffalo 97
São Paulo 96
Moscow 86
Rome 86
San Diego 86
Guangzhou 81
Jakarta 77
Da Nang 65
Nanchang 59
London 58
Tokyo 54
Andover 53
Boardman 52
Shenyang 51
Helsinki 50
Orem 48
Tianjin 47
Haiphong 46
Zurich 45
Johannesburg 44
Hebei 41
Ottawa 39
Warsaw 39
Huizen 38
Munich 38
Atlanta 36
Chennai 36
Nuremberg 36
Phoenix 36
Jinan 34
Sacramento 34
Tashkent 34
Baghdad 33
Denver 33
Hangzhou 33
Brooklyn 32
Montreal 31
Stockholm 31
Turin 31
Dhaka 30
Changsha 29
Fremont 28
Mountain View 27
Norwalk 27
Rio de Janeiro 27
Columbus 25
Jiaxing 25
Mexico City 25
Mumbai 25
Philadelphia 25
Salt Lake City 25
Poplar 24
Ningbo 23
Verona 23
Brussels 22
Elk Grove Village 22
Lodi 22
Biên Hòa 21
Amman 20
Amsterdam 20
Totale 25.451
Nome #
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era 528
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach 500
Shark: fishing relevant reads in an RNA-Seq sample 468
ASGAL: Aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events 453
MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants 447
Computing the multi-string BWT and LCP array in external memory 433
Effective clustering for single cell sequencing cancer data 430
Identification of Chimeric RNAs: A Novel Machine Learning Perspective 428
SVDSS: structural variation discovery in hard-to-call genomic regions using sample-specific strings from accurate long reads 419
The complexity of multiple sequence alignment with SP-score that is a metric 418
Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words 414
Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext 407
An External-Memory Algorithm for String Graph Construction 405
The haplotyping problem: An overview of computational models and solutions 402
An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis 401
Multithread multistring burrows-wheeler transform and longest common prefix array 401
HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads 399
Inferring Cancer Progression from Single-Cell Sequencing while Allowing Mutation Losses 384
Anonymizing binary and small tables is hard to approximate 383
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels 379
γ-TRIS: A graph-algorithm for comprehensive identification of vector genomic insertion sites 374
FSG: Fast String Graph Construction for de Novo Assembly 372
HapCol: Accurate and memory-efficient haplotype assembly from long reads 371
Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages 362
On the regularity of circular splicing languages: A survey and new developments 361
Divide and conquer computation of the multi-string BWT and LCP array 352
ASGAL: Aligning RNA-Seq Data to a Splicing Graph to Detect Novel Alternative Splicing Events 346
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 345
Beyond Perfect phylogeny: Multisample Phylogeny reconstruction via ILP 340
Reconciling a Gene Tree to a Species Tree Under the Duplication Cost Model 338
A rearrangement distance for fully-labelled trees 335
GPPS: an ILP-based approach for inferring cancer progression with mutation losses from single cell data 333
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly 331
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning 329
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas 317
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 315
FSG: Fast string graph construction for de novo assembly of reads data 311
A colored graph approach to perfect phylogeny with persistent characters 309
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties 304
Picture languages generated by assembling tiles 299
The k-anonymity problem is hard 294
Exemplar longest common subsequence 293
Multiallelic Maximal Perfect Haplotype Blocks with Wildcards via PBWT 289
Computational graph pangenomics: a tutorial on data structures and their applications 287
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective 278
Species-driven persistent phylogeny 277
Accurate and fast clade assignment via deep learning and frequency chaos game representation 270
MALVIRUS: an integrated application for viral variant analysis 267
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text 266
ASPicDB: A database resource for alternative splicing analysis 265
Explaining evolution via constrained persistent perfect phylogeny 265
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs 261
Minimum factorization agreement of spliced ests 259
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization 254
On the fixed parameter tractability and approximability of the minimum error correction problem 251
Pure parsimony xor haplotyping 250
Further Steps in TANGO: Improved Taxonomic Assignment in Metagenomics 250
Identification of Chimeric RNAs: a novel machine learning perspective 248
Differential analysis of alternative splicing events in gene regions using residual neural networks 247
Separating some splicing models 244
Approximating the maximum isomorphic agreement subtree is hard 241
Experimenting an approximation algorithm for the LCS 240
Finding Maximal Exact Matches Using the r-Index 240
When and How the Perfect Phylogeny Model Explains Evolution 239
The Haplotyping Problem: An Overview of Computational Models and Solutions 238
Covering Pairs in Directed Acyclic Graphs 238
Effective Clustering for Single Cell Sequencing Cancer Data 238
KFinger: Capturing Overlaps Between Long Reads by Using Lyndon Fingerprints 237
Circular splicing and regularity 237
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text 236
RecGraph: recombination-aware alignment of sequences to variation graphs 235
Detecting alternative gene structures from spliced ESTs: A computational approach 235
Existence of constants in regular splicing languages 235
Reconstructing isoform graphs from RNA-Seq data 234
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes 234
Comparative genome analysis using sample-specific string detection in accurate long reads 234
Experimental analysis of a new algorithm for partial haplotype completion 233
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences 232
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information 231
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability 229
Inverse Lyndon words and inverse Lyndon factorizations of words 229
μ-PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data 228
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations 228
On Two Measures of Distance between Fully-Labelled Trees 228
Fingerprint Clustering with Bounded Number of Missing Values 227
Parameterized Complexity of k-Anonymity: Hardness and Tractability 225
Computational methods for alternative splicing prediction 224
Transcriptome assembly and alternative splicing analysis 224
Variants of constrained longest common subsequence 223
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing 223
Decision problems for linear and circular splicing systems 222
Experimenting an Approximation Algorithm for the LCS 222
The comparison of phylogenetic networks: algorithms and complexity 220
Linear splicing and syntactic monoid 219
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information 219
Haplotype Inference on Pedigrees with Recombinations and Mutations 217
Solving the Minimal Positional Substring Cover Problem in Sublinear Space 217
Parameterized complexity of k-anonymity: hardness and tractability 216
Correlation Clustering and Consensus Clustering 215
Covering Pairs in Directed Acyclic Graphs 214
Totale 29.714
Categoria #
all - tutte 119.314
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 119.314


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/202612.624 1.327 1.002 934 1.538 1.371 597 1.732 699 1.142 1.195 1.087 0
Totale 40.031