Alberto Apostolico

According to our database, Alberto Apostolico authored at least 129 papers between 1977 and 2017.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2017

String cadences.

Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau

Theor. Comput. Sci., 2017

2016

Suffix Trees and Arrays.

Alberto Apostolico, Fabio Cunial

Encyclopedia of Algorithms, 2016

Sequence similarity measures based on bounded hamming distance.

Alberto Apostolico, Concettina Guerra, Gad M. Landau, Cinzia Pizzi

Theor. Comput. Sci., 2016

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings.

Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg

Theor. Comput. Sci., 2016

ALFRED: A Practical Method for Alignment-Free Distance Computation.

Sharma V. Thankachan, Sriram P. Chockalingam, Yongchao Liu, Alberto Apostolico, Srinivas Aluru

J. Comput. Biol., 2016

A Provably Efficient Algorithm for the <i>k</i>-Mismatch Average Common Substring Problem.

Sharma V. Thankachan, Alberto Apostolico, Srinivas Aluru

J. Comput. Biol., 2016

40 years of suffix trees.

Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan

Commun. ACM, 2016

2015

A PTAS for the Square Tiling Problem.

Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom

Theor. Comput. Sci., 2015

Efficient Alignment Free Sequence Comparison with Bounded Mismatches.

Srinivas Aluru, Alberto Apostolico, Sharma V. Thankachan

Proceedings of the Research in Computational Molecular Biology, 2015

2014

Modulated string searching.

Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons

Theor. Comput. Sci., 2014

Detecting approximate periodic patterns.

Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein

Theor. Comput. Sci., 2014

Range LCP.

Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat

J. Comput. Syst. Sci., 2014

Alignment Free Sequence Similarity with Bounded Hamming Distance.

Alberto Apostolico, Concettina Guerra, Cinzia Pizzi

Proceedings of the Data Compression Conference, 2014

2013

Ultrametric networks: a new tool for phylogenetic analysis.

Alberto Apostolico, Matteo Comin, Andreas W. M. Dress, Laxmi Parida

Algorithms Mol. Biol., 2013

Forty Years of Text Indexing.

Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

Parameterized searching with mismatches for run-length encoded strings.

Alberto Apostolico, Péter L. Erdös, Alpár Jüttner

Theor. Comput. Sci., 2012

Efficient algorithms for the periodic subgraphs mining problem.

Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi

J. Discrete Algorithms, 2012

Phylogeny Construction with Rigid Gapped Motifs.

Fabio Cunial, Alberto Apostolico

J. Comput. Biol., 2012

Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291).

Alberto Apostolico, Andreas W. M. Dress, Laxmi Parida

Dagstuhl Reports, 2012

2011

Speedup for a periodic subgraph miner.

Alberto Apostolico, Manuel Barbares, Cinzia Pizzi

Inf. Process. Lett., 2011

Efficient algorithms for the discovery of gapped factors.

Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen

Algorithms Mol. Biol., 2011

Sequence Similarity by Gapped LZW.

Alberto Apostolico, Fabio Cunial

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Image Compression by 2D Motif Basis.

Alessia Amelio, Alberto Apostolico, Simona E. Rombo

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010

VARUN: Discovering Extensible Motifs under Saturation Constraints.

Alberto Apostolico, Matteo Comin, Laxmi Parida

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

The Subsequence Composition of Polypeptides.

Alberto Apostolico, Fabio Cunial

J. Comput. Biol., 2010

Optimal Extraction of Irredundant Motif Bases.

Alberto Apostolico, Claudia Tagliacollo

Int. J. Found. Comput. Sci., 2010

Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract).

Alberto Apostolico, Péter L. Erdös, Alpár Jüttner

Proceedings of the String Processing and Information Retrieval, 2010

A PTAS for the Square Tiling Problem.

Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom

Proceedings of the String Processing and Information Retrieval, 2010

10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies.

Alberto Apostolico, Andreas W. M. Dress, Laxmi Parida

Proceedings of the Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06., 2010

Maximal Words in Sequence Comparisons Based on Subword Composition.

Alberto Apostolico

Proceedings of the Algorithms and Applications, 2010

2009

The subsequence composition of a string.

Alberto Apostolico, Fabio Cunial

Theor. Comput. Sci., 2009

Discovering subword associations in strings in time linear in the output size.

