Gad M. Landau

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 33

Top Venues

Publications

Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981 (2024)
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
Order-Preserving Squares in Strings. CPM (2023)
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
Double String Tandem Repeats. Algorithmica 85 (1) (2023)
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
Order-Preserving Squares in Strings. CoRR (2023)
Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE (2022)
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
Lower Bounds for the Number of Repetitions in 2D Strings. SPIRE (2021)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. Algorithmica 83 (12) (2021)
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
Lower Bounds for the Number of Repetitions in 2D Strings. CoRR (2021)
Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau
On Indeterminate Strings Matching. CPM (2020)
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
Double String Tandem Repeats. CPM (2020)
Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
Two-dimensional maximal repetitions. Theor. Comput. Sci. 812 (2020)
Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845 (2020)
Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. CoRR (2019)
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
Cartesian Tree Matching and Indexing. CoRR (2019)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. ISAAC (2019)
Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
Finding Periods in Cartesian Tree Matching. IWOCA (2019)
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
Cartesian Tree Matching and Indexing. CPM (2019)
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710 (2018)
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
The nearest colored node in a tree. Theor. Comput. Sci. 710 (2018)
Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
Two-Dimensional Maximal Repetitions. ESA (2018)
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
A Faster Construction of Greedy Consensus Trees. ICALP (2018)
Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac
EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. J. Comput. Biol. 25 (11) (2018)
Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya
Fast entropy-bounded string dictionary look-up with mismatches. CoRR (2018)
Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. MFCS (2018)
Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann
A Faster Construction of Phylogenetic Consensus Trees. CoRR (2017)
Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau
String cadences. Theor. Comput. Sci. 698 (2017)
Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol
Locating maximal approximate runs in a string. Theor. Comput. Sci. 700 (2017)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest common extensions in trees. Theor. Comput. Sci. 638 (2016)
Alberto Apostolico, Concettina Guerra, Gad M. Landau, Cinzia Pizzi
Sequence similarity measures based on bounded hamming distance. Theor. Comput. Sci. 638 (2016)
Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau
String Cadences. CoRR (2016)
Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann
The Nearest Colored Node in a Tree. CPM (2016)
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
Period Recovery over the Hamming and Edit Distances. LATIN (2016)
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656 (2016)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562 (2015)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree compression with top trees. Inf. Comput. 243 (2015)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44 (3) (2015)
Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
Range Minimum Query Indexes in Higher Dimensions. CPM (2015)
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32 (2015)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest Common Extensions in Trees. CPM (2015)
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73 (3) (2015)
Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR (2014)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. J. Comput. Syst. Sci. 80 (7) (2014)
Erik D. Demaine, Gad M. Landau, Oren Weimann
On Cartesian Trees and Range Minimum Queries. Algorithmica 68 (3) (2014)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest Common Extensions in Trees. CoRR (2014)
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
Detecting approximate periodic patterns. Theor. Comput. Sci. 525 (2014)
Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Otto, Sebastian Will
Local Exact Pattern Matching for Non-FixedRNA Structures. IEEE ACM Trans. Comput. Biol. Bioinform. 11 (1) (2014)
Christina Otto, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Rolf Backofen, Sebastian Will
ExpaRNA-P: simultaneous exact pattern matching and folding of RNAs. BMC Bioinform. 15 (2014)
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE (2014)
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures CoRR (2013)
Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA (2013)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On approximating string selection problems with outliers. Theor. Comput. Sci. 498 (2013)
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65 (2) (2013)
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM (2013)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree Compression with Top Trees CoRR (2013)
Mika Amit, Maxime Crochemore, Gad M. Landau
Locating All Maximal Approximate Runs in a String. CPM (2013)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree Compression with Top Trees. ICALP (1) (2013)
Christina Schmiedl, Mathias Möhl, Steffen Heyne, Mika Amit, Gad M. Landau, Sebastian Will, Rolf Backofen
Exact Pattern Matching for RNA Structure Ensembles. RECOMB (2012)
Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112 (19) (2012)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On Approximating String Selection Problems with Outliers. CPM (2012)
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
On Approximating String Selection Problems with Outliers CoRR (2012)
Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will
Local Exact Pattern Matching for Non-fixed RNA Structures. CPM (2012)
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
Detecting Approximate Periodic Patterns. MedAlg (2012)
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9 (1) (2011)
Gad M. Landau
Algorithms on Grammar-Compressed Strings. CPM (2011)
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412 (39) (2011)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to grammar-Compressed Strings. SODA (2011)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. ISAAC (2011)
Gad M. Landau, Avivit Levy, Ilan Newman
LCS approximation via embedding into locally non-repetitive strings. Inf. Comput. 209 (4) (2011)
Brona Brejová, Gad M. Landau, Tomás Vinar
Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract). SPIRE (2011)
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
Haplotype Inference Constrained by Plausible Haplotype Data. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (6) (2011)
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
Unified Compression-Based Acceleration of Edit-Distance Computation CoRR (2010)
Philip Bille, Gad M. Landau, Oren Weimann
Random Access to Grammar Compressed Strings CoRR (2010)
Gad M. Landau, Dekel Tsur, Oren Weimann
Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications (2010)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom
A PTAS for the Square Tiling Problem. SPIRE (2010)
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein
Restricted LCS. SPIRE (2010)
Paolo Ferragina, Gad M. Landau
Foreword. Theor. Comput. Sci. 410 (51) (2009)
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression CoRR (2009)
Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
Fast RNA Structure Alignment for Crossing Input Structures. CPM (2009)
Gad M. Landau, Avivit Levy, Ilan Newman
LCS Approximation via Embedding into Local Non-repetitive Strings. CPM (2009)
Erik D. Demaine, Gad M. Landau, Oren Weimann
On Cartesian Trees and Range Minimum Queries. ICALP (1) (2009)
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
Haplotype Inference Constrained by Plausible Haplotype Data. CPM (2009)
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim
Consensus Optimizing Both Distance Sum and Radius. SPIRE (2009)
Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
Interchange rearrangement: The element-cost model. Theor. Comput. Sci. 410 (43) (2009)
Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS (2009)
Gad M. Landau
Approximate Runs - Revisited. SPIRE (2008)
Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park
Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395 (2-3) (2008)
Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395 (2-3) (2008)
Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz
Interchange Rearrangement: The Element-Cost Model. SPIRE (2008)
Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau
Conservative String Covering of Indeterminate Strings. Stringology (2008)
Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang
Locality and Gaps in RNA Comparison. J. Comput. Biol. 14 (8) (2007)
Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
Dynamic text and static pattern matching. ACM Trans. Algorithms 3 (2) (2007)
Gad M. Landau, Dekel Tsur, Oren Weimann
Indexing a Dictionary for Subset Matching Queries. SPIRE (2007)
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
Two algorithms for LCS Consecutive Suffix Alignment. J. Comput. Syst. Sci. 73 (7) (2007)
Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73 (7) (2007)
Gad M. Landau
Can dist tables be merged in linear time - An Open Problem. Stringology (2006)
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM (2006)
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
On the Complexity of Sparse Exon Assembly. J. Comput. Biol. 13 (5) (2006)
Shiri Dori, Gad M. Landau
Construction of Aho Corasick automaton in linear time for integer alphabets. Inf. Process. Lett. 98 (2) (2006)
Gad M. Landau, Laxmi Parida, Oren Weimann
Using PQ Trees for Comparative Genomics. CPM (2005)
Gad M. Landau, Laxmi Parida, Oren Weimann
. J. Comput. Biol. 12 (10) (2005)

Gad M. Landau.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gad M. Landau