Roberto Grossi

Theor. Comput. Sci., 2011

MADMX: A Strategy for Maximal Dense Motif Extraction.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection

[BibT_eX]

[DOI]

S. Muthukrishnan

CoRR, 2011

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Optimal Packed String Matching.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.

[BibT_eX]

[DOI]

Rui A. Ferreira

Romeo Rizzi

Proceedings of the Algorithms - ESA 2011, 2011

Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees.

[BibT_eX]

[DOI]

Giovanni Battaglia

Noemi Scutellà

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Semi-indexing semi-structured data in tiny space.

[BibT_eX]

[DOI]

Giuseppe Ottaviano

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Wavelet Trees: From Theory to Practice.

[BibT_eX]

[DOI]

Bojian Xu

Proceedings of the First International Conference on Data Compression, 2011

Inferring Mobile Elements in S. Cerevisiae Strains.

[BibT_eX]

Proceedings of the BIOINFORMATICS 2011, 2011

2010

Optimal Trade-Off for Succinct String Indexes

[BibT_eX]

[DOI]

Alessio Orlandi

Rajeev Raman

CoRR, 2010

Optimal Trade-Offs for Succinct String Indexes.

[BibT_eX]

[DOI]

Alessio Orlandi

Rajeev Raman

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Fun with Olympiad in Algorithmics.

[BibT_eX]

[DOI]

Alessio Orlandi

Giuseppe Ottaviano

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Masking patterns in sequences: A new class of motif discovery with don't cares.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

MADMX: A Novel Strategy for Maximal Dense Motif Extraction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Optimal Cache-Aware Suffix Selection.

[BibT_eX]

[DOI]

S. Muthukrishnan

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Mining Biological Sequences with Masks.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2009

Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

No sorting? better searching!

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

On searching compressed string collections cache-obliviously.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Ankur Gupta

Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007

On the Size of Succinct Indices.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

When indexing equals compression: Experiments with compressing suffix arrays and applications.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Optimal Implicit Dictionaries over Unbounded Universes.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Foreword.

[BibT_eX]

[DOI]

Fabrizio Luccio

Theory Comput. Syst., 2006

Amortized Rigidness in Dynamic Cartesian Trees.

[BibT_eX]

[DOI]

Iwona Bialynicka-Birula

Proceedings of the STACS 2006, 2006

Squeezing succinct data structures into entropy bounds.

[BibT_eX]

[DOI]

Kunihiko Sadakane

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Bases of Motifs for Generating Repeated Patterns with Wild Cards.

[BibT_eX]

[DOI]

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

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms.

[BibT_eX]

[DOI]

Filippo Geraci

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Rank-Sensitive Data Structures.

[BibT_eX]

[DOI]

Iwona Bialynicka-Birula

Proceedings of the String Processing and Information Retrieval, 2005

Optimal In-place Sorting of Vectors and Records.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Implicit B-trees: a new data structure for the dictionary problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

When indexing equals compression: experiments with compressing suffix arrays and applications.

[BibT_eX]

[DOI]

Ankur Gupta

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A General Technique for Managing Strings in Comparison-Driven Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fast Compression with a Static Model in High-Order Entropy.

[BibT_eX]

[DOI]

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

A Trie-Based Approach for Compacting Automata.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Text sparsification via local maxima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Search Data Structures for Skewed Strings.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

High-order entropy-compressed text indexes.

[BibT_eX]

[DOI]

Ankur Gupta

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Optimal Cache-Oblivious Implicit Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Optimal Deterministic Protocols for Mobile Robots on a Grid.

[BibT_eX]

[DOI]

Andrea Pietracaprina

Geppino Pucci

Inf. Comput., 2002

Compressed Indexes for Fast Search in Sequences.

[BibT_eX]

Proceedings of the 6th Joint Conference on Information Science, 2002

Implicit B-Trees: New Results for the Dictionary Problem.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2000

Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices.

[BibT_eX]

[DOI]

J. Complex., 1999

Improved Dynamic Text Indexing.

[BibT_eX]

[DOI]

J. Algorithms, 1999

The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.

[BibT_eX]

[DOI]

J. ACM, 1999

Efficient Splitting and Merging Algorithms for Order Decomposable Problems.

[BibT_eX]

[DOI]

Inf. Comput., 1999

A Fast H.261 Software Codec for High Quality Videoconferencing on PCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

IP Address Lookup Made Fast and Simple.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Leandro Dardini

Proceedings of the Algorithms, 1999

1998

On Updating Suffix Tree Labels.

[BibT_eX]

[DOI]

Manuela Montangero

Theor. Comput. Sci., 1998

Optimal On-Line Search and Sublinear Time Update in String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Simple Planar Graph Partition into Three Forests.

[BibT_eX]

[DOI]

Elena Lodi

Discret. Appl. Math., 1998

Efficient cross-trees for external memory.

[BibT_eX]

[DOI]

Proceedings of the External Memory Algorithms, 1998

1997

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On Sorting Strings in External Memory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Sequence sorting in secondary storage.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

A Note on Updating Suffix Tree Labels.

[BibT_eX]

[DOI]

Manuela Montangero

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Suffix tree data structures for matrices.

[BibT_eX]

Proceedings of the Pattern Matching Algorithms, 1997

1996

On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

A fully-dynamic data structure for external substring search (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Fast Incremental Text Editing.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Multi-Dimensional Pattern Matching with Dimensional Wildcards.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1993

On Finding Commong Subtrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992

A fast VLSI solution for approximate string matching.

[BibT_eX]

[DOI]

Integr., 1992

1991

Further Comments on the Subtree Isomorphism for Ordered Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1989

Simple and Efficient String Matching with k Mismatches.

[BibT_eX]

[DOI]