Alberto Apostolico, Giorgio Satta

J. Discrete Algorithms, 2009

Alignment of biological sequences with quality scores.

Joong Chae Na, Kangho Roh, Alberto Apostolico, Kunsoo Park

Int. J. Bioinform. Res. Appl., 2009

Ask Not What Stringology Can Do for You: Advances in Pattern Matching Driven by Computational Biology.

Alberto Apostolico

Commun. Inf. Syst., 2009

Graph Compression by BFS.

Alberto Apostolico, Guido Drovandi

Algorithms, 2009

Probing the Randomness of Proteins by Their Subsequence Composition.

Alberto Apostolico, Fabio Cunial

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

Monotony and Surprise.

Alberto Apostolico

Proceedings of the Algorithmic Bioprocesses, 2009

2008

Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n²logn) time.

Alberto Apostolico, Claudia Tagliacollo

Theor. Comput. Sci., 2008

Motif patterns in 2D.

Alberto Apostolico, Laxmi Parida, Simona E. Rombo

Theor. Comput. Sci., 2008

Scoring Unusual Words with Varying Mismatch Errors.

Alberto Apostolico, Cinzia Pizzi

Math. Comput. Sci., 2008

Fast algorithms for computing sequence distances by exhaustive substring composition.

Alberto Apostolico, Olgert Denas

Algorithms Mol. Biol., 2008

Sequence distances based on exhaustive substring composition.

Alberto Apostolico, Olgert Denas

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Table Compression by Record Intersections.

Alberto Apostolico, Fabio Cunial, Vineith Kaul

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

2007

Parameterized matching with mismatches.

Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein

J. Discrete Algorithms, 2007

2004 Symposium on String Processing and Information Retrieval.

Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci

J. Discrete Algorithms, 2007

Preface.

Alberto Apostolico

J. Comput. Biol., 2007

Fast gapped variants for Lempel-Ziv-Welch compression.

Alberto Apostolico

Inf. Comput., 2007

Motif discovery by monotone scores.

Alberto Apostolico, Cinzia Pizzi

Discret. Appl. Math., 2007

Articles selected from posters presented at the Tenth Annual International Conference on Research in Computational Biology - Preface.

Alberto Apostolico, Raffaele Giancarlo, Concettina Guerra, Giuseppe Lancia

BMC Bioinform., 2007

Incremental Discovery of Irredundant Motif Bases in Time <i>O</i>(|<i>Sigma</i>| <i>n</i>² log <i>n</i>).

Alberto Apostolico, Claudia Tagliacollo

Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Optimal Offline Extraction of Irredundant Motif Bases.

Alberto Apostolico, Claudia Tagliacollo

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Advances in information retrieval: An introduction to the special issue.

Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci

Inf. Syst., 2006

Mining, compressing and classifying with extensible motifs.

Alberto Apostolico, Matteo Comin, Laxmi Parida

Algorithms Mol. Biol., 2006

Compressing with Collapsible Tries.

Alberto Apostolico, Yongwook Choi

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Textual Compression by Collapsible Tries.

Alberto Apostolico, Yongwook Choi

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

On the Monotonicity of the String Correction Factor for Words with Mismatches.

Alberto Apostolico, Cinzia Pizzi

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

2005

Foreword: Pattern Discovery in the Post Genome.

Alberto Apostolico, Raffaele Giancarlo

Theor. Comput. Sci., 2005

Periodicity and Repetitions in Parameterized Strings.

Alberto Apostolico, Raffaele Giancarlo

Electron. Notes Discret. Math., 2005

Bridging Lossy and Lossless Compression by Motif Pattern Discovery.

Alberto Apostolico, Matteo Comin, Laxmi Parida

Electron. Notes Discret. Math., 2005

Optimal discovery of repetitions in 2D.

Alberto Apostolico, Valentin E. Brimkov

Discret. Appl. Math., 2005

Conservative extraction of over-represented extensible motifs.

Alberto Apostolico, Matteo Comin, Laxmi Parida

Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

Off-Line Compression by Extensible Motifs.

Alberto Apostolico, Matteo Comin, Laxmi Parida

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Of Lempel-Ziv-Welch Parses with Refillable Gaps.

Alberto Apostolico

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

Verbumculus and the Discovery of Unusual Words.

