Bicocca Open Archive

Logo unimib boa
BONIZZONI, PAOLA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 13.678
EU - Europa 6.051
AS - Asia 2.294
SA - Sud America 30
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 8
AF - Africa 6
Totale 22.076
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 13.468
IT - Italia 1.428
DE - Germania 923
CN - Cina 908
SE - Svezia 887
IE - Irlanda 693
SG - Singapore 592
UA - Ucraina 564
RU - Federazione Russa 482
GB - Regno Unito 295
VN - Vietnam 280
HK - Hong Kong 279
DK - Danimarca 219
CA - Canada 209
AT - Austria 150
FI - Finlandia 142
IN - India 91
FR - Francia 89
NL - Olanda 49
JP - Giappone 40
TR - Turchia 31
CZ - Repubblica Ceca 28
BR - Brasile 22
ID - Indonesia 22
BE - Belgio 20
IR - Iran 16
CH - Svizzera 14
ES - Italia 10
HU - Ungheria 10
KR - Corea 10
AU - Australia 8
SK - Slovacchia (Repubblica Slovacca) 8
EE - Estonia 7
EU - Europa 7
GR - Grecia 5
PL - Polonia 5
RO - Romania 5
BG - Bulgaria 4
CL - Cile 4
IL - Israele 4
RS - Serbia 4
BD - Bangladesh 3
HR - Croazia 3
MD - Moldavia 3
MU - Mauritius 3
YE - Yemen 3
AR - Argentina 2
PT - Portogallo 2
SC - Seychelles 2
TH - Thailandia 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AL - Albania 1
CO - Colombia 1
DZ - Algeria 1
JM - Giamaica 1
JO - Giordania 1
KH - Cambogia 1
KW - Kuwait 1
KZ - Kazakistan 1
LK - Sri Lanka 1
MN - Mongolia 1
MO - Macao, regione amministrativa speciale della Cina 1
MY - Malesia 1
NZ - Nuova Zelanda 1
OM - Oman 1
PE - Perù 1
PK - Pakistan 1
SI - Slovenia 1
UZ - Uzbekistan 1
Totale 22.076
Salva come PNG Salva come JPEG
Città #
Ann Arbor 2.987
Woodbridge 1.358
Fairfield 1.342
Houston 844
Wilmington 772
Ashburn 770
Chandler 761
Frankfurt am Main 722
Dublin 668
Jacksonville 622
Singapore 503
Seattle 487
Cambridge 423
Milan 406
Dearborn 348
New York 299
Santa Clara 293
Princeton 279
Hong Kong 277
Nanjing 185
Dong Ket 167
Vienna 144
Altamura 139
Lawrence 123
Bergamo 107
Lachine 103
Beijing 99
Shanghai 99
San Diego 82
Nanchang 59
Guangzhou 54
Andover 53
Boardman 50
Rome 50
Los Angeles 43
Shenyang 43
Hebei 41
Toronto 39
Huizen 38
Ottawa 38
Tianjin 38
Helsinki 34
Sacramento 34
Dallas 31
London 31
Hangzhou 29
Jinan 29
Fremont 28
Mountain View 27
Norwalk 27
Jiaxing 25
Ningbo 23
Changsha 22
Chicago 22
Jakarta 22
Lodi 22
Brussels 19
Philadelphia 19
Washington 19
Edmonton 18
Kunming 17
Zhengzhou 17
Bari 15
Palermo 15
Pune 15
Ardea 14
Kocaeli 14
Verona 13
Agrate Brianza 12
Auburn Hills 12
Brno 12
Kiev 12
Prague 12
Hefei 11
Monza 11
Budapest 10
Falls Church 10
Florence 10
Phoenix 10
Turin 10
Como 9
Gainesville 9
San Mateo 9
Gallarate 8
Monmouth Junction 8
University Park 8
Zibido San Giacomo 8
Bologna 7
Carate Brianza 7
Dosson 7
Leawood 7
Napoli 7
Nürnberg 7
Redmond 7
Shenzhen 7
Fuzhou 6
Lanzhou 6
Lappeenranta 6
Laurel 6
Naples 6
Totale 16.833
Salva come PNG Salva come JPEG
Nome #
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era 360
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach 350
The complexity of multiple sequence alignment with SP-score that is a metric 342
MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants 314
ASGAL: Aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events 310
Anonymizing binary and small tables is hard to approximate 308
The haplotyping problem: An overview of computational models and solutions 305
Shark: fishing relevant reads in an RNA-Seq sample 287
Effective clustering for single cell sequencing cancer data 285
An External-Memory Algorithm for String Graph Construction 285
Multithread multistring burrows-wheeler transform and longest common prefix array 282
Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext 264
HapCol: Accurate and memory-efficient haplotype assembly from long reads 258
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels 247
Reconciling a Gene Tree to a Species Tree Under the Duplication Cost Model 246
HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads 242
Computing the multi-string BWT and LCP array in external memory 242
A rearrangement distance for fully-labelled trees 239
Divide and conquer computation of the multi-string BWT and LCP array 238
Inferring Cancer Progression from Single-Cell Sequencing while Allowing Mutation Losses 236
ASGAL: Aligning RNA-Seq Data to a Splicing Graph to Detect Novel Alternative Splicing Events 227
FSG: Fast String Graph Construction for de Novo Assembly 226
Beyond Perfect phylogeny: Multisample Phylogeny reconstruction via ILP 221
GPPS: an ILP-based approach for inferring cancer progression with mutation losses from single cell data 218
γ-TRIS: A graph-algorithm for comprehensive identification of vector genomic insertion sites 213
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly 213
SVDSS: structural variation discovery in hard-to-call genomic regions using sample-specific strings from accurate long reads 194
Picture languages generated by assembling tiles 191
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas 190
Exemplar longest common subsequence 183
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization 181
A colored graph approach to perfect phylogeny with persistent characters 181
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs 180
ASPicDB: A database resource for alternative splicing analysis 179
On the fixed parameter tractability and approximability of the minimum error correction problem 179
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective 178
FSG: Fast string graph construction for de novo assembly of reads data 178
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 176
Reconstructing isoform graphs from RNA-Seq data 174
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text 173
Minimum factorization agreement of spliced ests 171
Species-driven persistent phylogeny 171
The k-anonymity problem is hard 169
Explaining evolution via constrained persistent perfect phylogeny 169
The Haplotyping Problem: An Overview of Computational Models and Solutions 168
Pure parsimony xor haplotyping 168
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing 167
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text 167
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning 167
Further Steps in TANGO: Improved Taxonomic Assignment in Metagenomics 166
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties 165
Separating some splicing models 164
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability 164
Experimenting an approximation algorithm for the LCS 162
Computational methods for alternative splicing prediction 161
Approximating the maximum isomorphic agreement subtree is hard 159
Experimental analysis of a new algorithm for partial haplotype completion 159
Inverse Lyndon words and inverse Lyndon factorizations of words 158
The comparison of phylogenetic networks: algorithms and complexity 157
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information 157
Covering Pairs in Directed Acyclic Graphs 157
Experimenting an Approximation Algorithm for the LCS 156
Existence of constants in regular splicing languages 156
When and How the Perfect Phylogeny Model Explains Evolution 155
Transcriptome assembly and alternative splicing analysis 154
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes 153
Circular splicing and regularity 151
Detecting alternative gene structures from spliced ESTs: A computational approach 151
Pure parsimony xor haplotyping 151
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations 151
Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words 151
Linear splicing and syntactic monoid 150
Parameterized complexity of k-anonymity: hardness and tractability 149
An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis 147
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences 144
Variants of constrained longest common subsequence 144
Parameterized Complexity of k-Anonymity: Hardness and Tractability 144
Fingerprint Clustering with Bounded Number of Missing Values 143
Experimental Analysis of a New Algorithm for Partial Haplotype Completion 143
Nesting of Indecomposable Substructures in k-ary relations 142
Covering Pairs in Directed Acyclic Graphs 142
A linear-time algorithm for the perfect phylogeny haplotype problem 141
Decision problems for linear and circular splicing systems 140
An algorithm for the modular decomposition of hypergraphs 140
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 140
Haplotype Inference on Pedigrees with Recombinations and Mutations 139
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 138
Correlation Clustering and Consensus Clustering 137
Developments in Circular Splicing 136
The binary perfect phylogeny with persistent characters 136
Regular languages generated by reflexive finite Splicing Systems 135
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information 134
Regular splicing languages and subclasses 133
On Automata on infinite trees 132
Modular Decomposition of Hypergraphs 131
Reconciling Gene Trees to a Species Tree 131
On the Approximation of Correlation Clustering and Consensus Clustering 130
Complexity insights of the Minimum Duplication problem 128
Computational graph pangenomics: a tutorial on data structures and their applications 128
On Two Measures of Distance between Fully-Labelled Trees 127
Totale 18.474
Salva come PNG Salva come JPEG
Categoria #
all - tutte 73.101
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 73.101
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20203.068 0 0 0 0 428 467 563 417 501 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/20251.820 323 558 331 207 401 0 0 0 0 0 0 0
Totale 23.027