BONIZZONI, PAOLA
 Distribuzione geografica
Continente #
NA - Nord America 14.096
EU - Europa 6.745
AS - Asia 2.980
SA - Sud America 223
AF - Africa 19
OC - Oceania 11
Continente sconosciuto - Info sul continente non disponibili 9
Totale 24.083
Nazione #
US - Stati Uniti d'America 13.875
IT - Italia 1.615
CN - Cina 981
DE - Germania 981
SG - Singapore 915
SE - Svezia 890
RU - Federazione Russa 829
IE - Irlanda 693
UA - Ucraina 572
HK - Hong Kong 470
GB - Regno Unito 300
VN - Vietnam 280
DK - Danimarca 219
CA - Canada 212
BR - Brasile 197
AT - Austria 168
FI - Finlandia 148
FR - Francia 113
IN - India 95
ID - Indonesia 70
NL - Olanda 69
JP - Giappone 41
TR - Turchia 35
CZ - Repubblica Ceca 28
BE - Belgio 22
CH - Svizzera 17
IR - Iran 17
AR - Argentina 10
ES - Italia 10
HU - Ungheria 10
KR - Corea 10
AU - Australia 9
IL - Israele 9
SK - Slovacchia (Repubblica Slovacca) 8
BD - Bangladesh 7
EE - Estonia 7
EU - Europa 7
PL - Polonia 7
UZ - Uzbekistan 7
GR - Grecia 6
JO - Giordania 6
PK - Pakistan 6
BG - Bulgaria 5
RO - Romania 5
CL - Cile 4
IQ - Iraq 4
RS - Serbia 4
AL - Albania 3
AZ - Azerbaigian 3
EC - Ecuador 3
HR - Croazia 3
KE - Kenya 3
LT - Lituania 3
MA - Marocco 3
MD - Moldavia 3
MU - Mauritius 3
PE - Perù 3
TH - Thailandia 3
YE - Yemen 3
ZA - Sudafrica 3
BO - Bolivia 2
CR - Costa Rica 2
DO - Repubblica Dominicana 2
DZ - Algeria 2
JM - Giamaica 2
KH - Cambogia 2
LV - Lettonia 2
NG - Nigeria 2
NZ - Nuova Zelanda 2
PT - Portogallo 2
SC - Seychelles 2
TW - Taiwan 2
UY - Uruguay 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AE - Emirati Arabi Uniti 1
AM - Armenia 1
BA - Bosnia-Erzegovina 1
BH - Bahrain 1
CO - Colombia 1
CY - Cipro 1
EG - Egitto 1
GE - Georgia 1
KG - Kirghizistan 1
KW - Kuwait 1
KZ - Kazakistan 1
LK - Sri Lanka 1
MN - Mongolia 1
MO - Macao, regione amministrativa speciale della Cina 1
MV - Maldive 1
MX - Messico 1
MY - Malesia 1
NO - Norvegia 1
OM - Oman 1
PA - Panama 1
PR - Porto Rico 1
PY - Paraguay 1
SI - Slovenia 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 24.083
Città #
Ann Arbor 2.987
Woodbridge 1.358
Fairfield 1.342
Houston 844
Ashburn 840
Wilmington 772
Chandler 761
Frankfurt am Main 734
Dublin 668
Jacksonville 622
Singapore 616
Milan 503
Seattle 489
Hong Kong 466
Cambridge 423
Santa Clara 405
Dearborn 348
New York 302
Princeton 279
Nanjing 185
Dong Ket 167
Vienna 153
Altamura 139
Lawrence 123
Bergamo 114
Lachine 103
Shanghai 101
Beijing 100
San Diego 82
Council Bluffs 74
Jakarta 69
Guangzhou 66
Nanchang 59
Rome 59
Los Angeles 54
Andover 53
Boardman 50
Shenyang 44
Hebei 41
Helsinki 40
Toronto 40
Ottawa 39
Huizen 38
Tianjin 38
Moscow 36
Sacramento 34
London 32
Dallas 31
The Dalles 31
Hangzhou 29
Jinan 29
Fremont 28
Mountain View 27
Norwalk 27
Chicago 26
Jiaxing 25
Changsha 24
Ningbo 23
Lodi 22
Brussels 21
Philadelphia 19
Washington 19
Edmonton 18
Düsseldorf 17
Kunming 17
Zhengzhou 17
Nuremberg 16
Bari 15
Monza 15
Palermo 15
Pune 15
São Paulo 15
Verona 15
Ardea 14
Florence 14
Kocaeli 14
Lecco 13
Agrate Brianza 12
Auburn Hills 12
Brno 12
Kiev 12
Naples 12
Prague 12
Hefei 11
Turin 11
Budapest 10
Como 10
Falls Church 10
Phoenix 10
Seregno 10
Gainesville 9
San Mateo 9
Campinas 8
Gallarate 8
Monmouth Junction 8
University Park 8
Zibido San Giacomo 8
Bologna 7
Carate Brianza 7
Dosson 7
Totale 17.726
Nome #
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era 386
The complexity of multiple sequence alignment with SP-score that is a metric 364
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach 364
MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants 331
ASGAL: Aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events 324
The haplotyping problem: An overview of computational models and solutions 316
Anonymizing binary and small tables is hard to approximate 315
Effective clustering for single cell sequencing cancer data 315
Shark: fishing relevant reads in an RNA-Seq sample 313
Multithread multistring burrows-wheeler transform and longest common prefix array 303
HapCol: Accurate and memory-efficient haplotype assembly from long reads 298
An External-Memory Algorithm for String Graph Construction 297
Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext 281
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels 274
Computing the multi-string BWT and LCP array in external memory 268
HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads 266
FSG: Fast String Graph Construction for de Novo Assembly 258
Inferring Cancer Progression from Single-Cell Sequencing while Allowing Mutation Losses 256
A rearrangement distance for fully-labelled trees 254
Divide and conquer computation of the multi-string BWT and LCP array 254
Reconciling a Gene Tree to a Species Tree Under the Duplication Cost Model 252
SVDSS: structural variation discovery in hard-to-call genomic regions using sample-specific strings from accurate long reads 242
ASGAL: Aligning RNA-Seq Data to a Splicing Graph to Detect Novel Alternative Splicing Events 241
Beyond Perfect phylogeny: Multisample Phylogeny reconstruction via ILP 237
GPPS: an ILP-based approach for inferring cancer progression with mutation losses from single cell data 237
γ-TRIS: A graph-algorithm for comprehensive identification of vector genomic insertion sites 231
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly 224
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas 213
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning 203
Picture languages generated by assembling tiles 199
A colored graph approach to perfect phylogeny with persistent characters 197
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 195
Exemplar longest common subsequence 191
FSG: Fast string graph construction for de novo assembly of reads data 189
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective 188
On the fixed parameter tractability and approximability of the minimum error correction problem 188
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text 187
Explaining evolution via constrained persistent perfect phylogeny 187
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization 185
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs 185
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 185
ASPicDB: A database resource for alternative splicing analysis 184
The k-anonymity problem is hard 183
Reconstructing isoform graphs from RNA-Seq data 183
Species-driven persistent phylogeny 182
Pure parsimony xor haplotyping 181
Further Steps in TANGO: Improved Taxonomic Assignment in Metagenomics 181
Minimum factorization agreement of spliced ests 175
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties 175
The Haplotyping Problem: An Overview of Computational Models and Solutions 174
Separating some splicing models 173
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing 172
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text 172
Experimental analysis of a new algorithm for partial haplotype completion 170
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability 170
Experimenting an approximation algorithm for the LCS 169
Inverse Lyndon words and inverse Lyndon factorizations of words 168
Approximating the maximum isomorphic agreement subtree is hard 167
Computational methods for alternative splicing prediction 166
Existence of constants in regular splicing languages 166
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information 165
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes 165
When and How the Perfect Phylogeny Model Explains Evolution 164
Covering Pairs in Directed Acyclic Graphs 163
Transcriptome assembly and alternative splicing analysis 163
Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words 163
The comparison of phylogenetic networks: algorithms and complexity 162
Experimenting an Approximation Algorithm for the LCS 162
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations 161
Circular splicing and regularity 157
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences 157
Linear splicing and syntactic monoid 157
Computational graph pangenomics: a tutorial on data structures and their applications 157
Detecting alternative gene structures from spliced ESTs: A computational approach 155
Variants of constrained longest common subsequence 155
Pure parsimony xor haplotyping 155
Parameterized Complexity of k-Anonymity: Hardness and Tractability 154
Parameterized complexity of k-anonymity: hardness and tractability 154
Covering Pairs in Directed Acyclic Graphs 151
An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis 150
Nesting of Indecomposable Substructures in k-ary relations 150
Fingerprint Clustering with Bounded Number of Missing Values 149
Experimental Analysis of a New Algorithm for Partial Haplotype Completion 148
Decision problems for linear and circular splicing systems 147
An algorithm for the modular decomposition of hypergraphs 147
Correlation Clustering and Consensus Clustering 147
A linear-time algorithm for the perfect phylogeny haplotype problem 146
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information 146
Haplotype Inference on Pedigrees with Recombinations and Mutations 144
The binary perfect phylogeny with persistent characters 143
On Two Measures of Distance between Fully-Labelled Trees 142
Developments in Circular Splicing 141
Regular languages generated by reflexive finite Splicing Systems 141
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 141
Reconciling Gene Trees to a Species Tree 141
On Automata on infinite trees 140
Regular splicing languages and subclasses 139
A characterization of (regular) circular languages generated by monotone complete splicing systems 138
Modular Decomposition of Hypergraphs 137
MALVIRUS: an integrated application for viral variant analysis 137
Totale 19.738
Categoria #
all - tutte 83.713
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 83.713


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020692 0 0 0 0 0 0 0 0 0 295 258 139
2020/20213.535 198 141 316 355 242 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/20253.857 323 558 331 207 419 271 335 315 573 525 0 0
Totale 25.064