Alberto Apostolico, Fang-Cheng Gong, Stefano Lonardi

J. Comput. Sci. Technol., 2004

Incremental Paradigms of Motif Discovery.

Alberto Apostolico, Laxmi Parida

J. Comput. Biol., 2004

Monotone Scoring of Patterns with Mismatches: (Extended Abstract).

Alberto Apostolico, Cinzia Pizzi

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Optimal Discovery of Subword Associations in Strings.

Alberto Apostolico, Cinzia Pizzi, Giorgio Satta

Proceedings of the Discovery Science, 7th International Conference, 2004

Motifs in Ziv-Lempel-Welch Clef.

Alberto Apostolico, Matteo Comin, Laxmi Parida

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Truncated suffix trees and their application to data compression.

Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park

Theor. Comput. Sci., 2003

Efficient text fingerprinting via Parikh mapping.

Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta

J. Discrete Algorithms, 2003

Monotony of Surprise and Large-Scale Quest for Unusual Words.

Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi

J. Comput. Biol., 2003

Compression and the Wheel of Fortune.

Alberto Apostolico, Laxmi Parida

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002

A speed-up for the commute between subword trees and DAWGs.

Alberto Apostolico, Stefano Lonardi

Inf. Process. Lett., 2002

Compact Recognizers of Episode Sequences.

Alberto Apostolico, Mikhail J. Atallah

Inf. Comput., 2002

2001

Of Maps Bigger than the Empire (Invited Paper).

Alberto Apostolico

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

2000

Fibonacci arrays and their two-dimensional repetitions.

Alberto Apostolico, Valentin E. Brimkov

Theor. Comput. Sci., 2000

Off-line compression by greedy textual substitution.

Alberto Apostolico, Stefano Lonardi

Proc. IEEE, 2000

Efficient Detection of Unusual Words.

Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi, Xuyan Xu

J. Comput. Biol., 2000

Optimal Amnesic Probabilistic Automata or How to Learn and Classify Proteins in Linear Time and Space.

Alberto Apostolico, Gill Bejerano

J. Comput. Biol., 2000

Compression of Biological Sequences by Greedy Off-Line Textual Substitution.

Alberto Apostolico, Stefano Lonardi

Proceedings of the Data Compression Conference, 2000

Notes on Learning Probabilistic Automata.

Alberto Apostolico

Proceedings of the Data Compression Conference, 2000

1999

Matching for Run-Length Encoded Strings.

Alberto Apostolico, Gad M. Landau, Steven Skiena

J. Complex., 1999

Linear Global Detectors of Redundant and Rare Substrings.

Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi

Proceedings of the Data Compression Conference, 1999

General Pattern Matching.

Alberto Apostolico

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Seqeunce Alignment in Molecular Biology.

Alberto Apostolico, Raffaele Giancarlo

J. Comput. Biol., 1998

Sequence alignment in molecular biology.

Alberto Apostolico, Raffaele Giancarlo

Proceedings of the Mathematical Support for Molecular Biology, 1998

Some Theory and Practice of Greedy Off-Line Textual Substitution.

Alberto Apostolico, Stefano Lonardi

Proceedings of the Data Compression Conference, 1998

1997

String Editing and Longest Common Subsequences.

Alberto Apostolico

Proceedings of the Handbook of Formal Languages, 1997

Inverse Pattern Matching.

Amihood Amir, Alberto Apostolico, Moshe Lewenstein

J. Algorithms, 1997

Annotated statistical indices for sequence analysis.

Alberto Apostolico, Mary Ellen Bock, Xuyan Xu

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Of Periods, Quasiperiods, Repetitions and Covers.

Alberto Apostolico, Dany Breslauer

Proceedings of the Structures in Logic and Computer Science, 1997

Parallel computations of Levenshtein distances.

Alberto Apostolico, Mikhail J. Atallah

Proceedings of the Pattern Matching Algorithms, 1997

On-line string searching.

Alberto Apostolico

Proceedings of the Pattern Matching Algorithms, 1997

1996

An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String.

Alberto Apostolico, Dany Breslauer

SIAM J. Comput., 1996

Data Structures and Algorithms for the String Statistics Problem.

Alberto Apostolico, Franco P. Preparata

Algorithmica, 1996

1995

Parallel Detection of all Palindromes in a String.

