Name
Affiliation
Papers
ALBERTO APOSTOLICO
College of Computing, Georgia Institute of Technology, Atlanta, GA
107
Collaborators
Citations 
PageRank 
81
1441
182.20
Referers 
Referees 
References 
1872
827
923
Search Limit
1001000
Title
Citations
PageRank
Year
String Cadences.00.342017
40 years of suffix trees.30.532016
Sequence similarity measures based on bounded hamming distance.80.512016
Modulated string searching00.342014
Alignment Free Sequence Similarity with Bounded Hamming Distance70.492014
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.00.342014
Forty Years Of Text Indexing10.362013
Ultrametric networks: a new tool for phylogenetic analysis.30.492013
Parameterized searching with mismatches for run-length encoded strings20.372012
Detecting approximate periodic patterns00.342012
Phylogeny construction with rigid gapped motifs.30.422012
Efficient algorithms for the periodic subgraphs mining problem00.342012
Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291).00.342012
Range LCP.10.362011
Image Compression by 2D Motif Basis40.372011
Speedup for a periodic subgraph miner40.512011
Sequence Similarity by Gapped LZW20.402011
Efficient algorithms for the discovery of gapped factors.40.422011
Maximal words in sequence comparisons based on subword composition100.572010
A PTAS for the Square Tiling Problem.10.362010
VARUN: discovering extensible motifs under saturation constraints.170.662010
10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies.00.342010
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract)00.342010
Optimal Extraction Of Irredundant Motif Bases20.392010
The subsequence composition of a string10.352009
Graph Compression By Bfs431.712009
Discovering subword associations in strings in time linear in the output size30.392009
Ask Not What Stringology Can Do for You: Advances in Pattern Matching Driven by Computational Biology00.342009
Alignment of biological sequences with quality scores20.412009
Probing the Randomness of Proteins by Their Subsequence Composition00.342009
Motif patterns in 2D90.532008
Fast algorithms for computing sequence distances by exhaustive substring composition.100.562008
Table Compression by Record Intersections60.462008
Periodicity and repetitions in parameterized strings90.492008
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time100.662008
Scoring Unusual Words with Varying Mismatch Errors40.432008
Parameterized matching with mismatches220.812007
Fast gapped variants for Lempel--Ziv--Welch compression50.472007
Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface160.562007
Incremental Discovery of Irredundant Motif Bases in Time O(|Sigma| n2 log n)00.342007
2004 Symposium on String Processing and Information Retrieval00.342007
Motif discovery by monotone scores100.772007
Compressing With Collapsible Tries00.342006
Advances in information retrieval: an introduction to the special issue20.392006
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery00.342006
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery00.342006
On the Monotonicity of the String Correction Factor for Words with Mismatches10.412006
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006112.102006
Textual Compression by Collapsible Tries00.342006
Mining, compressing and classifying with extensible motifs.160.762006
  • 1
  • 2