Gad M. Landau

According to our database, Gad M. Landau authored at least 136 papers between 1985 and 2024.

Collaborative distances:

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

2024

Reconstructing parameterized strings from parameterized suffix and LCP arrays.

Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol

Theor. Comput. Sci., January, 2024

2023

Double String Tandem Repeats.

Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol

Algorithmica, 2023

Order-Preserving Squares in Strings.

Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays.

Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol

Proceedings of the String Processing and Information Retrieval, 2022

2021

Top Tree Compression of Tries.

Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Algorithmica, 2021

Lower Bounds for the Number of Repetitions in 2D Strings.

Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau

Proceedings of the String Processing and Information Retrieval, 2021

2020

Finding patterns and periods in Cartesian tree matching.

Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park

Theor. Comput. Sci., 2020

Two-dimensional maximal repetitions.

Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol

Theor. Comput. Sci., 2020

On Indeterminate Strings Matching.

Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Finding Periods in Cartesian Tree Matching.

Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Cartesian Tree Matching and Indexing.

Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

The nearest colored node in a tree.

Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann

Theor. Comput. Sci., 2018

Period recovery of strings over the Hamming and edit distances.

Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol

Theor. Comput. Sci., 2018

EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order.

Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac

J. Comput. Biol., 2018

Fast Entropy-Bounded String Dictionary Look-Up with Mismatches.

Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Faster Construction of Greedy Consensus Trees.

Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Locating maximal approximate runs in a string.

Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol

Theor. Comput. Sci., 2017

String cadences.

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

Theor. Comput. Sci., 2017

A Faster Construction of Phylogenetic Consensus Trees.

Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann

CoRR, 2017

2016

Similarity Between Compressed Strings.

Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park

Encyclopedia of Algorithms, 2016

Longest common extensions in trees.

Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Theor. Comput. Sci., 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

Period Recovery over the Hamming and Edit Distances.

Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol

Proceedings of the LATIN 2016: Theoretical Informatics, 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

Random Access to Grammar-Compressed Strings and Trees.

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann

SIAM J. Comput., 2015

Computing the Burrows-Wheeler transform in place and in small space.

Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau

J. Discrete Algorithms, 2015

Tree compression with top trees.

Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Inf. Comput., 2015

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

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann

Algorithmica, 2015

Range Minimum Query Indexes in Higher Dimensions.

Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Detecting approximate periodic patterns.

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

Theor. Comput. Sci., 2014

Local Exact Pattern Matching for Non-FixedRNA Structures.

Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Otto, Sebastian Will

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

Range LCP.

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

J. Comput. Syst. Sci., 2014

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.

Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann

CoRR, 2014

Longest Common Extensions in Trees.

Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann

CoRR, 2014

ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs.

Christina Otto, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Rolf Backofen, Sebastian Will

BMC Bioinform., 2014

On Cartesian Trees and Range Minimum Queries.

Erik D. Demaine, Gad M. Landau, Oren Weimann

Algorithmica, 2014

2013

On approximating string selection problems with outliers.

Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann

Theor. Comput. Sci., 2013

Unified Compression-Based Acceleration of Edit-Distance Computation.

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

Algorithmica, 2013

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.

Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau

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

Locating All Maximal Approximate Runs in a String.

Mika Amit, Maxime Crochemore, Gad M. Landau

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.

Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein

Inf. Process. Lett., 2012

Exact Pattern Matching for RNA Structure Ensembles.

Christina Schmiedl, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Sebastian Will, Rolf Backofen

Proceedings of the Research in Computational Molecular Biology, 2012

Local Exact Pattern Matching for Non-fixed RNA Structures.

Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Efficient algorithms for consensus string problems minimizing both distance sum and radius.

Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim

Theor. Comput. Sci., 2011

Haplotype Inference Constrained by Plausible Haplotype Data.

Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg

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

Fast RNA structure alignment for crossing input structures.

Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann

J. Discrete Algorithms, 2011

LCS approximation via embedding into locally non-repetitive strings.

Gad M. Landau, Avivit Levy, Ilan Newman

Inf. Comput., 2011

Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract).

Brona Brejová, Gad M. Landau, Tomás Vinar

Proceedings of the String Processing and Information Retrieval, 2011

Random Access to grammar-Compressed Strings.

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Algorithms on Grammar-Compressed Strings.

Gad M. Landau

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Random Access to Grammar Compressed Strings

Philip Bille, Gad M. Landau, Oren Weimann

CoRR, 2010

Restricted LCS.

Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein

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

Indexing a Dictionary for Subset Matching Queries.

Gad M. Landau, Dekel Tsur, Oren Weimann

Proceedings of the Algorithms and Applications, 2010

