Bicocca Open Archive

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.002 0 0 0 0 0 0 0 0 0 0 468 534
2019/20204.424 505 220 268 363 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.131 83 73 73 215 287 551 461 116 218 47 7 0
Totale 20.946