Alberto Apostolico

发表

Monotony of surprise and large-scale quest for unusual words.

Stefano Lonardi, Alberto Apostolico, Mary Ellen Bock, 2003 .

Motifs in Ziv-Lempel-Welch Clef

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

Monotony and Surprise

Alberto Apostolico, 2005, COCOON.

Range LCP

Gad M. Landau, Moshe Lewenstein, Ely Porat, 2011, ISAAC.

Ultrametric networks: a new tool for phylogenetic analysis

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2013, Algorithms for Molecular Biology.

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

Alberto Apostolico, Sergio Vitulano, Eduardo R. Caianiello, 1978, Pattern Recognit..

Parallel construction of a suffix tree with applications

Gad M. Landau, Uzi Vishkin, Costas S. Iliopoulos, 1988, Algorithmica.

Of Maps Bigger than the Empire (Invited Paper)

Alberto Apostolico, 2001, SPIRE.

Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching

Maxime Crochemore, Zvi Galil, Alberto Apostolico, 1992 .

Optimal Offline Extraction of Irredundant Motif Bases

Alberto Apostolico, Claudia Tagliacollo, 2007, COCOON.

Motif discovery by monotone scores

Alberto Apostolico, Cinzia Pizzi, 2007, Discret. Appl. Math..

The Boyer-Moore-Galil String Searching Strategies Revisited

Raffaele Giancarlo, Alberto Apostolico, 1986, SIAM J. Comput..

Verbumculus: Fast Discovery and Visualization of Unusual Words

Stefano Lonardi, Alberto Apostolico, 2000 .

Sequence distances based on exhaustive substring composition

Alberto Apostolico, Olgert Denas, Olgert Denas, 2008, 2008 IEEE Information Theory Workshop.

Of Periods, Quasiperiods, Repetitions and Covers

Alberto Apostolico, Dany Breslauer, 1997, Structures in Logic and Computer Science.

Bridging Lossy and Lossless Compression by Motif Pattern Discovery

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2006, GTIT-C.

Optimal Superprimitivity Testing for Strings

Costas S. Iliopoulos, Alberto Apostolico, Martin Farach-Colton, 1991, Inf. Process. Lett..

Speedup for a periodic subgraph miner

Alberto Apostolico, Cinzia Pizzi, Manuel Barbares, 2011, Inf. Process. Lett..

A PTAS for the Square Tiling Problem

Gad M. Landau, Ely Porat, Amihood Amir, 2015, Theor. Comput. Sci..

Detecting approximate periodic patterns

Gad M. Landau, Amihood Amir, Avivit Levy, 2014, Theor. Comput. Sci..

Optimal Extraction of Irredundant Motif Bases

Alberto Apostolico, Claudia Tagliacollo, 2010, Int. J. Found. Comput. Sci..

String processing and information retrieval : 11th international conference, SPIRE 2004, Padova, Italy, October 5-8, 2004 : proceedings

Massimo Melucci, Alberto Apostolico, 2004 .

Preface

Alberto Apostolico, 2007, J. Comput. Biol..

Fast Linear-Space Computations of Longest Common Subsequences

Alberto Apostolico, Concettina Guerra, S. Browne, 1992, Theor. Comput. Sci..

On Context Constrained Squares and Repetitions in a String

Alberto Apostolico, A. Apostolico, 1984, RAIRO Theor. Informatics Appl..

Efficient text fingerprinting via Parikh mapping

Giorgio Satta, Amihood Amir, Alberto Apostolico, 2003, J. Discrete Algorithms.

Guest editor's foreword special issue on string algorithmics and its applications

Alberto Apostolico, 2005, Algorithmica.

Sequence alignment in molecular biology

Raffaele Giancarlo, Alberto Apostolico, R. Giancarlo, 1998, Mathematical Support for Molecular Biology.

Fibonacci arrays and their two-dimensional repetitions

Valentin E. Brimkov, Alberto Apostolico, A. Apostolico, 2000, Theor. Comput. Sci..

Graph Compression by BFS

Alberto Apostolico, Guido Drovandi, A. Apostolico, 2009, Algorithms.

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

Alberto Apostolico, Laxmi Parida, Andreas W. M. Dress, 2010, Structure Discovery in Biology: Motifs, Networks & Phylogenies.

Optimal discovery of repetitions in 2D

Valentin E. Brimkov, Alberto Apostolico, 2005, Discret. Appl. Math..

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

Alberto Apostolico, 2009, Commun. Inf. Syst..

Scoring Unusual Words with Varying Mismatch Errors