2009

Interchange rearrangement: The element-cost model.

Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz

Theor. Comput. Sci., 2009

Foreword.

Paolo Ferragina, Gad M. Landau

Theor. Comput. Sci., 2009

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.

Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann

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

Consensus Optimizing Both Distance Sum and Radius.

Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim

Proceedings of the String Processing and Information Retrieval, 2009

LCS Approximation via Embedding into Local Non-repetitive Strings.

Gad M. Landau, Avivit Levy, Ilan Newman

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

2008

Similarity between Compressed Strings.

Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Computing similarity of run-length encoded strings with affine gap penalty.

Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park

Theor. Comput. Sci., 2008

Approximating the 2-interval pattern problem.

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette

Theor. Comput. Sci., 2008

Conservative String Covering of Indeterminate Strings.

Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Approximate Runs - Revisited.

Gad M. Landau

Proceedings of the String Processing and Information Retrieval, 2008

2007

Dynamic text and static pattern matching.

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol

ACM Trans. Algorithms, 2007

Two algorithms for LCS Consecutive Suffix Alignment.

Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson

J. Comput. Syst. Sci., 2007

Optimal spaced seeds for faster approximate string matching.

Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur

J. Comput. Syst. Sci., 2007

Locality and Gaps in RNA Comparison.

Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang

J. Comput. Biol., 2007

2006

On the Complexity of Sparse Exon Assembly.

Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson

J. Comput. Biol., 2006

Construction of Aho Corasick automaton in linear time for integer alphabets.

Shiri Dori, Gad M. Landau

Inf. Process. Lett., 2006

Can dist tables be merged in linear time - An Open Problem.

Gad M. Landau

Proceedings of the Prague Stringology Conference, 2006

Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Gene Proximity Analysis across Whole Genomes via PQ Trees¹.

Gad M. Landau, Laxmi Parida, Oren Weimann

J. Comput. Biol., 2005

Foreword.

Amihood Amir, Gad M. Landau

Discret. Appl. Math., 2005

Sparse Normalized Local Alignment.

Nadav Efraty, Gad M. Landau

Algorithmica, 2005

Approximation algorithm for the cyclic swap problem.

Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed

Proceedings of the Prague Stringology Conference, 2005

Normalized Similarity of RNA Sequences.

Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann

Proceedings of the String Processing and Information Retrieval, 2005

Approximating the 2-Interval Pattern Problem.

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette

Proceedings of the Algorithms, 2005

Using PQ Trees for Comparative Genomics.

Gad M. Landau, Laxmi Parida, Oren Weimann

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

Two-dimensional pattern matching with rotations.

Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps

Theor. Comput. Sci., 2004

Permutation Pattern Discovery in Biosequences.

Revital Eres, Gad M. Landau, Laxmi Parida

J. Comput. Biol., 2004

Scaled and permuted string matching.

Ayelet Butman, Revital Eres, Gad M. Landau

Inf. Process. Lett., 2004

Alphabet Permutation for Differentially Encoding Text.

Gad M. Landau, Ofer Levi, Steven Skiena

Proceedings of the String Processing and Information Retrieval, 2004

Permuted and Scaled String Matching.

Ayelet Butman, Revital Eres, Gad M. Landau

Proceedings of the String Processing and Information Retrieval, 2004

2003

Inplace run-length 2d compressed search.

Amihood Amir, Gad M. Landau, Dina Sokol

Theor. Comput. Sci., 2003

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.

Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson

SIAM J. Comput., 2003

Efficient text fingerprinting via Parikh mapping.

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

J. Discrete Algorithms, 2003

Inplace 2D matching in compressed images.

Amihood Amir, Gad M. Landau, Dina Sokol

J. Algorithms, 2003

Sparse LCS Common Substring Alignment.

Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson

Inf. Process. Lett., 2003

A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.

Revital Eres, Gad M. Landau, Laxmi Parida

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

2002

Edit distance of run-length encoded strings.

Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell

Inf. Process. Lett., 2002

Online timestamped text indexing.

Amihood Amir, Gad M. Landau, Esko Ukkonen

Inf. Process. Lett., 2002

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

Olga G. Troyanskaya, Ora Arbell, Yair Koren, Gad M. Landau, Alexander Bolshoy

Bioinform., 2002

A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.

Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

An Algorithm for Approximate Tandem Repeats.

Gad M. Landau, Jeanette P. Schmidt, Dina Sokol

J. Comput. Biol., 2001

On the Common Substring Alignment Problem.

Gad M. Landau, Michal Ziv-Ukelson

J. Algorithms, 2001

2000

Text Indexing and Dictionary Matching with One Error.

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh

