APOSTOLICO, ALBERTO
 Distribuzione geografica
Continente #
NA - Nord America 3.979
EU - Europa 445
AS - Asia 313
SA - Sud America 4
OC - Oceania 1
Totale 4.742
Nazione #
US - Stati Uniti d'America 3.977
CN - Cina 159
UA - Ucraina 126
SG - Singapore 124
FI - Finlandia 86
DE - Germania 68
FR - Francia 40
GB - Regno Unito 40
RU - Federazione Russa 34
SE - Svezia 33
VN - Vietnam 27
IT - Italia 10
IE - Irlanda 6
BR - Brasile 4
CA - Canada 2
AU - Australia 1
IN - India 1
JO - Giordania 1
NL - Olanda 1
OM - Oman 1
RO - Romania 1
Totale 4.742
Città #
Woodbridge 544
Fairfield 536
Jacksonville 534
Ann Arbor 359
Houston 276
Ashburn 213
Santa Clara 208
Seattle 188
Wilmington 183
Cambridge 173
Princeton 131
Chandler 107
Boardman 85
Singapore 84
San Diego 68
Roxbury 59
Medford 28
Dong Ket 27
Beijing 26
Helsinki 25
Guangzhou 24
Nanjing 23
Des Moines 20
Hebei 12
Shenyang 12
Jiaxing 10
London 10
Indiana 9
Norwalk 9
Greenhithe 8
Changsha 7
Dublin 6
Tianjin 6
Changchun 5
Kharkiv 5
Nanchang 5
Falls Church 4
Kilburn 4
Padova 4
Wandsworth 3
Chiswick 2
Hounslow 2
Ogden 2
Orange 2
Rockville 2
Saarbrücken 2
San Francisco 2
Southwark 2
Tappahannock 2
Acton 1
Almirante Tamandaré 1
Amman 1
Arad 1
Auburn Hills 1
Beaverton 1
Forest City 1
Geislingen an der Steige 1
Lagoa Vermelha 1
Los Angeles 1
Marília 1
Muscat 1
New York 1
Ningbo 1
Oderzo 1
Ottawa 1
Pune 1
Round Rock 1
Serra 1
Shanghai 1
Sydney 1
Uberlândia 1
Union 1
Weihai 1
Yubileyny 1
Totale 4.083
Nome #
Bridging lossy and lossless compression by motif pattern discovery 140
Parameterized matching with mismatches. 116
Fast gapped variants for Lempel-Ziv-Welch compression. 110
Scoring Unusual Words with Varying Mismatch Errors 109
Of Lempel-Ziv-Welch Parses with Refillable Gaps. 108
Sequence Alignment in Molecular Biology 106
Pattern Matching Algorithms 106
Verbumculus and the discovery of unusual words 105
Bridging Lossy and Lossless Compression by Motif Pattern Discovery 105
Efficient Algorithms for the Discovery of Gapped Factors 104
Conservative Extraction of Over-represented Extensible Motifs 102
Discovering subword associations in strings in time linear in the output size. 99
Compressing with Collapsible Tries 98
Optimal discovery of repetitions in 2D. 96
Compression and the Wheel of Fortune 94
Motifs in Ziv-Lempel-Welch Clef 93
Efficient Text Fingerprinting Via Parikh Mapping 92
VARUN: Discovering Extensible Motifs under Saturation Constraints 92
Matching of run-length encoded strings 91
Combinatorial Pattern Matching 2002 90
Efficient Detection of Unusual Words 86
Compression of Biological Sequences by Greedy Off-line Textual Substitution 86
String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Springer-Verlag LNCS 85
Fibonacci arrays and their two-dimensional repetitions 83
2004 Symposium on String Processing and Information Retrieval 83
Mining, Compressing and Classifying with Extensible Motifs 83
Finding 3D Motifs in Ribosomal RNA Structures 82
Alignment of biological sequences with quality scores. 82
Optimal Amnesic Probabilistic Automata, or How to Learn and Classify Proteins in linear Time and Space 79
Motif patterns in 2D. 78
A speed-up for the Commute between Subword Trees and DAWGs 78
Pattern Discovery in the Post Genome. Theor. Comput. Sci. 335(1): 1-2 (2005) 76
General Pattern Matching (invited paper) 75
Compact Recognizers of Episode Sequences 74
Periodicity and repetitions in parameterized strings. 74
Monotony of Surprise and Large Scale Quest for Unusual Words 73
The Subsequence Composition of Polypeptides 73
Speedup for a Periodic Subgraph Miner 73
Incremental Paradigms of Motif Discovery 72
Motif discovery by monotone scores 72
Optimal Amnesic Probabilistic Automata, or How to Learn and Classify Proteins in Linear Time and Space 72
Notes on Learning Probabilistic Automata 71
The subsequence composition of a string. 66
Truncated Suffix Trees and their Applications to Data Compression 64
Of Maps Bigger than the Empire (Keynote Paper) 61
String Pattern Matching for a Deluge Survival Kit (invited paper) 61
Off-line Compression by Extensible Motifs 60
Linear Global Detectors of Redundant and Rare Strings 59
Off-line Compression by Greedy Textual Substitution (invited paper) 59
Finding approximate occurrences of a pattern that contains gaps 59
Pattern Discovery in the Crib of Procrustes 55
Pattern Discovery and the Algorithmics of Surprise (Invited Paper) 52
Advances in Information Retrieval: An Introduction to the Special Issue 51
Monotony of Surprise and Large Scale Quest for Unusual Words (extended abstract) 49
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings Springer 2005 48
Backtracking (Invited Paper) 47
Efficient Tools for Comparative Subword Analysis 45
Sequence Alignment in Molecular Biology (Invited Paper) 44
Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings Springer 2006 44
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time. 37
Special Issue Dedicated to the Symposium on String Processing and Information Retrieval 21
Totale 4.748
Categoria #
all - tutte 16.971
article - articoli 9.871
book - libri 0
conference - conferenze 0
curatela - curatele 499
other - altro 1.361
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.431
Totale 30.133


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020508 0 0 0 0 0 0 89 131 90 90 46 62
2020/2021690 21 77 12 82 13 64 20 84 126 58 79 54
2021/2022717 10 74 119 42 31 33 26 86 33 14 106 143
2022/2023402 137 0 1 20 78 51 1 31 64 1 10 8
2023/2024154 10 25 13 12 4 9 5 8 2 5 30 31
2024/2025488 5 65 51 46 279 10 32 0 0 0 0 0
Totale 4.748