Gad Landau: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Citation bot (talk | contribs)
Bots
4,932,229 edits
m Alter: chapter, isbn, template type. Add: pmid, isbn, series, volume, citeseerx. Removed parameters. | You can use this bot yourself. Report bugs here. | User-activated.
Removing {{orphan}} per WP:O, article has at least three incoming links from other pages in main space (you can help!); MOS tweaks &c.
Line 1: Line 1:
{{Orphan|date=September 2015}}
{{Use dmy dates|date=March 2019}}
⚫
{{Infobox scientist

⚫
{{ Infobox scientist
| name = Gad M. Landau
| name = Gad M. Landau
| image = Gad M. Landau.jpg
| image = Gad M. Landau.jpg
Line 14: Line 13:
| thesis_year = 1987
| thesis_year = 1987
| fields = [[Theoretical computer science]]
| fields = [[Theoretical computer science]]
| workplaces = [[University of Haifa]]<br>[[NYU Polytechnic School of Engineering]]
| workplaces = [[University of Haifa]]<br />[[NYU Polytechnic School of Engineering]]
| alma_mater = [[Tel-Aviv University]]
| alma_mater = [[Tel-Aviv University]]
| doctoral_advisor = [[Uzi Vishkin]]
| doctoral_advisor = [[Uzi Vishkin]]
| doctoral_students = [[Dina Sokol]]<br>[[Michal Ziv-Ukelson]]<br>[[Danny Hermelin]]
| doctoral_students = [[Dina Sokol]]<br />[[Michal Ziv-Ukelson]]<br />[[Danny Hermelin]]
| known_for = [[k-differences problem]]<br>[[incremental sequence alignment]]
| known_for = [[k-differences problem]]<br />[[incremental sequence alignment]]
}}
}}