Alberto Apostolico, Cinzia Pizzi, 2008, Math. Comput. Sci..

Pattern Discovery and the Algorithmics of Surprise (Invited Paper)

Alberto Apostolico, 2003 .

Off-line compression by extensible motifs

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2005, Data Compression Conference.

Efficient Detection of Quasiperiodicities in Strings

Andrzej Ehrenfeucht, Alberto Apostolico, A. Ehrenfeucht, 1993, Theor. Comput. Sci..

Foreword: Pattern Discovery in the Post Genome

Raffaele Giancarlo, Alberto Apostolico, 2005, Theor. Comput. Sci..

Efficient Detection of Unusual Words

Stefano Lonardi, Alberto Apostolico, Mary Ellen Bock, 2000, J. Comput. Biol..

Robust transmission of unbounded strings using Fibonacci representations

Alberto Apostolico, Aviezri S. Fraenkel, A. Fraenkel, 1987, IEEE Trans. Inf. Theory.

Efficient Parallel Algorithms for String Editing and Related Problems

Mikhail J. Atallah, Lawrence L. Larmore, Alberto Apostolico, 1990, SIAM J. Comput..

Table Compression by Record Intersections

Alberto Apostolico, Fabio Cunial, Vineith Kaul, 2008, Data Compression Conference (dcc 2008).

Parameterized searching with mismatches for run-length encoded strings

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

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

Giorgio Satta, Alberto Apostolico, A. Apostolico, 2009, J. Discrete Algorithms.

An international Masters in Software Engineering: experience and prospects

Gianfranco Bilardi, Alberto Apostolico, Richard A. DeMillo, 1995, Proceedings of the Eleventh International Conference on Data Engineering.

Truncated suffix trees and their application to data compression

Joong Chae Na, Costas S. Iliopoulos, Alberto Apostolico, 2003, Theor. Comput. Sci..

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

Alberto Apostolico, 1987, Inf. Process. Lett..

Sequence Similarity by Gapped LZW

Alberto Apostolico, Fabio Cunial, A. Apostolico, 2011, 2011 Data Compression Conference.

Optimal Parallel Algorithms for Periods, Palindromes and Squares (Preliminary Version)

Zvi Galil, Alberto Apostolico, Dany Breslauer, 1991 .

Phylogeny Construction with Rigid Gapped Motifs

Alberto Apostolico, Fabio Cunial, A. Apostolico, 2012, J. Comput. Biol..

General Patt ern Matching

Alberto Apostolico, 1997 .

Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)

Costas S. Iliopoulos, Alberto Apostolico, Kunsoo Park, 2003 .

Annotated statistical indices for sequence analysis

Alberto Apostolico, Mary Ellen Bock, Xuyan Xu, 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

The longest common subsequence problem revisited

Alberto Apostolico, Concettina Guerra, A. Apostolico, 1987, Algorithmica.

Range LCP

Gad M. Landau, Moshe Lewenstein, Ely Porat, 2014, J. Comput. Syst. Sci..

Efficient CRCW-PRAM Algorithms Combining Multiple Autonomous Databases

Alberto Apostolico, A. Apostolico, 1991 .

Periodicity and repetitions in parameterized strings

Raffaele Giancarlo, Alberto Apostolico, 2008, Discret. Appl. Math..

On-Line Serial and Parallel String Searching

Alberto Apostolico, 1992 .

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

Costas S. Iliopoulos, Alberto Apostolico, Robert Paige, 1987, Parallel Algorithms and Architectures.

Parallel computations of Levenshtein distances

Mikhail J. Atallah, Alberto Apostolico, M. Atallah, 1997, Pattern Matching Algorithms.

Suffix Trees and Arrays

Alberto Apostolico, Fabio Cunial, 2016 .

An image transform emphasizing textual features

Alberto Apostolico, Sergio Vitulano, 1977, Digital Image Processing.

On Learning Probabilistic Automata

Alberto Apostolico, A. Apostolico, 1999 .

Searching for Ephemeral Subsequences in Strings

Alberto Apostolico, Mikhail J. Attalah, 1996 .

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

Alberto Apostolico, Dany Breslauer, A. Apostolico, 1996, SIAM J. Comput..

Compressing with Collapsible Tries

Alberto Apostolico, Yongwook Choi, 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

Matching for run-length encoded strings

Gad M. Landau, Steven Skiena, Alberto Apostolico, 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

Maximal Words in Sequence Comparisons Based on Subword Composition

Alberto Apostolico, A. Apostolico, 2010, Algorithms and Applications.

Mining, compressing and classifying with extensible motifs

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2006, Algorithms for Molecular Biology.