J. Algorithms, 2000

Pattern Matching with Swaps.

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein

J. Algorithms, 2000

On the shared substring alignment problem.

Gad M. Landau, Michal Ziv-Ukelson

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Matching for Run-Length Encoded Strings.

Alberto Apostolico, Gad M. Landau, Steven Skiena

J. Complex., 1999

Indexing and Dictionary Matching with One Error.

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998

Incremental String Comparison.

Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt

SIAM J. Comput., 1998

Efficient Special Cases of Pattern Matching with Swaps.

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein

Inf. Process. Lett., 1998

1997

Approximate string searching.

Gad M. Landau, Uzi Vishkin

Proceedings of the Pattern Matching Algorithms, 1997

1996

Parallel Suffix-Prefix-Matching Algorithm and Applications.

Zvi M. Kedem, Gad M. Landau, Krishna V. Palem

SIAM J. Comput., 1996

1995

Historical Queries Along Multiple Lines of Time Evolution

Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras

VLDB J., 1995

1994

Pattern Matching in a Digitized Image.

Gad M. Landau, Uzi Vishkin

Algorithmica, 1994

1993

Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure.

Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers

Inf. Process. Lett., 1993

Identifying Periodic Occurrences of a Template with Applications to Protein Structure.

Vincent A. Fischetti, Gad M. Landau, Peter H. Sellers, Jeanette P. Schmidt

Inf. Process. Lett., 1993

Efficient Support of Historical Queries for Multiple Lines of Evolution.

Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras

Proceedings of the Ninth International Conference on Data Engineering, 1993

Two Dimensional Pattern Matching in a Digitized Image.

Gad M. Landau, Uzi Vishkin

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

An Algorithm for Approximate Tandem Repeats.

Gad M. Landau, Jeanette P. Schmidt

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

Efficient Pattern Matching with Scaling.

Amihood Amir, Gad M. Landau, Uzi Vishkin

J. Algorithms, 1992

An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.

Dan Gusfield, Gad M. Landau, Baruch Schieber

Inf. Process. Lett., 1992

Identifying Periodic Occurrences of a Template with Applications to Protein Structures.

Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers

Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991

Fast Parallel and Serial Multidimensional Aproximate Array Matching.

Amihood Amir, Gad M. Landau

Theor. Comput. Sci., 1991

Parallel computable contour based feature strings for 2-D shape recognition.

Its'hak Dinstein, Gad M. Landau

Pattern Recognit. Lett., 1991

Parallel (pram erew) algorithms for contour-based 2D shape recognition.

Its'hak Dinstein, Gad M. Landau, Gideon Guy

Pattern Recognit., 1991

1990

The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks

Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung

Inf. Comput., January, 1990

Parallel algorithms for contour extraction and coding on an EREW PRAM computer.

Its'hak Dinstein, Gad M. Landau

Pattern Recognit. Lett., 1990

Using parallel string matching algorithms for contour based 2-D shape recognition.

Its'hak Dinstein, Gad M. Landau

Proceedings of the 10th IAPR International Conference on Pattern Recognition, 1990

1989

Fast Parallel and Serial Approximate String Matching.

Gad M. Landau, Uzi Vishkin

J. Algorithms, 1989

Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.

Zvi M. Kedem, Gad M. Landau, Krishna V. Palem

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

Fast String Matching with k Differences.

Gad M. Landau, Uzi Vishkin

J. Comput. Syst. Sci., 1988

Locating alignments with k differences for nucleotide and amino acid sequences.

Gad M. Landau, Uzi Vishkin, Ruth Nussinov

Comput. Appl. Biosci., 1988

Parallel Construction of a Suffix Tree with Applications.

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

Algorithmica, 1988

The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.

Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987

Distributed Algorithms in Synchronous Broadcasting Networks.

Zvi Galil, Gad M. Landau, Mordechai M. Yung

Theor. Comput. Sci., 1987

Parallel Construction of a Suffix Tree (Extended Abstract).

Gad M. Landau, Baruch Schieber, Uzi Vishkin

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

String matching in erroneous input

Gad M. Landau

PhD thesis, 1986

Efficient String Matching with k Mismatches.

Gad M. Landau, Uzi Vishkin

Theor. Comput. Sci., 1986

An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.

Gad M. Landau, Uzi Vishkin, Ruth Nussinov

Nucleic Acids Res., 1986

Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm

Gad M. Landau, Uzi Vishkin

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract).

Gad M. Landau, Mordechai M. Yung, Zvi Galil

Proceedings of the Automata, 1985

Efficient String Matching in the Presence of Errors

Gad M. Landau, Uzi Vishkin

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985