Alberto Apostolico, Dany Breslauer, Zvi Galil

Theor. Comput. Sci., 1995

Fast Parallel Lyndon Factorization with Applications.

Alberto Apostolico, Maxime Crochemore

Math. Syst. Theory, 1995

An International Masters in Software Engineering: Experience and Prospects.

Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo

Proceedings of the Eleventh International Conference on Data Engineering, 1995

1994

The Set Union Problem With Unlimited Backtracking.

Alberto Apostolico, Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo

SIAM J. Comput., 1994

Guest Editor's Foreword: Special Issue on String Algorithmics and Its Applications.

Alberto Apostolico

Algorithmica, 1994

1993

Efficient Detection of Quasiperiodicities in Strings.

Alberto Apostolico, Andrzej Ehrenfeucht

Theor. Comput. Sci., 1993

Efficient CRCW-PRAM Algorithms for Universal Substring Searching.

Alberto Apostolico

Theor. Comput. Sci., 1993

New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24).

Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch

Discret. Appl. Math., 1993

1992

Fast Linear-Space Computations of Longest Common Subsequences.

Alberto Apostolico, S. Browne, Concettina Guerra

Theor. Comput. Sci., 1992

Self-Alignments in Words and Their Applications.

Alberto Apostolico, Wojciech Szpankowski

J. Algorithms, 1992

New clique and independent set algorithms for circle graphs.

Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch

Discret. Appl. Math., 1992

Optimal Parallel Detection of Squares in Strings.

Alberto Apostolico

Algorithmica, 1992

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract).

Alberto Apostolico, Dany Breslauer, Zvi Galil

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Optimal Canonization of All Substrings of a String

Alberto Apostolico, Maxime Crochemore

Inf. Comput., November, 1991

Optimal Superprimitivity Testing for Strings.

Alberto Apostolico, Martin Farach, Costas S. Iliopoulos

Inf. Process. Lett., 1991

1990

Efficient Parallel Algorithms for String Editing and Related Problems.

Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin

SIAM J. Comput., 1990

1988

Parallel Construction of a Suffix Tree with Applications.

Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin

Algorithmica, 1988

1987

Robust transmission of unbounded strings using Fibonacci representations.

Alberto Apostolico, Aviezri S. Fraenkel

IEEE Trans. Inf. Theory, 1987

Finding Maximum Cliques on Circular-Arc Graphs.

Alberto Apostolico, Susanne E. Hambrusch

Inf. Process. Lett., 1987

Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem.

Alberto Apostolico

Inf. Process. Lett., 1987

The Longest Common Subsequence Problem Revisited.

Alberto Apostolico, Concettina Guerra

Algorithmica, 1987

On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.

Alberto Apostolico, Costas S. Iliopoulos, Robert Paige

Proceedings of the Parallel Algorithms and Architectures, 1987

1986

The Boyer-Moore-Galil String Searching Strategies Revisited.

Alberto Apostolico, Raffaele Giancarlo

SIAM J. Comput., 1986

Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings.

Alberto Apostolico

Inf. Process. Lett., 1986

1985

Structural Properties of the String Statistics Problem.

Alberto Apostolico, Franco P. Preparata

J. Comput. Syst. Sci., 1985

1984

Systolic Algorithms for String Manipulations.

Alberto Apostolico, Alberto Negro

IEEE Trans. Computers, 1984

On Context Constrained Squares and Repetitions in a String.

Alberto Apostolico

RAIRO Theor. Informatics Appl., 1984

Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability.

Alberto Apostolico, Raffaele Giancarlo

Inf. Process. Lett., 1984

1983

Optimal Off-Line Detection of Repetitions in a String.

Alberto Apostolico, Franco P. Preparata

Theor. Comput. Sci., 1983

1978

An application of C-calculus to texture analysis: C-transforms.

Alberto Apostolico, Eduardo R. Caianiello, Enrico Fischetti, Sergio Vitulano

Pattern Recognit., 1978

C-calculus: An elementary approach to some problems in pattern recognition .

Alberto Apostolico, Eduardo R. Caianiello, Enrico Fischetti, Sergio Vitulano

Pattern Recognit., 1978

1977

An image transform emphasizing textual features.

Alberto Apostolico, Sergio Vitulano

Proceedings of the Digital Bildverarbeitung, 1977