Bicocca Open Archive

Logo unimib boa
BONIZZONI, PAOLA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 13.346
EU - Europa 5.864
AS - Asia 2.202
SA - Sud America 24
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 7
AF - Africa 6
Totale 21.457
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 13.139
IT - Italia 1.373
DE - Germania 920
SE - Svezia 887
CN - Cina 880
IE - Irlanda 693
UA - Ucraina 564
SG - Singapore 533
RU - Federazione Russa 363
GB - Regno Unito 294
VN - Vietnam 280
HK - Hong Kong 279
DK - Danimarca 219
CA - Canada 207
AT - Austria 147
FI - Finlandia 140
IN - India 89
FR - Francia 88
NL - Olanda 49
JP - Giappone 40
TR - Turchia 31
CZ - Repubblica Ceca 26
ID - Indonesia 22
BE - Belgio 20
BR - Brasile 16
IR - Iran 16
CH - Svizzera 14
ES - Italia 10
HU - Ungheria 10
KR - Corea 10
SK - Slovacchia (Repubblica Slovacca) 8
AU - Australia 7
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
HR - Croazia 3
MD - Moldavia 3
MU - Mauritius 3
YE - Yemen 3
AR - Argentina 2
BD - Bangladesh 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
JO - Giordania 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
UZ - Uzbekistan 1
Totale 21.457
Salva come PNG Salva come JPEG
Città #
Ann Arbor 2.987
Woodbridge 1.358
Fairfield 1.342
Houston 844
Wilmington 772
Ashburn 768
Chandler 761
Frankfurt am Main 722
Dublin 668
Jacksonville 622
Seattle 487
Singapore 459
Cambridge 423
Milan 392
Dearborn 348
New York 299
Princeton 279
Hong Kong 277
Nanjing 185
Dong Ket 167
Vienna 142
Altamura 139
Lawrence 123
Bergamo 107
Lachine 103
Santa Clara 102
Shanghai 99
Beijing 98
San Diego 82
Nanchang 59
Andover 53
Boardman 50
Guangzhou 49
Rome 45
Los Angeles 42
Shenyang 42
Hebei 41
Toronto 39
Huizen 38
Ottawa 38
Tianjin 38
Sacramento 34
Helsinki 33
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
Pune 15
Ardea 14
Kocaeli 14
Palermo 13
Verona 13
Auburn Hills 12
Brno 12
Kiev 12
Hefei 11
Budapest 10
Falls Church 10
Florence 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
Shenzhen 7
Lanzhou 6
Laurel 6
Trento 6
Cantù 5
Castello di Brianza 5
Totale 16.552
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 355
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach 347
The complexity of multiple sequence alignment with SP-score that is a metric 334
MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants 310
ASGAL: Aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events 306
Anonymizing binary and small tables is hard to approximate 304
The haplotyping problem: An overview of computational models and solutions 300
Effective clustering for single cell sequencing cancer data 282
Shark: fishing relevant reads in an RNA-Seq sample 281
An External-Memory Algorithm for String Graph Construction 280
Multithread multistring burrows-wheeler transform and longest common prefix array 278
Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext 259
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels 241
Reconciling a Gene Tree to a Species Tree Under the Duplication Cost Model 240
HapCol: Accurate and memory-efficient haplotype assembly from long reads 240
HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads 237
A rearrangement distance for fully-labelled trees 235
Computing the multi-string BWT and LCP array in external memory 235
Divide and conquer computation of the multi-string BWT and LCP array 234
Inferring Cancer Progression from Single-Cell Sequencing while Allowing Mutation Losses 230
ASGAL: Aligning RNA-Seq Data to a Splicing Graph to Detect Novel Alternative Splicing Events 223
Beyond Perfect phylogeny: Multisample Phylogeny reconstruction via ILP 218
FSG: Fast String Graph Construction for de Novo Assembly 218
GPPS: an ILP-based approach for inferring cancer progression with mutation losses from single cell data 215
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly 209
γ-TRIS: A graph-algorithm for comprehensive identification of vector genomic insertion sites 208
Picture languages generated by assembling tiles 187
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas 185
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization 178
A colored graph approach to perfect phylogeny with persistent characters 178
Exemplar longest common subsequence 177
ASPicDB: A database resource for alternative splicing analysis 177
On the fixed parameter tractability and approximability of the minimum error correction problem 176
SVDSS: structural variation discovery in hard-to-call genomic regions using sample-specific strings from accurate long reads 176
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective 175
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs 174
FSG: Fast string graph construction for de novo assembly of reads data 174
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes 172
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text 170
Reconstructing isoform graphs from RNA-Seq data 170
Species-driven persistent phylogeny 168
The k-anonymity problem is hard 166
Minimum factorization agreement of spliced ests 166
The Haplotyping Problem: An Overview of Computational Models and Solutions 165
Pure parsimony xor haplotyping 165
Explaining evolution via constrained persistent perfect phylogeny 165
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing 164
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text 163
Separating some splicing models 162
Further Steps in TANGO: Improved Taxonomic Assignment in Metagenomics 162
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties 161
Experimenting an approximation algorithm for the LCS 159
Computational methods for alternative splicing prediction 158
Approximating the maximum isomorphic agreement subtree is hard 157
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability 157
Experimental analysis of a new algorithm for partial haplotype completion 156
Inverse Lyndon words and inverse Lyndon factorizations of words 156
The comparison of phylogenetic networks: algorithms and complexity 154
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning 154
Existence of constants in regular splicing languages 153
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information 152
Experimenting an Approximation Algorithm for the LCS 152
When and How the Perfect Phylogeny Model Explains Evolution 152
Covering Pairs in Directed Acyclic Graphs 152
Transcriptome assembly and alternative splicing analysis 150
Detecting alternative gene structures from spliced ESTs: A computational approach 149
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes 149
Pure parsimony xor haplotyping 148
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations 148
Lyndon words versus inverse lyndon words: Queries on suffixes and bordered words 148
Circular splicing and regularity 147
Linear splicing and syntactic monoid 147
Parameterized complexity of k-anonymity: hardness and tractability 146
An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis 145
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences 141
Fingerprint Clustering with Bounded Number of Missing Values 140
Nesting of Indecomposable Substructures in k-ary relations 140
Parameterized Complexity of k-Anonymity: Hardness and Tractability 140
Experimental Analysis of a New Algorithm for Partial Haplotype Completion 140
Variants of constrained longest common subsequence 139
Covering Pairs in Directed Acyclic Graphs 139
A linear-time algorithm for the perfect phylogeny haplotype problem 138
Decision problems for linear and circular splicing systems 137
An algorithm for the modular decomposition of hypergraphs 137
Haplotype Inference on Pedigrees with Recombinations and Mutations 136
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters 135
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? 135
Correlation Clustering and Consensus Clustering 134
Developments in Circular Splicing 133
Regular languages generated by reflexive finite Splicing Systems 133
The binary perfect phylogeny with persistent characters 132
Regular splicing languages and subclasses 130
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information 129
On Automata on infinite trees 129
Modular Decomposition of Hypergraphs 128
Reconciling Gene Trees to a Species Tree 128
On the Approximation of Correlation Clustering and Consensus Clustering 127
A characterization of (regular) circular languages generated by monotone complete splicing systems 123
Complexity insights of the Minimum Duplication problem 123
Picture languages generated by assembling tiles 122
Totale 18.052
Salva come PNG Salva come JPEG
Categoria #
all - tutte 68.880
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 68.880
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20203.699 0 0 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.392 83 73 73 215 287 551 461 116 218 47 34 234
2024/20251.198 323 558 317 0 0 0 0 0 0 0 0 0
Totale 22.405