A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem

Srinivas Aluru, Alberto Apostolico, Sharma V. Thankachan, 2016, J. Comput. Biol..

General Pattern Matching

Alberto Apostolico, A. Apostolico, 2010, Algorithms and Theory of Computation Handbook.

Optimal discovery of subword associations in strings: (Extended abstract)

Giorgio Satta, Alberto Apostolico, Cinzia Pizzi, 2004 .

Preface

Alberto Apostolico, 2007, J. Comput. Biol..

Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006

Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein, 2006, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

Parallel Log-time Construction of Suffix Trees

Costas S. Iliopoulos, Alberto Apostolico, 1986 .

Combinatorial Pattern Matching

J. van Leeuwen, Jan van Leeuwen, Masayuki Takeda, 2002, Lecture Notes in Computer Science.

Inverse Patt ern Matching

Moshe Lewenstein, Amihood Amir, Alberto Apostolico, 1995 .

Fast parallel Lyndon factorization with applications

Maxime Crochemore, Alberto Apostolico, M. Crochemore, 1995, Mathematical systems theory.

Motif patterns in 2D

Alberto Apostolico, Laxmi Parida, Simona E. Rombo, 2008, Theor. Comput. Sci..

Efficient Alignment Free Sequence Comparison with Bounded Mismatches

Srinivas Aluru, Alberto Apostolico, Sharma V. Thankachan, 2015, RECOMB.

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

Gad M. Landau, Amihood Amir, Alberto Apostolico, 2016, Theor. Comput. Sci..

Alignment Free Sequence Similarity with Bounded Hamming Distance

Alberto Apostolico, Concettina Guerra, Cinzia Pizzi, 2014, 2014 Data Compression Conference.

Image Compression by 2D Motif Basis

Alessia Amelio, Alberto Apostolico, Simona E. Rombo, 2011, 2011 Data Compression Conference.

Incremental Paradigms of Motif Discovery

Alberto Apostolico, Laxmi Parida, A. Apostolico, 2004, J. Comput. Biol..

Alignment of biological sequences with quality scores

Joong Chae Na, Alberto Apostolico, Kunsoo Park, 2009, Int. J. Bioinform. Res. Appl..

Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time

Alberto Apostolico, Claudia Tagliacollo, 2008, Theor. Comput. Sci..

Periodicity and repetitions in parameterized strings

Raffaele Giancarlo, Alberto Apostolico, R. Giancarlo, 2005, Discret. Appl. Math..

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

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

Systolic Algorithms for String Manipulations

Alberto Negro, Alberto Apostolico, 1984, IEEE Transactions on Computers.

Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space

Alberto Apostolico, Gill Bejerano, G. Bejerano, 2000, RECOMB '00.

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

Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein, 2006, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

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

Mikhail J. Atallah, Susanne E. Hambrusch, Alberto Apostolico, 1993, Discret. Appl. Math..

Conservative extraction of over-represented extensible motifs

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2005, ISMB.

The subsequence composition of a string

Alberto Apostolico, Fabio Cunial, 2009, Theor. Comput. Sci..

Monotony and Surprise

Alberto Apostolico, 2009, Algorithmic Bioprocesses.

String Editing and Longest Common Subsequences

Alberto Apostolico, A. Apostolico, 1997, Handbook of Formal Languages.

Some theory and practice of greedy off-line textual substitution

Stefano Lonardi, Alberto Apostolico, 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

On Computing Longest Common Subsequences in Linear Space

Alberto Apostolico, S. Browne, C. Guerra, 1988 .

Matching for Run-Length Encoded Strings

Gad M. Landau, Steven Skiena, Alberto Apostolico, 1999, J. Complex..

Suffix Trees and Arrays

Alberto Apostolico, Fabio Cunial, 2016, Encyclopedia of Algorithms.

Monotony of surprise and large-scale quest for unusual words

Stefano Lonardi, Alberto Apostolico, Mary Ellen Bock, 2002, RECOMB '02.

Of maps bigger than the empire

Alberto Apostolico, 2001, Proceedings Eighth Symposium on String Processing and Information Retrieval.

Detecting Approximate Periodic Patterns

Gad M. Landau, Amihood Amir, Avivit Levy, 2012, MedAlg.

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

Alberto Apostolico, Sergio Vitulano, Eduardo R. Caianiello, 1978, Pattern Recognit..

The Myriad Virtues of Subword Trees

Alberto Apostolico, A. Apostolico, 1985 .

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

Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein, 2006, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

On-line string searching

Alberto Apostolico, 1997, Pattern Matching Algorithms.

Modulated string searching

