Gad Menahem Landau (born 1954) is an Israeli computer scientist noted for his contributions to combinatorial pattern matching and string algorithms and is the founding department chair of the Computer Science Department at the University of Haifa.

Gad M. Landau
Gad M. Landau.jpg
Gad M. Landau
Born (1954-09-24) 24 September 1954 (age 68)
Alma materTel-Aviv University
Known fork-differences problem
incremental sequence alignment
Scientific career
FieldsTheoretical computer science
InstitutionsUniversity of Haifa
NYU Polytechnic School of Engineering
ThesisString matching in erroneous input (1987)
Doctoral advisorUzi Vishkin

He has coauthored over 100 peer-reviewed scientific papers.[1][2]

Academic backgroundEdit

Landau received his Ph.D. in Computer Science from Tel Aviv University in 1987. From 1988 to the present he has held positions as Assistant, Associate, and Research Professor at Polytechnic University in New York (now called NYU Polytechnic School of Engineering, New York University). In 1995, Landau joined the faculty of the University of Haifa, where he founded the Department of Computer Science and was the first department head. In 2006, Landau was promoted to his current position of full Professor at the University of Haifa.


Landau's research interests focus on string algorithms, data structures, computational biology, and parallel computation. He has made several profound contributions to these areas, even in the early days of his scientific career. His Ph.D. thesis, supervised by Prof. Uzi Vishkin, includes the fundamental text-book solution for the k-differences problem,[3][4] solving one of the major open problems in the area at the time. His solution was the first to combine suffix trees and lowest common ancestor queries, and has since inspired many extensions of this technique to other problems.

The footprints of Landau's research can be found in almost every subarea of string algorithms, including his foundational work on dynamic programming algorithms for the edit distance[5] problem, his numerous papers on modeling digitized images and 2D matching,[6] incremental sequence alignment,[7][8][9] and recently, his work on jumbled pattern matching[10] and compressed text[11][12][13] algorithms. He was instrumental in the application of pattern matching techniques to the area of computational biology, working on problems in several diverse areas such as DNA and RNA comparison,[14][15] clustering,[16] haplotype inference,[17] protein secondary structure prediction,[18] and tandem repeats.[19]

Landau's research has been continually funded by the U.S. National Science Foundation, the Israel Science Foundation, and the U.S.-Israel Binational Science Foundation. He received the IBM Faculty award, and was awarded funding from the DFG and Yahoo!. Landau co-chaired the International Symposium on Combinatorial Pattern Matching in both 2001[20] and 2008.[21] He serves on the editorial board of Journal of Discrete Algorithms, and served as a guest editor for TCS and Discrete Applied Mathematics. He has served on numerous program committees for international conferences, most recently, International Conference on Language and Automata Theory and Applications (LATA), International Symposium on String Processing and Information Retrieval (SPIRE), International Symposium on Algorithms and Computation (ISAAC), Annual Symposium on Combinatorial Pattern Matching (CPM), Workshop on Algorithms in Bioinformatics (WABI), International Workshop on Combinatorial Algorithms (IWOCA), and Brazilian Symposium on Bioinformatics (BSB).

Academic activitiesEdit