'''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 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.


Line 28: Line 28:


== Research ==
== Research ==
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,<ref name="k Mismatches">{{cite journal|last1=Landau|first1=Gad M.|last2=Vishkin|first2=Uzi|title=Efficient String Matching with k Mismatches|journal=Theor. Comput. Sci.|date=1986|volume=43|pages=239–249|doi=10.1016/0304-3975(86)90178-7}}</ref><ref>{{cite book|last1=Gusfield|first1=Dan|title=Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology|date=1997|chapter=Chapter 9: More Applications of Suffix Trees, Chapter 12: Refining Core String Edits and Alignments |publisher=Cambridge University Press|isbn=978-0-521-58519-4}}</ref> solving one of the major open problems in the area at the time. His solution was the first to combine [[suffix tree]]s and [[lowest common ancestor]] queries, and has since inspired many extensions of this technique to other problems.
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,<ref name="k Mismatches">{{cite journal |last1=Landau |first1=Gad M. |last2=Vishkin |first2=Uzi |title=Efficient String Matching with k Mismatches |journal=Theor. Comput. Sci. |year=1986 |volume=43 |pages=239–249 |doi=10.1016/0304-3975(86)90178-7}}</ref><ref>{{cite book |last1=Gusfield |first1=Dan |title=Algorithms on Strings, Trees, and Sequences – Computer Science and Computational Biology |date=1997 |chapter=Chapter 9: More Applications of Suffix Trees, Chapter 12: Refining Core String Edits and Alignments |publisher=Cambridge University Press |isbn=978-0-521-58519-4}}</ref> solving one of the major open problems in the area at the time. His solution was the first to combine [[suffix tree]]s 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]]<ref>{{cite journal|last1=Landau|first1=Gad M.|last2=Vishkin|first2=Uzi|title=Fast String Matching with k Differences|journal=J. Comput. Syst. Sci.|date=1988|volume=37|issue=1|pages=63–78|doi=10.1016/0022-0000(88)90045-1}}</ref> problem, his numerous papers on modeling digitized images and 2D matching,<ref name=digitized>{{cite journal|last1=Landau|first1=Gad M.|last2=Vishkin|first2=Uzi|title=Pattern Matching in a Digitized Image|journal=Algorithmica|date=1994|volume=12|issue=4/5|pages=375–408|doi=10.1007/BF01185433|citeseerx=10.1.1.55.9322}}</ref> incremental sequence alignment,<ref>{{cite journal|last1=Landau|first1=Gad M.|last2=Myers|first2=Eugene W.|last3=Schmidt|first3=Jeanette P.|title=Incremental String Comparison|journal=SIAM J. Comput.|date=1998|volume=27|issue=2|pages=557–582|doi=10.1137/S0097539794264810}}</ref><ref>{{cite journal|last1=Landau|first1=Gad M.|last2=Ziv-Ukelson|first2=Michal|title=On the Common Substring Alignment Problem|journal=J. Algorithms|date=2001|volume=41|issue=2|pages=338–359|doi=10.1006/jagm.2001.1191|citeseerx=10.1.1.149.775}}</ref><ref>{{cite journal|last1=Landau|first1=Gad M.|last2=Schieber|first2=Baruch|last3=Ziv-Ukelson|first3=Michal|title=Sparse LCS Common Substring Alignment Matrices|journal=Inf. Process. Lett.|date=2003|volume=88|issue=6|pages=259–270|doi=10.1016/j.ipl.2003.09.006}}</ref> and recently, his work on jumbled pattern matching<ref>{{cite book|last1=Gagie|first1=Travis|last2=Hermelin|first2=Danny|last3=Landau|first3=Gad M.|last4=Weimann|first4=Oren|title=Binary Jumbled Pattern Matching on Trees and Tree-Like Structures|journal=Algorithms – ESA – 21st Annual European Symposium|volume=8125|date=2013|pages=517–528|doi=10.1007/978-3-642-40450-4_44|arxiv=1301.6127|series=Lecture Notes in Computer Science|isbn=978-3-642-40449-8}}</ref> and compressed text<ref name=comp>{{cite journal|last1=Hermelin|first1=Danny|last2=Landau|first2=Gad M.|last3=Landau|first3=Shir|last4=Weimann|first4=Oren|title=Unified Compression-Based Acceleration of Edit-Distance Computation|journal=Algorithmica|date=2013|volume=65|issue=2|pages=339–353|doi=10.1007/s00453-011-9590-6|arxiv=1004.1194}}</ref><ref>{{cite journal|last1=Crochemore|first1=Maxime|last2=Landau|first2=Gad M.|last3=Ziv-Ukelson|first3=Michal|title=A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices|journal=SIAM J. Comput.|date=2003|volume=32|issue=6|pages=1654–1673|doi=10.1137/S0097539702402007|citeseerx=10.1.1.57.8562}}</ref><ref>{{cite book|last1=Bille|first1=Philip|last2=Gortz|first2=Inge Li|last3=Landau|first3=Gad M.|last4=Weimann|first4=Oren|title=Tree Compression with Top Trees|journal=Automata, Languages, and Programming – 40th International Colloquium, ICALP|volume=7965|date=2013|pages=160–171|doi=10.1007/978-3-642-39206-1_14|arxiv=1304.5702|series=Lecture Notes in Computer Science|isbn=978-3-642-39205-4}}</ref> 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,<ref name=rna>{{cite journal|last1=Backofen|first1=Rolf|last2=Chen|first2=Shihyen|last3=Hermelin|first3=Danny|last4=Landau|first4=Gad M.|last5=Roytberg|first5=Mikhail A.|last6=Weimann|first6=Oren|last7=Zhang|first7=Kaizhong|title=Locality and Gaps in RNA Comparison|journal=Journal of Computational Biology|date=2007|volume=14|issue=8|pages=1074–1087|doi=10.1089/cmb.2007.0062|pmid=17985988|citeseerx=10.1.1.230.7750}}</ref><ref name=rna2>{{cite journal|last1=Amit|first1=Mika|last2=Backofen|first2=Rolf|last3=Heyne|first3=Steffen|last4=Landau|first4=Gad M.|last5=Mohl|first5=Mathias|last6=Otto|first6=Christina|last7=Will|first7=Sebastian|title=Local Exact Pattern Matching for Non-Fixed RNA Structures|journal=IEEE/ACM Trans. Comput. Biology Bioinform.|date=2014|volume=11|issue=1|pages=219–230|doi=10.1109/TCBB.2013.2297113|pmid=26355520|citeseerx=10.1.1.641.139}}</ref> [[clustering (demographics)|clustering]],<ref>{{cite book|last1=Eres|first1=Revital|last2=Landau|first2=Gad M.|last3=Parida|first3=Laxmi|title=A Combinatorial Approach to Automatic Discovery of Cluster-Patterns|journal=Algorithms in Bioinformatics, Third International Workshop, WABI|volume=2812|date=2003|pages=139–150|doi=10.1007/978-3-540-39763-2_11|series=Lecture Notes in Computer Science|isbn=978-3-540-20076-5}}</ref> [[haplotype]] inference,<ref>{{cite journal|last1=Fellows|first1=Michael R.|last2=Hartman|first2=Tzvika|last3=Hermelin|first3=Danny|last4=Landau|first4=Gad M.|last5=Rosamond|first5=Frances A.|last6=Rozenberg|first6=Liat|title=Haplotype Inference Constrained by Plausible Haplotype Data|journal=IEEE/ACM Trans. Comput. Biology Bioinform.|date=2011|volume=8|issue=6|pages=1692–1699|doi=10.1109/TCBB.2010.72|pmid=20733241|citeseerx=10.1.1.502.7164}}</ref> protein [[Protein structure prediction#Secondary structure|secondary structure prediction]],<ref>{{cite journal|last1=Backofen|first1=Rolf|last2=Landau|first2=Gad M.|last3=Mohl|first3=Mathias|last4=Tsur|first4=Dekel|last5=Weimann|first5=Oren|title=Fast RNA structure alignment for crossing input structures|journal=J. Discrete Algorithms|date=2011|volume=9|issue=1|pages=2–11|doi=10.1016/j.jda.2010.07.004}}</ref> and [[tandem repeats]].<ref name="tandem">{{cite journal|last1=Landau|first1=Gad M.|last2=Schmidt|first2=Jeanette P.|last3=Sokol|first3=Dina|title=An Algorithm for Approximate Tandem Repeats|journal=Journal of Computational Biology|date=2001|volume=8|issue=1|pages=1–18|doi=10.1089/106652701300099038|pmid=11339903|citeseerx=10.1.1.24.3741}}</ref>
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]]<ref>{{cite journal |last1=Landau |first1=Gad M. |last2=Vishkin |first2=Uzi |title=Fast String Matching with k Differences |journal=J. Comput. Syst. Sci. |year=1988 |volume=37 |issue=1 |pages=63–78 |doi=10.1016/0022-0000(88)90045-1}}</ref> problem, his numerous papers on modeling digitized images and 2D matching,<ref name="digitized">{{cite journal |last1=Landau |first1=Gad M. |last2=Vishkin |first2=Uzi |title=Pattern Matching in a Digitized Image |journal=Algorithmica |year=1994 |volume=12 |issue=4/5 |pages=375–408 |doi=10.1007/BF01185433 |citeseerx=10.1.1.55.9322}}</ref> incremental sequence alignment,<ref>{{cite journal |last1=Landau |first1=Gad M. |last2=Myers |first2=Eugene W. |last3=Schmidt |first3=Jeanette P. |title=Incremental String Comparison |journal=SIAM J. Comput. |year=1998 |volume=27 |issue=2 |pages=557–582 |doi=10.1137/S0097539794264810}}</ref><ref>{{cite journal |last1=Landau |first1=Gad M. |last2=Ziv-Ukelson |first2=Michal |title=On the Common Substring Alignment Problem |journal=J. Algorithms |year=2001 |volume=41 |issue=2 |pages=338–359 |doi=10.1006/jagm.2001.1191 |citeseerx=10.1.1.149.775}}</ref><ref>{{cite journal |last1=Landau |first1=Gad M. |last2=Schieber |first2=Baruch |last3=Ziv-Ukelson |first3=Michal |title=Sparse LCS Common Substring Alignment Matrices |journal=Inf. Process. Lett. |year=2003 |volume=88 |issue=6 |pages=259–270 |doi=10.1016/j.ipl.2003.09.006}}</ref> and recently, his work on jumbled pattern matching<ref>{{cite book |last1=Gagie |first1=Travis |last2=Hermelin |first2=Danny |last3=Landau |first3=Gad M. |last4=Weimann |first4=Oren |title=Binary Jumbled Pattern Matching on Trees and Tree-Like Structures |journal=Algorithms – ESA – 21st Annual European Symposium |volume=8125 |date=2013 |pages=517–528 |doi=10.1007/978-3-642-40450-4_44 |arxiv=1301.6127 |series=Lecture Notes in Computer Science |isbn=978-3-642-40449-8}}</ref> and compressed text<ref name="comp">{{cite journal |last1=Hermelin |first1=Danny |last2=Landau |first2=Gad M. |last3=Landau |first3=Shir |last4=Weimann |first4=Oren |title=Unified Compression-Based Acceleration of Edit-Distance Computation |journal=Algorithmica |year=2013 |volume=65 |issue=2 |pages=339–353 |doi=10.1007/s00453-011-9590-6 |arxiv=1004.1194}}</ref><ref>{{cite journal |last1=Crochemore |first1=Maxime |last2=Landau |first2=Gad M. |last3=Ziv-Ukelson |first3=Michal |title=A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices |journal=SIAM J. Comput. |year=2003 |volume=32 |issue=6 |pages=1654–1673 |doi=10.1137/S0097539702402007 |citeseerx=10.1.1.57.8562}}</ref><ref>{{cite book |last1=Bille |first1=Philip |last2=Gortz |first2=Inge Li |last3=Landau |first3=Gad M. |last4=Weimann |first4=Oren |title=Tree Compression with Top Trees |journal=Automata, Languages, and Programming – 40th International Colloquium, ICALP |volume=7965 |date=2013 |pages=160–171 |doi=10.1007/978-3-642-39206-1_14 |arxiv=1304.5702 |series=Lecture Notes in Computer Science |isbn=978-3-642-39205-4}}</ref> 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,<ref name="rna">{{cite journal |last1=Backofen |first1=Rolf |last2=Chen |first2=Shihyen |last3=Hermelin |first3=Danny |last4=Landau |first4=Gad M. |last5=Roytberg |first5=Mikhail A. |last6=Weimann |first6=Oren |last7=Zhang |first7=Kaizhong |title=Locality and Gaps in RNA Comparison |journal=Journal of Computational Biology |year=2007 |volume=14 |issue=8 |pages=1074–1087 |doi=10.1089/cmb.2007.0062 |pmid=17985988 |citeseerx=10.1.1.230.7750}}</ref><ref name="rna2">{{cite journal |last1=Amit |first1=Mika |last2=Backofen |first2=Rolf |last3=Heyne |first3=Steffen |last4=Landau |first4=Gad M. |last5=Mohl |first5=Mathias |last6=Otto |first6=Christina |last7=Will |first7=Sebastian |title=Local Exact Pattern Matching for Non-Fixed RNA Structures |journal=IEEE/ACM Trans. Comput. Biology Bioinform. |year=2014 |volume=11 |issue=1 |pages=219–230 |doi=10.1109/TCBB.2013.2297113 |pmid=26355520 |citeseerx=10.1.1.641.139}}</ref> [[clustering (demographics)|clustering]],<ref>{{cite book |last1=Eres |first1=Revital |last2=Landau |first2=Gad M. |last3=Parida |first3=Laxmi |title=A Combinatorial Approach to Automatic Discovery of Cluster-Patterns |journal=Algorithms in Bioinformatics, Third International Workshop, WABI |volume=2812 |date=2003 |pages=139–150 |doi=10.1007/978-3-540-39763-2_11 |series=Lecture Notes in Computer Science |isbn=978-3-540-20076-5}}</ref> [[haplotype]] inference,<ref>{{cite journal |last1=Fellows |first1=Michael R. |last2=Hartman |first2=Tzvika |last3=Hermelin |first3=Danny |last4=Landau |first4=Gad M. |last5=Rosamond |first5=Frances A. |last6=Rozenberg |first6=Liat |title=Haplotype Inference Constrained by Plausible Haplotype Data |journal=IEEE/ACM Trans. Comput. Biology Bioinform. |year=2011 |volume=8 |issue=6 |pages=1692–1699 |doi=10.1109/TCBB.2010.72 |pmid=20733241 |citeseerx=10.1.1.502.7164}}</ref> protein [[Protein structure prediction#Secondary structure|secondary structure prediction]],<ref>{{cite journal |last1=Backofen |first1=Rolf |last2=Landau |first2=Gad M. |last3=Mohl |first3=Mathias |last4=Tsur |first4=Dekel |last5=Weimann |first5=Oren |title=Fast RNA structure alignment for crossing input structures |journal=J. Discrete Algorithms |year=2011 |volume=9 |issue=1 |pages=2–11 |doi=10.1016/j.jda.2010.07.004}}</ref> and [[tandem repeats]].<ref name="tandem">{{cite journal |last1=Landau |first1=Gad M. |last2=Schmidt |first2=Jeanette P. |last3=Sokol |first3=Dina |title=An Algorithm for Approximate Tandem Repeats |journal=Journal of Computational Biology |year=2001 |volume=8 |issue=1 |pages=1–18 |doi=10.1089/106652701300099038 |pmid=11339903 |citeseerx=10.1.1.24.3741}}</ref>


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<ref>{{cite book |editor1-last=Amir |editor1-first=Amihood |editor2-last=Landau |editor2-first=Gad M. |
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<ref>{{cite book |editor1-last=Amir |editor1-first=Amihood |editor2-last=Landau |editor2-first=Gad M. |title=Combinatorial Pattern Matching, 12th Annual Symposium, Proceedings |publisher=Springer |date=2001}}</ref> and 2008.<ref>{{cite book |editor1-last=Ferragina |editor1-first=Paolo |editor2-last=Landau |editor2-first=Gad M. |title=Combinatorial Pattern Matching, 19th Annual Symposium, Proceedings |publisher=Springer |date=2008}}</ref> 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
title=Combinatorial Pattern Matching, 12th Annual Symposium, Proceedings | publisher=Springer | date=2001}}</ref> and 2008.<ref>{{cite book |editor1-last=Ferragina |editor1-first=Paolo |editor2-last=Landau |editor2-first=Gad M. |title=Combinatorial Pattern Matching, 19th Annual Symposium, Proceedings | publisher=Springer | date=2008}}</ref> 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 ([[European Symposium on Algorithms#ALGO conferences|WABI]]), International Workshop on Combinatorial Algorithms (IWOCA), and Brazilian Symposium on Bioinformatics (BSB).
Algorithms and Computation (ISAAC), Annual Symposium on Combinatorial Pattern Matching (CPM), Workshop on Algorithms in Bioinformatics ([[European Symposium on Algorithms#ALGO conferences|WABI]]), International Workshop on Combinatorial Algorithms (IWOCA), and Brazilian Symposium on Bioinformatics (BSB).


== Academic activities ==
== Academic activities ==
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.<ref>http://he.wikipedia.org/w/index.php?title=%D7%A2%D7%99%D7%A8%D7%99%D7%99%D7%AA_%D7%97%D7%99%D7%A4%D7%94&oldid=15964007</ref>
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.<ref>[[:he:Special:PermanentLink/15964007]]</ref>


==References==
== References ==
{{reflist}}
{{reflist}}
<!--- After listing your sources please cite them using inline citations and place them after the information they cite. Please see http://en.wikipedia.org/wiki/Wikipedia:REFB for instructions on how to add citations. --->


==External links==
== External links ==
* [http://cs.haifa.ac.il/LANDAU/landau.html Personal Website]
* [http://cs.haifa.ac.il/LANDAU/landau.html Personal Website]
* {{DBLP |name=Gad M. Landau}}
* {{DBLP |name=Gad M. Landau}}

Revision as of 11:27, 30 March 2019

Gad M. Landau
Gad M. Landau
Born (1954-09-24) 24 September 1954 (age 69)
Israel
NationalityIsrael
Alma materTel-Aviv University
Known fork-differences problem
incremental sequence alignment
Scientific career
FieldsTheoretical computer science
InstitutionsUniversity of Haifa
NYU Polytechnic School of Engineering
Thesis String matching in erroneous input  (1987)
Doctoral advisorUzi Vishkin
Doctoral studentsDina Sokol
Michal Ziv-Ukelson
Danny Hermelin

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.

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

Academic background

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. Throughout his years in New York and Haifa, he has supervised over 20 graduate and post-doctoral students; many of whom are currently active researchers with permanent academic positions.

Research

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 activities

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]

References

  1. ^ Gad M. Landau at DBLP Bibliography Server Edit this at Wikidata
  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 10.1.1.55.9322. doi:10.1007/BF01185433.
  7. ^ Landau, Gad M.; Myers, Eugene W.; Schmidt, Jeanette P. (1998). "Incremental String Comparison". SIAM J. Comput. 27 (2): 557–582. 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 10.1.1.149.775. 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. 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. {{cite book}}: |journal= ignored (help)
  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.
  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 10.1.1.57.8562. doi:10.1137/S0097539702402007.
  13. ^ Bille, Philip; Gortz, Inge Li; Landau, Gad M.; Weimann, Oren (2013). Tree Compression with Top Trees. 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. {{cite book}}: |journal= ignored (help)
  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 10.1.1.230.7750. 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 Trans. Comput. Biology Bioinform. 11 (1): 219–230. CiteSeerX 10.1.1.641.139. doi:10.1109/TCBB.2013.2297113. PMID 26355520.
  16. ^ Eres, Revital; Landau, Gad M.; Parida, Laxmi (2003). A Combinatorial Approach to Automatic Discovery of Cluster-Patterns. 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. {{cite book}}: |journal= ignored (help)
  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 Trans. Comput. Biology Bioinform. 8 (6): 1692–1699. CiteSeerX 10.1.1.502.7164. doi:10.1109/TCBB.2010.72. PMID 20733241.
  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 10.1.1.24.3741. 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 links

Retrieved from "https://en.wikipedia.org/w/index.php?title=Gad_Landau&oldid=890140489"