Gad M. Landau

184 papers A* 16A 4B 38C 16Misc 3Journal 97Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the complexity of indeterminate strings matching.
Theor. Comput. Sci.
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2025 J jnl
Approximate Cartesian Tree Matching with One Difference.
CoRR
Bastien Auvray, Julien David, Samah Ghazawi, Richard Groult, Gad M. Landau, Thierry Lecroq
2025 B conf
Text Indexing for Simple Regular Expressions.
CPM
Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow
2024 J jnl
Reconstructing parameterized strings from parameterized suffix and LCP arrays.
Theor. Comput. Sci.
Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
2023 J jnl
Double String Tandem Repeats.
Algorithmica
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
2023 B conf
Order-Preserving Squares in Strings.
CPM
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2023 J jnl
Order-Preserving Squares in Strings.
CoRR
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2022 C conf
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays.
SPIRE
Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
2021 C conf
Lower Bounds for the Number of Repetitions in 2D Strings.
SPIRE
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2021 J jnl
Lower Bounds for the Number of Repetitions in 2D Strings.
CoRR
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2021 J jnl
Top Tree Compression of Tries.
Algorithmica
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2020 B conf
Double String Tandem Repeats.
CPM
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
2020 J jnl
Finding patterns and periods in Cartesian tree matching.
Theor. Comput. Sci.
Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park
2020 B conf
On Indeterminate Strings Matching.
CPM
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
2020 J jnl
Two-dimensional maximal repetitions.
Theor. Comput. Sci.
Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
2019 B conf
Cartesian Tree Matching and Indexing.
CPM
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
2019 J jnl
Cartesian Tree Matching and Indexing.
CoRR
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
2019 C conf
Finding Periods in Cartesian Tree Matching.
IWOCA
Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
2019 B conf
Top Tree Compression of Tries.
ISAAC
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2019 J jnl
Top Tree Compression of Tries.
CoRR
Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann
2018 A* conf
A Faster Construction of Greedy Consensus Trees.
ICALP
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
2018 J jnl
EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order.
J. Comput. Biol.
Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac
2018 B conf
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches.
MFCS
Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya
2018 J jnl
Fast entropy-bounded string dictionary look-up with mismatches.
CoRR
Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya
2018 J jnl
Period recovery of strings over the Hamming and edit distances.
Theor. Comput. Sci.
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
2018 J jnl
The nearest colored node in a tree.
Theor. Comput. Sci.
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
2018 A conf
Two-Dimensional Maximal Repetitions.
ESA
Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
2017 J jnl
A Faster Construction of Phylogenetic Consensus Trees.
CoRR
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
2017 J jnl
Locating maximal approximate runs in a string.
Theor. Comput. Sci.
Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol
2017 J jnl
String cadences.
Theor. Comput. Sci.
Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau
2016 J jnl
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings.
Theor. Comput. Sci.
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg
2016 J jnl
Longest common extensions in trees.
Theor. Comput. Sci.
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2016 B conf
Period Recovery over the Hamming and Edit Distances.
LATIN
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
2016 J jnl
Sequence similarity measures based on bounded hamming distance.
Theor. Comput. Sci.
Alberto Apostolico, Concettina Guerra, Gad M. Landau, Cinzia Pizzi
2016 — ch.
Similarity Between Compressed Strings.
Encyclopedia of Algorithms
Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park
2016 J jnl
String Cadences.
CoRR
Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau
2016 B conf
The Nearest Colored Node in a Tree.
CPM
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
2015 J jnl
A PTAS for the Square Tiling Problem.
Theor. Comput. Sci.
Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom
2015 J jnl
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
Algorithmica
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2015 J jnl
Computing the Burrows-Wheeler transform in place and in small space.
J. Discrete Algorithms
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
2015 B conf
Longest Common Extensions in Trees.
CPM
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2015 J jnl
Random Access to Grammar-Compressed Strings and Trees.
SIAM J. Comput.
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2015 B conf
Range Minimum Query Indexes in Higher Dimensions.
CPM
Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
2015 J jnl
Tree compression with top trees.
Inf. Comput.
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2014 C conf
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.
SPIRE
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg
2014 J jnl
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.
CoRR
Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann
2014 J jnl
Detecting approximate periodic patterns.
Theor. Comput. Sci.
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
2014 J jnl
ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs.
BMC Bioinform.
Christina Otto, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Rolf Backofen, Sebastian Will
2014 J jnl
Local Exact Pattern Matching for Non-FixedRNA Structures.
IEEE ACM Trans. Comput. Biol. Bioinform.
Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Otto, Sebastian Will
2014 J jnl
Longest Common Extensions in Trees.
CoRR
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2014 J jnl
On Cartesian Trees and Range Minimum Queries.
Algorithmica
Erik D. Demaine, Gad M. Landau, Oren Weimann
2014 J jnl
Range LCP.
J. Comput. Syst. Sci.
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
2013 B conf
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
CPM
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
2013 J jnl
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
CoRR
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013 A conf
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.
ESA
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013 B conf
Locating All Maximal Approximate Runs in a String.
CPM
Mika Amit, Maxime Crochemore, Gad M. Landau
2013 J jnl
On approximating string selection problems with outliers.
Theor. Comput. Sci.
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2013 J jnl
Tree Compression with Top Trees
CoRR
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2013 — conf
Tree Compression with Top Trees.
ICALP (1)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
2013 J jnl
Unified Compression-Based Acceleration of Edit-Distance Computation.
Algorithmica
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2012 J jnl
An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Inf. Process. Lett.
Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein
2012 — conf
Detecting Approximate Periodic Patterns.
MedAlg
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
2012 B conf
Exact Pattern Matching for RNA Structure Ensembles.
RECOMB
Christina Schmiedl, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Sebastian Will, Rolf Backofen
2012 B conf
Local Exact Pattern Matching for Non-fixed RNA Structures.
CPM
Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will
2012 J jnl
On Approximating String Selection Problems with Outliers
CoRR
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2012 B conf
On Approximating String Selection Problems with Outliers.
CPM
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2011 B conf
Algorithms on Grammar-Compressed Strings.
CPM
Gad M. Landau
2011 J jnl
Efficient algorithms for consensus string problems minimizing both distance sum and radius.
Theor. Comput. Sci.
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim
2011 C conf
Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract).
SPIRE
Brona Brejová, Gad M. Landau, Tomás Vinar
2011 J jnl
Fast RNA structure alignment for crossing input structures.
J. Discrete Algorithms
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
2011 J jnl
Haplotype Inference Constrained by Plausible Haplotype Data.
IEEE ACM Trans. Comput. Biol. Bioinform.
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2011 J jnl
LCS approximation via embedding into locally non-repetitive strings.
Inf. Comput.
Gad M. Landau, Avivit Levy, Ilan Newman
2011 A* conf
Random Access to grammar-Compressed Strings.
SODA
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2011 B conf
Range LCP.
ISAAC
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
2010 C conf
A PTAS for the Square Tiling Problem.
SPIRE
Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom
2010 — conf
Indexing a Dictionary for Subset Matching Queries.
Algorithms and Applications
Gad M. Landau, Dekel Tsur, Oren Weimann
2010 J jnl
Random Access to Grammar Compressed Strings
CoRR
Philip Bille, Gad M. Landau, Oren Weimann
2010 C conf
Restricted LCS.
SPIRE
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein
2010 J jnl
Unified Compression-Based Acceleration of Edit-Distance Computation
CoRR
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009 J jnl
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
CoRR
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009 A conf
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.
STACS
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
2009 C conf
Consensus Optimizing Both Distance Sum and Radius.
SPIRE
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim
2009 B conf
Fast RNA Structure Alignment for Crossing Input Structures.
CPM
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
2009 J jnl
Foreword.
Theor. Comput. Sci.
Paolo Ferragina, Gad M. Landau
2009 B conf
Haplotype Inference Constrained by Plausible Haplotype Data.
CPM
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2009 J jnl
Interchange rearrangement: The element-cost model.
Theor. Comput. Sci.
Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
2009 B conf
LCS Approximation via Embedding into Local Non-repetitive Strings.
CPM
Gad M. Landau, Avivit Levy, Ilan Newman
2009 — conf
On Cartesian Trees and Range Minimum Queries.
ICALP (1)
Erik D. Demaine, Gad M. Landau, Oren Weimann
2008 C conf
Approximate Runs - Revisited.
SPIRE
Gad M. Landau
2008 J jnl
Approximating the 2-interval pattern problem.
Theor. Comput. Sci.
Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette
2008 B ed.
Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings
CPM
Paolo Ferragina, Gad M. Landau
2008 J jnl
Computing similarity of run-length encoded strings with affine gap penalty.
Theor. Comput. Sci.
Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park
2008 Misc conf
Conservative String Covering of Indeterminate Strings.
PSC
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau
2008 C conf
Interchange Rearrangement: The Element-Cost Model.
SPIRE
Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
2008 — ch.
Similarity between Compressed Strings.
Encyclopedia of Algorithms
Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park
2007 J jnl
Dynamic text and static pattern matching.
ACM Trans. Algorithms
Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
2007 C conf
Indexing a Dictionary for Subset Matching Queries.
SPIRE
Gad M. Landau, Dekel Tsur, Oren Weimann
2007 J jnl
Locality and Gaps in RNA Comparison.
J. Comput. Biol.
Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang
2007 J jnl
Optimal spaced seeds for faster approximate string matching.
J. Comput. Syst. Sci.
Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
2007 J jnl
Two algorithms for LCS Consecutive Suffix Alignment.
J. Comput. Syst. Sci.
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
2006 Misc conf
Can dist tables be merged in linear time - An Open Problem.
PSC
Gad M. Landau
2006 J jnl
Construction of Aho Corasick automaton in linear time for integer alphabets.
Inf. Process. Lett.
Shiri Dori, Gad M. Landau
2006 B conf
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.
CPM
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
2006 J jnl
On the Complexity of Sparse Exon Assembly.
J. Comput. Biol.
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
2005 A conf
Approximating the 2-Interval Pattern Problem.
ESA
Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
2005 Misc conf
Approximation algorithm for the cyclic swap problem.
PSC
Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed
2005 C conf
Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty.
SPIRE
Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park
2005 B conf
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.
CPM
Shiri Dori, Gad M. Landau
2005 J jnl
Foreword.
Discret. Appl. Math.
Amihood Amir, Gad M. Landau
2005 J jnl
Gene Proximity Analysis across Whole Genomes via PQ Trees
J. Comput. Biol.
Gad M. Landau, Laxmi Parida, Oren Weimann
2005 C conf
Normalized Similarity of RNA Sequences.
SPIRE
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
2005 B conf
On the Complexity of Sparse Exon Assembly.
CPM
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
2005 A* conf
Optimal Spaced Seeds for Faster Approximate String Matching.
ICALP
Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
2005 J jnl
Sparse Normalized Local Alignment.
Algorithmica
Nadav Efraty, Gad M. Landau
2005 B conf
Using PQ Trees for Comparative Genomics.
CPM
Gad M. Landau, Laxmi Parida, Oren Weimann
2004 C conf
Alphabet Permutation for Differentially Encoding Text.
SPIRE
Gad M. Landau, Ofer Levi, Steven Skiena
2004 J jnl
Permutation Pattern Discovery in Biosequences.
J. Comput. Biol.
Revital Eres, Gad M. Landau, Laxmi Parida
2004 C conf
Permuted and Scaled String Matching.
SPIRE
Ayelet Butman, Revital Eres, Gad M. Landau
2004 J jnl
Scaled and permuted string matching.
Inf. Process. Lett.
Ayelet Butman, Revital Eres, Gad M. Landau
2004 B conf
Sparse Normalized Local Alignment.
CPM
Nadav Efraty, Gad M. Landau
2004 B conf
Two Algorithms for LCS Consecutive Suffix Alignment.
CPM
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
2004 J jnl
Two-dimensional pattern matching with rotations.
Theor. Comput. Sci.
Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
2003 C conf
A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.
WABI
Revital Eres, Gad M. Landau, Laxmi Parida
2003 J jnl
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
SIAM J. Comput.
Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson
2003 B conf
Dynamic Text and Static Pattern Matching.
WADS
Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
2003 J jnl
Efficient text fingerprinting via Parikh mapping.
J. Discrete Algorithms
Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta
2003 A* conf
Inplace 2D matching in compressed images.
SODA
Amihood Amir, Gad M. Landau, Dina Sokol
2003 J jnl
Inplace 2D matching in compressed images.
J. Algorithms
Amihood Amir, Gad M. Landau, Dina Sokol
2003 J jnl
Inplace run-length 2d compressed search.
Theor. Comput. Sci.
Amihood Amir, Gad M. Landau, Dina Sokol
2003 B conf
Sparse LCS Common Substring Alignment.
CPM
Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
2003 J jnl
Sparse LCS Common Substring Alignment.
Inf. Process. Lett.
Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
2003 B conf
Two-Dimensional Pattern Matching with Rotations.
CPM
Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
2002 A* conf
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.
SODA
Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson
2002 J jnl
Edit distance of run-length encoded strings.
Inf. Process. Lett.
Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell
2002 J jnl
Online timestamped text indexing.
Inf. Process. Lett.
Amihood Amir, Gad M. Landau, Esko Ukkonen
2002 J jnl
Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity.
Bioinform.
Olga G. Troyanskaya, Ora Arbell, Yair Koren, Gad M. Landau, Alexander Bolshoy
2001 J jnl
An Algorithm for Approximate Tandem Repeats.
J. Comput. Biol.
Gad M. Landau, Jeanette P. Schmidt, Dina Sokol
2001 B ed.
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
CPM
Amihood Amir, Gad M. Landau
2001 J jnl
On the Common Substring Alignment Problem.
J. Algorithms
Gad M. Landau, Michal Ziv-Ukelson
2000 A* conf
Inplace run-length 2d compressed search.
SODA
Amihood Amir, Gad M. Landau, Dina Sokol
2000 A* conf
On the shared substring alignment problem.
SODA
Gad M. Landau, Michal Ziv-Ukelson
2000 J jnl
Pattern Matching with Swaps.
J. Algorithms
Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
2000 J jnl
Text Indexing and Dictionary Matching with One Error.
J. Algorithms
Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
1999 B conf
Indexing and Dictionary Matching with One Error.
WADS
Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
1999 J jnl
Matching for Run-Length Encoded Strings.
J. Complex.
Alberto Apostolico, Gad M. Landau, Steven Skiena
1998 B conf
Efficient Special Cases of Pattern Matching with Swaps.
CPM
Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
1998 J jnl
Efficient Special Cases of Pattern Matching with Swaps.
Inf. Process. Lett.
Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
1998 J jnl
Incremental String Comparison.
SIAM J. Comput.
Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt
1997 — ch.
Approximate string searching.
Pattern Matching Algorithms
Gad M. Landau, Uzi Vishkin
1997 — conf
Matching for run-length encoded strings.
SEQUENCES
Alberto Apostolico, Gad M. Landau, Steven Skiena
1997 A* conf
Pattern Matching with Swaps.
FOCS
Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
1996 J jnl
Parallel Suffix-Prefix-Matching Algorithm and Applications.
SIAM J. Comput.
Zvi M. Kedem, Gad M. Landau, Krishna V. Palem
1995 J jnl
Historical Queries Along Multiple Lines of Time Evolution
VLDB J.
Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras
1994 J jnl
Pattern Matching in a Digitized Image.
Algorithmica
Gad M. Landau, Uzi Vishkin
1993 B conf
An Algorithm for Approximate Tandem Repeats.
CPM
Gad M. Landau, Jeanette P. Schmidt
1993 J jnl
Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure.
Inf. Process. Lett.
Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
1993 A* conf
Efficient Support of Historical Queries for Multiple Lines of Evolution.
ICDE
Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras
1993 J jnl
Identifying Periodic Occurrences of a Template with Applications to Protein Structure.
Inf. Process. Lett.
Vincent A. Fischetti, Gad M. Landau, Peter H. Sellers, Jeanette P. Schmidt
1993 B conf
Two Dimensional Pattern Matching in a Digitized Image.
CPM
Gad M. Landau, Uzi Vishkin
1992 J jnl
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.
Inf. Process. Lett.
Dan Gusfield, Gad M. Landau, Baruch Schieber
1992 J jnl
Efficient Pattern Matching with Scaling.
J. Algorithms
Amihood Amir, Gad M. Landau, Uzi Vishkin
1992 B conf
Identifying Periodic Occurrences of a Template with Applications to Protein Structures.
CPM
Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
1992 A* conf
Pattern Matching in a Digitized Image.
SODA
Gad M. Landau, Uzi Vishkin
1991 J jnl
Fast Parallel and Serial Multidimensional Aproximate Array Matching.
Theor. Comput. Sci.
Amihood Amir, Gad M. Landau
1991 J jnl
Parallel (pram erew) algorithms for contour-based 2D shape recognition.
Pattern Recognit.
Its'hak Dinstein, Gad M. Landau, Gideon Guy
1991 J jnl
Parallel computable contour based feature strings for 2-D shape recognition.
Pattern Recognit. Lett.
Its'hak Dinstein, Gad M. Landau
1990 A* conf
Efficient Pattern Matching with Scaling.
SODA
Amihood Amir, Gad M. Landau, Uzi Vishkin
1990 J jnl
Parallel algorithms for contour extraction and coding on an EREW PRAM computer.
Pattern Recognit. Lett.
Its'hak Dinstein, Gad M. Landau
1990 J jnl
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Inf. Comput.
Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung
1990 — conf
Using parallel string matching algorithms for contour based 2-D shape recognition.
ICPR (2)
Its'hak Dinstein, Gad M. Landau
1989 J jnl
Fast Parallel and Serial Approximate String Matching.
J. Algorithms
Gad M. Landau, Uzi Vishkin
1989 B conf
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.
SPAA
Zvi M. Kedem, Gad M. Landau, Krishna V. Palem
1988 J jnl
Fast String Matching with k Differences.
J. Comput. Syst. Sci.
Gad M. Landau, Uzi Vishkin
1988 J jnl
Locating alignments with k differences for nucleotide and amino acid sequences.
Comput. Appl. Biosci.
Gad M. Landau, Uzi Vishkin, Ruth Nussinov
1988 J jnl
Parallel Construction of a Suffix Tree with Applications.
Algorithmica
Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
1988 A* conf
The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.
PODC
Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung
1987 J jnl
Distributed Algorithms in Synchronous Broadcasting Networks.
Theor. Comput. Sci.
Zvi Galil, Gad M. Landau, Mordechai M. Yung
1987 A* conf
Parallel Construction of a Suffix Tree (Extended Abstract).
ICALP
Gad M. Landau, Baruch Schieber, Uzi Vishkin
1986 J jnl
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
Nucleic Acids Res.
Gad M. Landau, Uzi Vishkin, Ruth Nussinov
1986 J jnl
Efficient String Matching with k Mismatches.
Theor. Comput. Sci.
Gad M. Landau, Uzi Vishkin
1986 A* conf
Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm
STOC
Gad M. Landau, Uzi Vishkin
1986 — —
String matching in erroneous input
Gad M. Landau
1985 A* conf
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract).
ICALP
Gad M. Landau, Mordechai M. Yung, Zvi Galil
1985 A* conf
Efficient String Matching in the Presence of Errors
FOCS
Gad M. Landau, Uzi Vishkin