Gad M. Landau

According to our database1, Gad M. Landau authored at least 158 papers between 1985 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
The nearest colored node in a tree.
Theor. Comput. Sci., 2018

Period recovery of strings over the Hamming and edit distances.
Theor. Comput. Sci., 2018

Fast entropy-bounded string dictionary look-up with mismatches.
CoRR, 2018

Fast Entropy-Bounded String Dictionary Look-Up with Mismatches.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Faster Construction of Greedy Consensus Trees.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Two-Dimensional Maximal Repetitions.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Locating maximal approximate runs in a string.
Theor. Comput. Sci., 2017

String cadences.
Theor. Comput. Sci., 2017

A Faster Construction of Phylogenetic Consensus Trees.
CoRR, 2017

2016
Similarity Between Compressed Strings.
Encyclopedia of Algorithms, 2016

Longest common extensions in trees.
Theor. Comput. Sci., 2016

Sequence similarity measures based on bounded hamming distance.
Theor. Comput. Sci., 2016

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings.
Theor. Comput. Sci., 2016

String Cadences.
CoRR, 2016

Period Recovery over the Hamming and Edit Distances.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

The Nearest Colored Node in a Tree.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
A PTAS for the Square Tiling Problem.
Theor. Comput. Sci., 2015

Random Access to Grammar-Compressed Strings and Trees.
SIAM J. Comput., 2015

Computing the Burrows-Wheeler transform in place and in small space.
J. Discrete Algorithms, 2015

Tree compression with top trees.
Inf. Comput., 2015

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
Algorithmica, 2015

Range Minimum Query Indexes in Higher Dimensions.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Longest Common Extensions in Trees.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Detecting approximate periodic patterns.
Theor. Comput. Sci., 2014

Local Exact Pattern Matching for Non-FixedRNA Structures.
IEEE/ACM Trans. Comput. Biology Bioinform., 2014

Range LCP.
J. Comput. Syst. Sci., 2014

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.
CoRR, 2014

Longest Common Extensions in Trees.
CoRR, 2014

ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs.
BMC Bioinformatics, 2014

On Cartesian Trees and Range Minimum Queries.
Algorithmica, 2014

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.
Proceedings of the String Processing and Information Retrieval, 2014

2013
On approximating string selection problems with outliers.
Theor. Comput. Sci., 2013

Tree Compression with Top Trees
CoRR, 2013

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
CoRR, 2013

Unified Compression-Based Acceleration of Edit-Distance Computation.
Algorithmica, 2013

Tree Compression with Top Trees.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
Proceedings of the Algorithms - ESA 2013, 2013

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Locating All Maximal Approximate Runs in a String.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Inf. Process. Lett., 2012

On Approximating String Selection Problems with Outliers
CoRR, 2012

Exact Pattern Matching for RNA Structure Ensembles.
Proceedings of the Research in Computational Molecular Biology, 2012

Detecting Approximate Periodic Patterns.
Proceedings of the Design and Analysis of Algorithms, 2012

On Approximating String Selection Problems with Outliers.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Local Exact Pattern Matching for Non-fixed RNA Structures.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Efficient algorithms for consensus string problems minimizing both distance sum and radius.
Theor. Comput. Sci., 2011

Haplotype Inference Constrained by Plausible Haplotype Data.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Fast RNA structure alignment for crossing input structures.
J. Discrete Algorithms, 2011

LCS approximation via embedding into locally non-repetitive strings.
Inf. Comput., 2011

Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract).
Proceedings of the String Processing and Information Retrieval, 2011

Random Access to grammar-Compressed Strings.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Range LCP.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Algorithms on Grammar-Compressed Strings.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
Unified Compression-Based Acceleration of Edit-Distance Computation
CoRR, 2010

Random Access to Grammar Compressed Strings
CoRR, 2010

Restricted LCS.
Proceedings of the String Processing and Information Retrieval, 2010

A PTAS for the Square Tiling Problem.
Proceedings of the String Processing and Information Retrieval, 2010

Indexing a Dictionary for Subset Matching Queries.
Proceedings of the Algorithms and Applications, 2010

2009
Interchange rearrangement: The element-cost model.
Theor. Comput. Sci., 2009

Foreword.
Theor. Comput. Sci., 2009

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
CoRR, 2009

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Consensus Optimizing Both Distance Sum and Radius.
Proceedings of the String Processing and Information Retrieval, 2009

On Cartesian Trees and Range Minimum Queries.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

LCS Approximation via Embedding into Local Non-repetitive Strings.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Haplotype Inference Constrained by Plausible Haplotype Data.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Fast RNA Structure Alignment for Crossing Input Structures.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Similarity between Compressed Strings.
Proceedings of the Encyclopedia of Algorithms, 2008

Computing similarity of run-length encoded strings with affine gap penalty.
Theor. Comput. Sci., 2008

Approximating the 2-interval pattern problem.
Theor. Comput. Sci., 2008

Conservative String Covering of Indeterminate Strings.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Approximate Runs - Revisited.
Proceedings of the String Processing and Information Retrieval, 2008

Interchange Rearrangement: The Element-Cost Model.
Proceedings of the String Processing and Information Retrieval, 2008

2007
Dynamic text and static pattern matching.
ACM Trans. Algorithms, 2007

Two algorithms for LCS Consecutive Suffix Alignment.
J. Comput. Syst. Sci., 2007

Optimal spaced seeds for faster approximate string matching.
J. Comput. Syst. Sci., 2007

Locality and Gaps in RNA Comparison.
Journal of Computational Biology, 2007

