BONIZZONI, PAOLA
 Distribuzione geografica
Continente #
NA - Nord America 16.336
AS - Asia 8.026
EU - Europa 7.568
SA - Sud America 1.066
AF - Africa 105
OC - Oceania 12
Continente sconosciuto - Info sul continente non disponibili 9
Totale 33.122
Nazione #
US - Stati Uniti d'America 15.976
SG - Singapore 3.084
CN - Cina 1.994
IT - Italia 1.772
HK - Hong Kong 1.100
DE - Germania 1.081
RU - Federazione Russa 1.055
VN - Vietnam 1.025
SE - Svezia 917
BR - Brasile 859
IE - Irlanda 696
UA - Ucraina 591
GB - Regno Unito 394
CA - Canada 274
DK - Danimarca 220
AT - Austria 189
FI - Finlandia 170
KR - Corea 168
IN - India 167
FR - Francia 159
ID - Indonesia 101
AR - Argentina 90
JP - Giappone 88
NL - Olanda 77
BD - Bangladesh 59
ZA - Sudafrica 59
TR - Turchia 56
MX - Messico 54
PL - Polonia 48
CZ - Repubblica Ceca 32
EC - Ecuador 32
IQ - Iraq 28
ES - Italia 27
CO - Colombia 25
BE - Belgio 23
CH - Svizzera 19
PY - Paraguay 19
LT - Lituania 18
IR - Iran 17
JO - Giordania 15
CL - Cile 14
PK - Pakistan 14
SK - Slovacchia (Repubblica Slovacca) 14
SA - Arabia Saudita 13
UZ - Uzbekistan 13
AE - Emirati Arabi Uniti 12
IL - Israele 11
AU - Australia 10
HU - Ungheria 10
KE - Kenya 9
MA - Marocco 8
AL - Albania 7
EE - Estonia 7
EU - Europa 7
OM - Oman 7
RO - Romania 7
RS - Serbia 7
UY - Uruguay 7
VE - Venezuela 7
AZ - Azerbaigian 6
DO - Repubblica Dominicana 6
EG - Egitto 6
GR - Grecia 6
JM - Giamaica 6
KZ - Kazakistan 6
PE - Perù 6
TH - Thailandia 6
BG - Bulgaria 5
BO - Bolivia 5
NP - Nepal 5
TN - Tunisia 5
DZ - Algeria 4
MY - Malesia 4
NG - Nigeria 4
PA - Panama 4
BH - Bahrain 3
BW - Botswana 3
BY - Bielorussia 3
CR - Costa Rica 3
GE - Georgia 3
HR - Croazia 3
KH - Cambogia 3
MD - Moldavia 3
MU - Mauritius 3
YE - Yemen 3
BA - Bosnia-Erzegovina 2
BB - Barbados 2
HN - Honduras 2
KG - Kirghizistan 2
LV - Lettonia 2
MN - Mongolia 2
NI - Nicaragua 2
NZ - Nuova Zelanda 2
PR - Porto Rico 2
PT - Portogallo 2
SC - Seychelles 2
TT - Trinidad e Tobago 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AM - Armenia 1
Totale 33.104
Città #
Ann Arbor 2.987
Ashburn 1.407
Woodbridge 1.358
Fairfield 1.342
Singapore 1.223
Hong Kong 1.096
Houston 862
Wilmington 773
Chandler 761
Frankfurt am Main 758
Dublin 669
Jacksonville 623
Milan 546
Seattle 496
Santa Clara 431
Cambridge 423
New York 385
Dearborn 348
Beijing 330
Hefei 315
Princeton 279
Ho Chi Minh City 236
Los Angeles 203
Hanoi 187
Dallas 186
Nanjing 186
Dong Ket 167
Vienna 159
Seoul 155
Altamura 139
The Dalles 132
Lawrence 123
Bergamo 114
Shanghai 111
Chicago 109
Lachine 103
Buffalo 88
São Paulo 88
Moscow 84
San Diego 83
Guangzhou 76
Jakarta 76
Council Bluffs 74
Rome 70
Nanchang 59
Toronto 55
Andover 53
Boardman 51
London 51
Shenyang 50
Tokyo 45
Tianjin 43
Helsinki 42
Hebei 41
Ottawa 39
Huizen 38
Munich 38
Nuremberg 35
Jinan 34
Sacramento 34
Warsaw 33
Denver 32
Hangzhou 32
Johannesburg 30
Phoenix 30
Stockholm 30
Brooklyn 29
Changsha 28
Fremont 28
Atlanta 27
Montreal 27
Mountain View 27
Norwalk 27
Chennai 25
Haiphong 25
Jiaxing 25
Poplar 24
Columbus 23
Mexico City 23
Ningbo 23
Salt Lake City 23
Brussels 22
Elk Grove Village 22
Lodi 22
Verona 22
Philadelphia 21
Rio de Janeiro 21
Washington 20
Zhengzhou 20
Boston 19
Da Nang 19
Desio 19
Manchester 19
Belo Horizonte 18
Bắc Ninh 18
Düsseldorf 18
Edmonton 18
Kent 18
Monza 18
Orem 18
Totale 22.012
Nome #
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era 487
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach 461
ASGAL: Aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events 403
Shark: fishing relevant reads in an RNA-Seq sample 401
Identification of Chimeric RNAs: A Novel Machine Learning Perspective 387
The complexity of multiple sequence alignment with SP-score that is a metric 387
MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants 387
Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words 386
Effective clustering for single cell sequencing cancer data 377
Multithread multistring burrows-wheeler transform and longest common prefix array 368
HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads 366
An External-Memory Algorithm for String Graph Construction 366
The haplotyping problem: An overview of computational models and solutions 365
An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis 365
Computing the multi-string BWT and LCP array in external memory 361
Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext 352
SVDSS: structural variation discovery in hard-to-call genomic regions using sample-specific strings from accurate long reads 350
Anonymizing binary and small tables is hard to approximate 345
γ-TRIS: A graph-algorithm for comprehensive identification of vector genomic insertion sites 337
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels 337
HapCol: Accurate and memory-efficient haplotype assembly from long reads 336
On the regularity of circular splicing languages: A survey and new developments 334
FSG: Fast String Graph Construction for de Novo Assembly 333
Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages 328
Inferring Cancer Progression from Single-Cell Sequencing while Allowing Mutation Losses 322
Divide and conquer computation of the multi-string BWT and LCP array 317
ASGAL: Aligning RNA-Seq Data to a Splicing Graph to Detect Novel Alternative Splicing Events 310
A rearrangement distance for fully-labelled trees 299
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning 294
GPPS: an ILP-based approach for inferring cancer progression with mutation losses from single cell data 293
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly 290
Reconciling a Gene Tree to a Species Tree Under the Duplication Cost Model 288
Beyond Perfect phylogeny: Multisample Phylogeny reconstruction via ILP 281
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 281
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas 279
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties 279
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 269
FSG: Fast string graph construction for de novo assembly of reads data 268
A colored graph approach to perfect phylogeny with persistent characters 259
Picture languages generated by assembling tiles 254
Exemplar longest common subsequence 248
Multiallelic Maximal Perfect Haplotype Blocks with Wildcards via PBWT 241
The k-anonymity problem is hard 240
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective 236
Species-driven persistent phylogeny 234
Explaining evolution via constrained persistent perfect phylogeny 232
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs 229
ASPicDB: A database resource for alternative splicing analysis 228
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization 226
Accurate and fast clade assignment via deep learning and frequency chaos game representation 225
Computational graph pangenomics: a tutorial on data structures and their applications 225
Minimum factorization agreement of spliced ests 224
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text 224
On the fixed parameter tractability and approximability of the minimum error correction problem 220
Separating some splicing models 218
Further Steps in TANGO: Improved Taxonomic Assignment in Metagenomics 218
MALVIRUS: an integrated application for viral variant analysis 217
Pure parsimony xor haplotyping 215
The Haplotyping Problem: An Overview of Computational Models and Solutions 210
When and How the Perfect Phylogeny Model Explains Evolution 210
Identification of Chimeric RNAs: a novel machine learning perspective 209
Experimenting an approximation algorithm for the LCS 209
Experimental analysis of a new algorithm for partial haplotype completion 205
Approximating the maximum isomorphic agreement subtree is hard 204
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability 203
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text 203
Reconstructing isoform graphs from RNA-Seq data 203
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences 202
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing 202
Computational methods for alternative splicing prediction 201
Inverse Lyndon words and inverse Lyndon factorizations of words 201
Comparative genome analysis using sample-specific string detection in accurate long reads 199
Circular splicing and regularity 198
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes 198
Covering Pairs in Directed Acyclic Graphs 197
Transcriptome assembly and alternative splicing analysis 197
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations 196
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information 196
Experimenting an Approximation Algorithm for the LCS 196
Detecting alternative gene structures from spliced ESTs: A computational approach 195
Existence of constants in regular splicing languages 195
Variants of constrained longest common subsequence 194
The comparison of phylogenetic networks: algorithms and complexity 193
Finding Maximal Exact Matches Using the r-Index 193
KFinger: Capturing Overlaps Between Long Reads by Using Lyndon Fingerprints 191
Linear splicing and syntactic monoid 190
On Two Measures of Distance between Fully-Labelled Trees 190
Fingerprint Clustering with Bounded Number of Missing Values 188
μ-PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data 187
Pure parsimony xor haplotyping 187
Parameterized Complexity of k-Anonymity: Hardness and Tractability 186
Experimental Analysis of a New Algorithm for Partial Haplotype Completion 185
Effective Clustering for Single Cell Sequencing Cancer Data 184
Correlation Clustering and Consensus Clustering 184
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information 183
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches 182
Decision problems for linear and circular splicing systems 181
Haplotype Inference on Pedigrees with Recombinations and Mutations 181
Parameterized complexity of k-anonymity: hardness and tractability 181
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 180
Totale 25.771
Categoria #
all - tutte 107.516
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 107.516


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20212.283 0 0 0 0 0 316 289 280 282 410 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/20266.714 1.327 1.002 934 1.538 1.371 542 0 0 0 0 0 0
Totale 34.121