Alberto Apostolico, István Miklós, Péter L. Erdös, 2013, Theor. Comput. Sci..

Forty Years of Text Indexing

Maxime Crochemore, Zvi Galil, S. Muthukrishnan, 2013, CPM.

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

Alberto Apostolico, Laxmi Parida, Andreas W. M. Dress, 2012, Dagstuhl Reports.

String cadences pdf

Gad M. Landau, Amihood Amir, Alberto Apostolico, 2017, Theor. Comput. Sci..

Finding Maximum Cliques on Circular-Arc Graphs

Susanne E. Hambrusch, Alberto Apostolico, A. Apostolico, 1987, Inf. Process. Lett..

Advances in information retrieval: An introduction to the special issue

Ricardo A. Baeza-Yates, Massimo Melucci, Alberto Apostolico, 2006, Inf. Syst..

Global detectors of unusual words: design, implementation, and applications to pattern discovery in biosequences

Stefano Lonardi, Alberto Apostolico, S. Lonardi, 2001 .

Parallel Detection of all Palindromes in a String

Zvi Galil, Alberto Apostolico, Dany Breslauer, 1995, Theor. Comput. Sci..

Optimal Off-Line Detection of Repetitions in a String

Franco P. Preparata, Alberto Apostolico, F. Preparata, 1983, Theor. Comput. Sci..

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

Alberto Apostolico, 1986, Inf. Process. Lett..

Structural Properties of the String Statistics Problem

Franco P. Preparata, Alberto Apostolico, F. Preparata, 1985, J. Comput. Syst. Sci..

Optimal Discovery of Subword Associations in Strings

Giorgio Satta, Alberto Apostolico, Cinzia Pizzi, 2004, Discovery Science.

The Subsequence Composition of Polypeptides

Alberto Apostolico, Fabio Cunial, A. Apostolico, 2010, J. Comput. Biol..

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

Alberto Apostolico, Gill Bejerano, 2000, J. Comput. Biol..

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Gad M. Landau, Steven Skiena, Roded Sharan, 2006, WABI 2012.

Optimal Canonization of All Substrings of a String

Maxime Crochemore, Alberto Apostolico, M. Crochemore, 1991, Inf. Comput..

VARUN: Discovering Extensible Motifs under Saturation Constraints

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

Raffaele Giancarlo, Giuseppe Lancia, Alberto Apostolico, 2007, BMC Bioinformatics.

ALFRED: A Practical Method for Alignment-Free Distance Computation

Yongchao Liu, Srinivas Aluru, Alberto Apostolico, 2016, J. Comput. Biol..

The Set Union Problem With Unlimited Backtracking

Giuseppe F. Italiano, Giorgio Gambosi, Maurizio Talamo, 1994, SIAM J. Comput..

Inverse Pattern Matching

Moshe Lewenstein, Amihood Amir, Alberto Apostolico, 1997, J. Algorithms.

Data structures and algorithms for the string statistics problem

Franco P. Preparata, Alberto Apostolico, F. Preparata, 1996, Algorithmica.

Compact Recognizers of Episode Sequences

Mikhail J. Atallah, Alberto Apostolico, M. Atallah, 2002, Inf. Comput..

Incremental Discovery of Irredundant Motif Bases in Time O(|Sigma| n2 log n)

Alberto Apostolico, Claudia Tagliacollo, 2007, WABI.

Neural Coding: Information Beyond Shannon

Toby Berger, Alberto Apostolico, Lubomir Kostal, 2013 .

Parameterized matching with mismatches

Moshe Lewenstein, Alberto Apostolico, Péter L. Erdös, 2007, J. Discrete Algorithms.

Compression of biological sequences by greedy off-line textual substitution

Stefano Lonardi, Alberto Apostolico, 2000, Proceedings DCC 2000. Data Compression Conference.

Self-Alignments in Words and Their Applications

Wojciech Szpankowski, Alberto Apostolico, W. Szpankowski, 1992, J. Algorithms.

Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability

Raffaele Giancarlo, Alberto Apostolico, 1984, Inf. Process. Lett..

2004 Symposium on String Processing and Information Retrieval

Ricardo A. Baeza-Yates, Massimo Melucci, Alberto Apostolico, 2007, J. Discrete Algorithms.

Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings

Maxime Crochemore, Alberto Apostolico, Kunsoo Park, 2005, CPM.

Optimal parallel detection of squares in strings

Alberto Apostolico, A. Apostolico, 1992, Algorithmica.

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

Zvi Galil, Alberto Apostolico, Dany Breslauer, 1992, ICALP.