Indexing a Dictionary for Subset Matching Queries.
Proceedings of the String Processing and Information Retrieval, 2007

2006
On the Complexity of Sparse Exon Assembly.
Journal of Computational Biology, 2006

Construction of Aho Corasick automaton in linear time for integer alphabets.
Inf. Process. Lett., 2006

Can dist tables be merged in linear time - An Open Problem.
Proceedings of the Prague Stringology Conference, 2006

Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Gene Proximity Analysis across Whole Genomes via PQ Trees1.
Journal of Computational Biology, 2005

Foreword.
Discrete Applied Mathematics, 2005

Sparse Normalized Local Alignment.
Algorithmica, 2005

Approximation algorithm for the cyclic swap problem.
Proceedings of the Prague Stringology Conference, 2005

Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty.
Proceedings of the String Processing and Information Retrieval, 2005

Normalized Similarity of RNA Sequences.
Proceedings of the String Processing and Information Retrieval, 2005

Optimal Spaced Seeds for Faster Approximate String Matching.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Approximating the 2-Interval Pattern Problem.
Proceedings of the Algorithms, 2005

Using PQ Trees for Comparative Genomics.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

On the Complexity of Sparse Exon Assembly.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Two-dimensional pattern matching with rotations.
Theor. Comput. Sci., 2004

Permutation Pattern Discovery in Biosequences.
Journal of Computational Biology, 2004

Scaled and permuted string matching.
Inf. Process. Lett., 2004

Alphabet Permutation for Differentially Encoding Text.
Proceedings of the String Processing and Information Retrieval, 2004

Permuted and Scaled String Matching.
Proceedings of the String Processing and Information Retrieval, 2004

Two Algorithms for LCS Consecutive Suffix Alignment.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Sparse Normalized Local Alignment.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Inplace run-length 2d compressed search.
Theor. Comput. Sci., 2003

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
SIAM J. Comput., 2003

Efficient text fingerprinting via Parikh mapping.
J. Discrete Algorithms, 2003

Inplace 2D matching in compressed images.
J. Algorithms, 2003

Sparse LCS Common Substring Alignment.
Inf. Process. Lett., 2003

Dynamic Text and Static Pattern Matching.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Inplace 2D matching in compressed images.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Sparse LCS Common Substring Alignment.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

Two-Dimensional Pattern Matching with Rotations.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
Edit distance of run-length encoded strings.
Inf. Process. Lett., 2002

Online timestamped text indexing.
Inf. Process. Lett., 2002

Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity.
Bioinformatics, 2002

A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
An Algorithm for Approximate Tandem Repeats.
Journal of Computational Biology, 2001

On the Common Substring Alignment Problem.
J. Algorithms, 2001

2000
Text Indexing and Dictionary Matching with One Error.
J. Algorithms, 2000

Pattern Matching with Swaps.
J. Algorithms, 2000

On the shared substring alignment problem.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Inplace run-length 2d compressed search.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Matching for Run-Length Encoded Strings.
J. Complexity, 1999

Indexing and Dictionary Matching with One Error.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Incremental String Comparison.
SIAM J. Comput., 1998

Efficient Special Cases of Pattern Matching with Swaps.
Inf. Process. Lett., 1998

Efficient Special Cases of Pattern Matching with Swaps.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Pattern Matching with Swaps.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Approximate string searching.
Proceedings of the Pattern Matching Algorithms, 1997

1996
Parallel Suffix-Prefix-Matching Algorithm and Applications.
SIAM J. Comput., 1996

1995
Historical Queries Along Multiple Lines of Time Evolution
VLDB J., 1995

1994
Pattern Matching in a Digitized Image.
Algorithmica, 1994

1993
Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure.
Inf. Process. Lett., 1993

Identifying Periodic Occurrences of a Template with Applications to Protein Structure.
Inf. Process. Lett., 1993

Efficient Support of Historical Queries for Multiple Lines of Evolution.
Proceedings of the Ninth International Conference on Data Engineering, 1993

Two Dimensional Pattern Matching in a Digitized Image.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

An Algorithm for Approximate Tandem Repeats.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992
Efficient Pattern Matching with Scaling.
J. Algorithms, 1992

An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.
Inf. Process. Lett., 1992

Pattern Matching in a Digitized Image.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Identifying Periodic Occurrences of a Template with Applications to Protein Structures.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991
Fast Parallel and Serial Multidimensional Aproximate Array Matching.
Theor. Comput. Sci., 1991

Parallel computable contour based feature strings for 2-D shape recognition.
Pattern Recognition Letters, 1991

Parallel (pram erew) algorithms for contour-based 2D shape recognition.
Pattern Recognition, 1991

1990
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Inf. Comput., January, 1990

Parallel algorithms for contour extraction and coding on an EREW PRAM computer.
Pattern Recognition Letters, 1990

Efficient Pattern Matching with Scaling.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Fast Parallel and Serial Approximate String Matching.
J. Algorithms, 1989

Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.
SPAA, 1989

1988
Fast String Matching with k Differences.
J. Comput. Syst. Sci., 1988

Locating alignments with k differences for nucleotide and amino acid sequences.
Computer Applications in the Biosciences, 1988

Parallel Construction of a Suffix Tree with Applications.
Algorithmica, 1988

The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987
Distributed Algorithms in Synchronous Broadcasting Networks.
Theor. Comput. Sci., 1987

Parallel Construction of a Suffix Tree (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Efficient String Matching with k Mismatches.
Theor. Comput. Sci., 1986

An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
Nucleic Acids Research, 1986

Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract).
Proceedings of the Automata, 1985

Efficient String Matching in the Presence of Errors
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985


  Loading...