Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Fast Parallel and Serial Approximate String Matching

- G. Landau, U. Vishkin
- Mathematics, Computer Science
- J. Algorithms
- 1 June 1989

tl;dr

Incremental String Comparison

- G. Landau, E. Myers, J. Schmidt
- Computer Science, Mathematics
- SIAM J. Comput.
- 1 April 1998

The problem of comparing two sequences A and B to determine their longest common subsequence (LCS) or the edit distance between them has been much studied. In this paper we consider the following… Expand

Efficient String Matching with k Mismatches

- G. Landau, U. Vishkin
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 18 February 2018

tl;dr

Random access to grammar-compressed strings

- P. Bille, G. Landau, R. Raman, K. Sadakane, S. S. Rao, Oren Weimann
- Computer Science, Mathematics
- SODA '11
- 11 January 2010

tl;dr

On Cartesian Trees and Range Minimum Queries

- E. Demaine, G. Landau, Oren Weimann
- Mathematics, Computer Science
- Algorithmica
- 1 March 2014

tl;dr

Introducing efficient parallelism into approximate string matching and a new serial algorithm

- G. Landau, U. Vishkin
- Computer Science
- STOC '86
- 1 November 1986

tl;dr

On the Common Substring Alignment Problem

- G. Landau, Michal Ziv-Ukelson
- Computer Science, Mathematics
- J. Algorithms
- 1 November 2001

tl;dr

Tree compression with top trees

- P. Bille, Inge Li Gørtz, G. Landau, Oren Weimann
- Computer Science, Mathematics
- Inf. Comput.
- 21 April 2013

tl;dr

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

- M. Crochemore, G. Landau, Michal Ziv-Ukelson
- Computer Science, Mathematics
- SIAM J. Comput.
- 1 June 2003

tl;dr

An Algorithm for Approximate Tandem Repeats

- G. Landau, J. Schmidt
- Mathematics, Computer Science
- CPM
- 2 June 1993

tl;dr