Gad M. Landau, Alberto Apostolico, Concettina Guerra, 2016, Theor. Comput. Sci..

Linear global detectors of redundant and rare substrings

Stefano Lonardi, Alberto Apostolico, Mary Ellen Bock, 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

Of Lempel-Ziv-Welch parses with refillable gaps

Alberto Apostolico, 2005, Data Compression Conference.

Notes on Learning Probabilistic Automata

Alberto Apostolico, 2000, Data Compression Conference.

Efficient algorithms for the periodic subgraphs mining problem

Alberto Apostolico, Zsuzsanna Lipták, Péter L. Erdös, 2012, J. Discrete Algorithms.

Parallel Detection of all Palindromes in a String

Zvi Galil, Alberto Apostolico, Dany Breslauer, 1994, STACS.

Monotone Scoring of Patterns with Mismatches: (Extended Abstract)

Alberto Apostolico, Cinzia Pizzi, 2004, WABI.

40 years of suffix trees

Maxime Crochemore, Zvi Galil, Alberto Apostolico, 2016, Commun. ACM.

Compression and the wheel of fortune

Alberto Apostolico, Laxmi Parida, 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

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

Stefano Lonardi, Alberto Apostolico, 2002, Inf. Process. Lett..

Verbumculus and the discovery of unusual words

Stefano Lonardi, Alberto Apostolico, Fang-Cheng Gong, 2008, Journal of Computer Science and Technology.

Probing the Randomness of Proteins by Their Subsequence Composition

Alberto Apostolico, Fabio Cunial, 2009, 2009 Data Compression Conference.

MONOTONY AND SURPRISE (CONSERVATIVE APPROACHES TO PATTERN DISCOVERY)

Alberto Apostolico, 2008, RECOMB 2008.

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

Alberto Apostolico, Cinzia Pizzi, 2006, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

Efficient algorithms for the discovery of gapped factors

Alberto Apostolico, Esko Ukkonen, Cinzia Pizzi, 2011, Algorithms for Molecular Biology.

Seqeunce Alignment in Molecular Biology

Raffaele Giancarlo, Alberto Apostolico, R. Giancarlo, 1998, J. Comput. Biol..

A PTAS for the Square Tiling Problem

Gad M. Landau, Amihood Amir, Alberto Apostolico, 2010, SPIRE.

Bridging Lossy and Lossless Compression by Motif Pattern Discovery

Matteo Comin, Alberto Apostolico, Laxmi Parida, 2005, Electron. Notes Discret. Math..

Fast gapped variants for Lempel-Ziv-Welch compression

Alberto Apostolico, A. Apostolico, 2007, Inf. Comput..

General Pattern Matching

Alberto Apostolico, 1999, Algorithms and Theory of Computation Handbook.

Compressing withCollapsible Tries

Alberto Apostolico, 2006 .

Efficient CRCW-PRAM Algorithms for Universal Substring Searching

Alberto Apostolico, A. Apostolico, 1993, Theor. Comput. Sci..

Fast algorithms for computing sequence distances by exhaustive substring composition

Alberto Apostolico, Olgert Denas, 2008, Algorithms for Molecular Biology.

String Processing and Information Retrieval

Massimo Melucci, Alberto Apostolico, Emine Yilmaz, 2012, Lecture Notes in Computer Science.

Global Biodiversity Informatics Outlook: Delivering biodiversity knowledge in the information age

Alberto Apostolico, Alex Hardisty, Dawn Field, 2013 .

New clique and independent set algorithms for circle graphs

Mikhail J. Atallah, Susanne E. Hambrusch, Alberto Apostolico, 1992, Discret. Appl. Math..

Textual compression by collapsible tries

Alberto Apostolico, Yongwook Choi, 2006, Data Compression Conference (DCC'06).

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings

Gad M. Landau, Amihood Amir, Alberto Apostolico, 2014, SPIRE.

Finding Approximate Occurrences of a Pattern That Contains Gaps

Costas S. Iliopoulos, In-Bok Lee, Alberto Apostolico, 2003 .

Efficient tools for comparative substring analysis.

Alberto Apostolico, Olgert Denas, Andreas Dress, 2010, Journal of biotechnology.

Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings

Maxime Crochemore, Alberto Apostolico, Galil Zvi, 1993 .

An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String

Alberto Apostolico, Dany Breslauer, 1995 .

Finding 3D motifs in ribosomal RNA structures

Alberto Apostolico, Chiaolong Hsiao, Concettina Guerra, 2009, Nucleic acids research.

Pattern Discovery and the Algorithmics of Surprise

Alberto Apostolico, 2002 .