Landau has been an active member on academic committees, including committees that advise and supervise the academic activity in newly founded computer science departments in Israel. He founded several academic projects at the University of Haifa, most notably the Etgar undergraduate program for highly talented high school students throughout the north of Israel. Apart from these, Landau was also involved in community and civic activities, and served as a member of the Haifa city council from 2008 until 2013.[22]


  1. ^ Gad M. Landau at DBLP Bibliography Server  
  2. ^ Gad Landau publications indexed by Microsoft Academic
  3. ^ Landau, Gad M.; Vishkin, Uzi (1986). "Efficient String Matching with k Mismatches". Theor. Comput. Sci. 43: 239–249. doi:10.1016/0304-3975(86)90178-7.
  4. ^ Gusfield, Dan (1997). "Chapter 9: More Applications of Suffix Trees, Chapter 12: Refining Core String Edits and Alignments". Algorithms on Strings, Trees, and Sequences – Computer Science and Computational Biology. Cambridge University Press. ISBN 978-0-521-58519-4.
  5. ^ Landau, Gad M.; Vishkin, Uzi (1988). "Fast String Matching with k Differences". J. Comput. Syst. Sci. 37 (1): 63–78. doi:10.1016/0022-0000(88)90045-1.
  6. ^ Landau, Gad M.; Vishkin, Uzi (1994). "Pattern Matching in a Digitized Image". Algorithmica. 12 (4/5): 375–408. CiteSeerX doi:10.1007/BF01185433. S2CID 3352884.
  7. ^ Landau, Gad M.; Myers, Eugene W.; Schmidt, Jeanette P. (1998). "Incremental String Comparison". SIAM J. Comput. 27 (2): 557–582. CiteSeerX doi:10.1137/S0097539794264810.
  8. ^ Landau, Gad M.; Ziv-Ukelson, Michal (2001). "On the Common Substring Alignment Problem". J. Algorithms. 41 (2): 338–359. CiteSeerX doi:10.1006/jagm.2001.1191.
  9. ^ Landau, Gad M.; Schieber, Baruch; Ziv-Ukelson, Michal (2003). "Sparse LCS Common Substring Alignment Matrices". Inf. Process. Lett. 88 (6): 259–270. doi:10.1016/j.ipl.2003.09.006.
  10. ^ Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren (2013). Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithms – ESA – 21st Annual European Symposium. Lecture Notes in Computer Science. Vol. 8125. pp. 517–528. arXiv:1301.6127. doi:10.1007/978-3-642-40450-4_44. ISBN 978-3-642-40449-8.
  11. ^ Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren (2013). "Unified Compression-Based Acceleration of Edit-Distance Computation". Algorithmica. 65 (2): 339–353. arXiv:1004.1194. doi:10.1007/s00453-011-9590-6. S2CID 1257530.
  12. ^ Crochemore, Maxime; Landau, Gad M.; Ziv-Ukelson, Michal (2003). "A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices". SIAM J. Comput. 32 (6): 1654–1673. CiteSeerX doi:10.1137/S0097539702402007. S2CID 2661452.
  13. ^ Bille, Philip; Gortz, Inge Li; Landau, Gad M.; Weimann, Oren (2013). Tree Compression with Top Trees. Automata, Languages, and Programming – 40th International Colloquium, ICALP. Lecture Notes in Computer Science. Vol. 7965. pp. 160–171. arXiv:1304.5702. doi:10.1007/978-3-642-39206-1_14. ISBN 978-3-642-39205-4. S2CID 6231735.
  14. ^ Backofen, Rolf; Chen, Shihyen; Hermelin, Danny; Landau, Gad M.; Roytberg, Mikhail A.; Weimann, Oren; Zhang, Kaizhong (2007). "Locality and Gaps in RNA Comparison". Journal of Computational Biology. 14 (8): 1074–1087. CiteSeerX doi:10.1089/cmb.2007.0062. PMID 17985988.
  15. ^ Amit, Mika; Backofen, Rolf; Heyne, Steffen; Landau, Gad M.; Mohl, Mathias; Otto, Christina; Will, Sebastian (2014). "Local Exact Pattern Matching for Non-Fixed RNA Structures". IEEE/ACM Transactions on Computational Biology and Bioinformatics. 11 (1): 219–230. CiteSeerX doi:10.1109/TCBB.2013.2297113. PMID 26355520. S2CID 779878.
  16. ^ Eres, Revital; Landau, Gad M.; Parida, Laxmi (2003). A Combinatorial Approach to Automatic Discovery of Cluster-Patterns. Algorithms in Bioinformatics, Third International Workshop, WABI. Lecture Notes in Computer Science. Vol. 2812. pp. 139–150. doi:10.1007/978-3-540-39763-2_11. ISBN 978-3-540-20076-5.
  17. ^ Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances A.; Rozenberg, Liat (2011). "Haplotype Inference Constrained by Plausible Haplotype Data". IEEE/ACM Transactions on Computational Biology and Bioinformatics. 8 (6): 1692–1699. CiteSeerX doi:10.1109/TCBB.2010.72. PMID 20733241. S2CID 6947773.
  18. ^ Backofen, Rolf; Landau, Gad M.; Mohl, Mathias; Tsur, Dekel; Weimann, Oren (2011). "Fast RNA structure alignment for crossing input structures". J. Discrete Algorithms. 9 (1): 2–11. doi:10.1016/j.jda.2010.07.004.
  19. ^ Landau, Gad M.; Schmidt, Jeanette P.; Sokol, Dina (2001). "An Algorithm for Approximate Tandem Repeats". Journal of Computational Biology. 8 (1): 1–18. CiteSeerX doi:10.1089/106652701300099038. PMID 11339903.
  20. ^ Amir, Amihood; Landau, Gad M., eds. (2001). Combinatorial Pattern Matching, 12th Annual Symposium, Proceedings. Springer.
  21. ^ Ferragina, Paolo; Landau, Gad M., eds. (2008). Combinatorial Pattern Matching, 19th Annual Symposium, Proceedings. Springer.
  22. ^ he:Special:PermanentLink/15964007

External linksEdit