401:. Landau co-chaired the International Symposium on Combinatorial Pattern Matching in both 2001 and 2008. 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 (
1205:
444:
187:
33:
357:
problem, his numerous papers on modeling digitized images and 2D matching, incremental sequence alignment, and recently, his work on jumbled pattern matching and compressed text algorithms. He was instrumental in the application of pattern matching techniques to the area of
418:, 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.
413:
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
306:, 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.
170:
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.
1015:
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances A.; Rozenberg, Liat (2011). "Haplotype
Inference Constrained by Plausible Haplotype Data".
334:, includes the fundamental text-book solution for the k-differences problem, solving one of the major open problems in the area at the time. His solution was the first to combine
929:
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".
1234:
884:
Backofen, Rolf; Chen, Shihyen; Hermelin, Danny; Landau, Gad M.; Roytberg, Mikhail A.; Weimann, Oren; Zhang, Kaizhong (2007). "Locality and Gaps in RNA Comparison".
298:
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
195:
330:. 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.
788:
Crochemore, Maxime; Landau, Gad M.; Ziv-Ukelson, Michal (2003). "A Subquadratic
Sequence Alignment Algorithm for Unrestricted Scoring Matrices".
999:
860:
727:
507:
299:
123:
743:
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren (2013). "Unified
Compression-Based Acceleration of Edit-Distance Computation".
700:
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren (2013). "Binary
Jumbled Pattern Matching on Trees and Tree-Like Structures".
1244:
1229:
277:
402:
498:
Gusfield, Dan (1997). "Chapter 9: More
Applications of Suffix Trees, Chapter 12: Refining Core String Edits and Alignments".
982:
Eres, Revital; Landau, Gad M.; Parida, Laxmi (2003). "A Combinatorial
Approach to Automatic Discovery of Cluster-Patterns".
258:
211:
379:
109:
230:
390:
1175:
200:
92:
237:
204:
371:
405:), International Workshop on Combinatorial Algorithms (IWOCA), and Brazilian Symposium on Bioinformatics (BSB).
244:
88:
1239:
1110:
1024:
938:
893:
797:
641:
604:
559:
339:
1101:
Landau, Gad M.; Schmidt, Jeanette P.; Sokol, Dina (2001). "An
Algorithm for Approximate Tandem Repeats".
833:
Bille, Philip; Gortz, Inge Li; Landau, Gad M.; Weimann, Oren (2013). "Tree Compression with Top Trees".
359:
323:
226:
1249:
327:
1029:
898:
393:, the Israel Science Foundation, and the U.S.-Israel Binational Science Foundation. He received the
1115:
943:
802:
646:
609:
564:
415:
350:
303:
295:
119:
78:
1050:
964:
866:
838:
815:
770:
752:
705:
577:
167:
595:
Landau, Gad M.; Myers, Eugene W.; Schmidt, Jeanette P. (1998). "Incremental String Comparison".
1128:
1042:
995:
956:
911:
856:
723:
503:
346:
315:
1120:
1081:
1034:
987:
948:
903:
848:
807:
762:
715:
682:
651:
614:
569:
532:
480:
291:
146:
1214:
1204:
670:
459:
443:
319:
632:
Landau, Gad M.; Ziv-Ukelson, Michal (2001). "On the Common Substring Alignment Problem".
500:
Algorithms on Strings, Trees, and Sequences – Computer Science and Computational Biology
251:
383:
1223:
536:
484:
354:
342:
queries, and has since inspired many extensions of this technique to other problems.
471:
Landau, Gad M.; Vishkin, Uzi (1986). "Efficient String Matching with k Mismatches".
1210:
1054:
870:
819:
774:
581:
455:
1068:
Backofen, Rolf; Landau, Gad M.; Mohl, Mathias; Tsur, Dekel; Weimann, Oren (2011).
968:
991:
852:
719:
673:; Ziv-Ukelson, Michal (2003). "Sparse LCS Common Substring Alignment Matrices".
523:
Landau, Gad M.; Vishkin, Uzi (1988). "Fast String Matching with k Differences".
335:
331:
151:
1124:
214:. Contentious material about living people that is unsourced or poorly sourced
1086:
1069:
952:
811:
766:
686:
618:
550:
Landau, Gad M.; Vishkin, Uzi (1994). "Pattern Matching in a Digitized Image".
375:
345:
The footprints of Landau's research can be found in almost every subarea of
1190:
1132:
1046:
960:
915:
655:
32:
907:
1038:
986:. Lecture Notes in Computer Science. Vol. 2812. pp. 139–150.
837:. Lecture Notes in Computer Science. Vol. 7965. pp. 160–171.
704:. Lecture Notes in Computer Science. Vol. 8125. pp. 517–528.
573:
398:
130:
59:
1195:
434:
1163:
Combinatorial Pattern Matching, 19th Annual Symposium, Proceedings
1148:
Combinatorial Pattern Matching, 12th Annual Symposium, Proceedings
843:
757:
710:
302:, New York University). In 1995, Landau joined the faculty of the
1017:
IEEE/ACM Transactions on Computational Biology and Bioinformatics
931:
IEEE/ACM Transactions on Computational Biology and Bioinformatics
1199:
438:
394:
367:
363:
180:
1070:"Fast RNA structure alignment for crossing input structures"
173:
He has coauthored over 100 peer-reviewed scientific papers.
389:
Landau's research has been continually funded by the U.S.
397:
Faculty award, and was awarded funding from the DFG and
362:, working on problems in several diverse areas such as
145:
129:
115:
105:
84:
74:
66:
42:
23:
1161:Ferragina, Paolo; Landau, Gad M., eds. (2008).
8:
1146:Amir, Amihood; Landau, Gad M., eds. (2001).
1203:
442:
20:
1235:Academic staff of the University of Haifa
1114:
1085:
1028:
942:
897:
842:
801:
756:
709:
645:
608:
563:
278:Learn how and when to remove this message
427:
349:, including his foundational work on
314:Landau's research interests focus on
300:NYU Polytechnic School of Engineering
124:NYU Polytechnic School of Engineering
7:
835:Automata, Languages, and Programming
136:String matching in erroneous input
14:
1176:he:Special:PermanentLink/15964007
1103:Journal of Computational Biology
886:Journal of Computational Biology
185:
31:
502:. Cambridge University Press.
380:secondary structure prediction
93:incremental sequence alignment
1:
290:Landau received his Ph.D. in
992:10.1007/978-3-540-39763-2_11
984:Algorithms in Bioinformatics
853:10.1007/978-3-642-39206-1_14
720:10.1007/978-3-642-40450-4_44
537:10.1016/0022-0000(88)90045-1
485:10.1016/0304-3975(86)90178-7
196:biography of a living person
110:Theoretical computer science
391:National Science Foundation
216:must be removed immediately
1266:
1245:Tel Aviv University alumni
1125:10.1089/106652701300099038
166:(born 1954) is an Israeli
16:Israeli computer scientist
1230:Israeli bioinformaticians
1087:10.1016/j.jda.2010.07.004
953:10.1109/TCBB.2013.2297113
812:10.1137/S0097539702402007
767:10.1007/s00453-011-9590-6
687:10.1016/j.ipl.2003.09.006
619:10.1137/S0097539794264810
157:
98:
30:
1213:publications indexed by
458:publications indexed by
1074:J. Discrete Algorithms
656:10.1006/jagm.2001.1191
340:lowest common ancestor
210:Please help by adding
908:10.1089/cmb.2007.0062
702:Algorithms – ESA 2013
360:computational biology
324:computational biology
205:references or sources
89:k-differences problem
1202:Bibliography Server
1039:10.1109/TCBB.2010.72
525:J. Comput. Syst. Sci
441:Bibliography Server
328:parallel computation
416:University of Haifa
409:Academic activities
378:inference, protein
353:algorithms for the
351:dynamic programming
304:University of Haifa
296:Tel Aviv University
177:Academic background
120:University of Haifa
79:Tel-Aviv University
1215:Microsoft Academic
675:Inf. Process. Lett
574:10.1007/BF01185433
473:Theor. Comput. Sci
460:Microsoft Academic
194:This section of a
168:computer scientist
164:Gad Menahem Landau
1001:978-3-540-20076-5
862:978-3-642-39205-4
729:978-3-642-40449-8
509:978-0-521-58519-4
347:string algorithms
316:string algorithms
288:
287:
280:
262:
161:
160:
100:Scientific career
53:24 September 1954
1257:
1207:
1191:Personal Website
1178:
1173:
1167:
1166:
1158:
1152:
1151:
1143:
1137:
1136:
1118:
1098:
1092:
1091:
1089:
1065:
1059:
1058:
1032:
1023:(6): 1692–1699.
1012:
1006:
1005:
979:
973:
972:
946:
926:
920:
919:
901:
892:(8): 1074–1087.
881:
875:
874:
846:
830:
824:
823:
805:
796:(6): 1654–1673.
785:
779:
778:
760:
740:
734:
733:
713:
697:
691:
690:
671:Schieber, Baruch
669:Landau, Gad M.;
666:
660:
659:
649:
629:
623:
622:
612:
592:
586:
585:
567:
558:(4/5): 375–408.
547:
541:
540:
520:
514:
513:
495:
489:
488:
468:
462:
453:
447:
446:
432:
292:Computer Science
283:
276:
272:
269:
263:
261:
220:
212:reliable sources
189:
188:
181:
147:Doctoral advisor
141:
56:
52:
50:
35:
21:
1265:
1264:
1260:
1259:
1258:
1256:
1255:
1254:
1220:
1219:
1187:
1182:
1181:
1174:
1170:
1160:
1159:
1155:
1145:
1144:
1140:
1100:
1099:
1095:
1067:
1066:
1062:
1030:10.1.1.502.7164
1014:
1013:
1009:
1002:
981:
980:
976:
928:
927:
923:
899:10.1.1.230.7750
883:
882:
878:
863:
832:
831:
827:
787:
786:
782:
742:
741:
737:
730:
699:
698:
694:
668:
667:
663:
631:
630:
626:
594:
593:
589:
549:
548:
544:
522:
521:
517:
510:
497:
496:
492:
470:
469:
465:
454:
450:
433:
429:
424:
411:
320:data structures
312:
284:
273:
267:
264:
221:
219:
209:
190:
186:
179:
139:
122:
91:
75:Alma mater
62:
57:
54:
48:
46:
38:
26:
17:
12:
11:
5:
1263:
1261:
1253:
1252:
1247:
1242:
1237:
1232:
1222:
1221:
1218:
1217:
1208:
1193:
1186:
1185:External links
1183:
1180:
1179:
1168:
1153:
1138:
1116:10.1.1.24.3741
1093:
1060:
1007:
1000:
974:
944:10.1.1.641.139
937:(1): 219–230.
921:
876:
861:
825:
803:10.1.1.57.8562
790:SIAM J. Comput
780:
751:(2): 339–353.
735:
728:
692:
681:(6): 259–270.
661:
647:10.1.1.149.775
640:(2): 338–359.
624:
610:10.1.1.38.1766
603:(2): 557–582.
597:SIAM J. Comput
587:
565:10.1.1.55.9322
542:
515:
508:
490:
463:
448:
426:
425:
423:
420:
410:
407:
384:tandem repeats
311:
308:
286:
285:
193:
191:
184:
178:
175:
159:
158:
155:
154:
149:
143:
142:
133:
127:
126:
117:
113:
112:
107:
103:
102:
96:
95:
86:
85:Known for
82:
81:
76:
72:
71:
68:
64:
63:
58:
44:
40:
39:
36:
28:
27:
24:
15:
13:
10:
9:
6:
4:
3:
2:
1262:
1251:
1248:
1246:
1243:
1241:
1240:Living people
1238:
1236:
1233:
1231:
1228:
1227:
1225:
1216:
1212:
1209:
1206:
1201:
1197:
1196:Gad M. Landau
1194:
1192:
1189:
1188:
1184:
1177:
1172:
1169:
1164:
1157:
1154:
1149:
1142:
1139:
1134:
1130:
1126:
1122:
1117:
1112:
1108:
1104:
1097:
1094:
1088:
1083:
1079:
1075:
1071:
1064:
1061:
1056:
1052:
1048:
1044:
1040:
1036:
1031:
1026:
1022:
1018:
1011:
1008:
1003:
997:
993:
989:
985:
978:
975:
970:
966:
962:
958:
954:
950:
945:
940:
936:
932:
925:
922:
917:
913:
909:
905:
900:
895:
891:
887:
880:
877:
872:
868:
864:
858:
854:
850:
845:
840:
836:
829:
826:
821:
817:
813:
809:
804:
799:
795:
791:
784:
781:
776:
772:
768:
764:
759:
754:
750:
746:
739:
736:
731:
725:
721:
717:
712:
707:
703:
696:
693:
688:
684:
680:
676:
672:
665:
662:
657:
653:
648:
643:
639:
635:
634:J. Algorithms
628:
625:
620:
616:
611:
606:
602:
598:
591:
588:
583:
579:
575:
571:
566:
561:
557:
553:
546:
543:
538:
534:
530:
526:
519:
516:
511:
505:
501:
494:
491:
486:
482:
478:
474:
467:
464:
461:
457:
452:
449:
445:
440:
436:
435:Gad M. Landau
431:
428:
421:
419:
417:
408:
406:
404:
400:
396:
392:
387:
385:
381:
377:
373:
369:
365:
361:
356:
355:edit distance
352:
348:
343:
341:
337:
333:
329:
325:
321:
317:
309:
307:
305:
301:
297:
293:
282:
279:
271:
260:
257:
253:
250:
246:
243:
239:
236:
232:
229: –
228:
224:
223:Find sources:
217:
213:
207:
206:
202:
197:
192:
183:
182:
176:
174:
171:
169:
165:
156:
153:
150:
148:
144:
137:
134:
132:
128:
125:
121:
118:
114:
111:
108:
104:
101:
97:
94:
90:
87:
83:
80:
77:
73:
69:
65:
61:
55:(age 69)
45:
41:
37:Gad M. Landau
34:
29:
25:Gad M. Landau
22:
19:
1171:
1162:
1156:
1147:
1141:
1106:
1102:
1096:
1077:
1073:
1063:
1020:
1016:
1010:
983:
977:
934:
930:
924:
889:
885:
879:
834:
828:
793:
789:
783:
748:
745:Algorithmica
744:
738:
701:
695:
678:
674:
664:
637:
633:
627:
600:
596:
590:
555:
552:Algorithmica
551:
545:
531:(1): 63–78.
528:
524:
518:
499:
493:
476:
472:
466:
451:
430:
412:
388:
370:comparison,
344:
336:suffix trees
313:
289:
274:
265:
255:
248:
241:
234:
227:"Gad Landau"
222:
215:
198:
172:
163:
162:
135:
116:Institutions
99:
18:
1250:1954 births
1165:. Springer.
1150:. Springer.
1109:(1): 1–18.
1080:(1): 2–11.
479:: 239–249.
332:Uzi Vishkin
152:Uzi Vishkin
67:Nationality
1224:Categories
1211:Gad Landau
456:Gad Landau
422:References
372:clustering
238:newspapers
49:1954-09-24
1111:CiteSeerX
1025:CiteSeerX
939:CiteSeerX
894:CiteSeerX
844:1304.5702
798:CiteSeerX
758:1004.1194
711:1301.6127
642:CiteSeerX
605:CiteSeerX
560:CiteSeerX
376:haplotype
268:June 2019
199:does not
1133:11339903
1047:20733241
961:26355520
916:17985988
310:Research
1055:6947773
871:6231735
820:2661452
775:1257530
582:3352884
252:scholar
201:include
70:Israeli
1131:
1113:
1053:
1045:
1027:
998:
969:779878
967:
959:
941:
914:
896:
869:
859:
818:
800:
773:
726:
644:
607:
580:
562:
506:
399:Yahoo!
382:, and
326:, and
254:
247:
240:
233:
225:
140:(1987)
138:
131:Thesis
106:Fields
60:Israel
1051:S2CID
965:S2CID
867:S2CID
839:arXiv
816:S2CID
771:S2CID
753:arXiv
706:arXiv
578:S2CID
294:from
259:JSTOR
245:books
1200:DBLP
1129:PMID
1043:PMID
996:ISBN
957:PMID
912:PMID
857:ISBN
724:ISBN
504:ISBN
439:DBLP
403:WABI
366:and
338:and
231:news
203:any
43:Born
1198:at
1121:doi
1082:doi
1035:doi
988:doi
949:doi
904:doi
849:doi
808:doi
763:doi
716:doi
683:doi
652:doi
615:doi
570:doi
533:doi
481:doi
437:at
395:IBM
368:RNA
364:DNA
1226::
1127:.
1119:.
1105:.
1076:.
1072:.
1049:.
1041:.
1033:.
1019:.
994:.
963:.
955:.
947:.
935:11
933:.
910:.
902:.
890:14
888:.
865:.
855:.
847:.
814:.
806:.
794:32
792:.
769:.
761:.
749:65
747:.
722:.
714:.
679:88
677:.
650:.
638:41
636:.
613:.
601:27
599:.
576:.
568:.
556:12
554:.
529:37
527:.
477:43
475:.
386:.
374:,
322:,
318:,
51:)
1135:.
1123::
1107:8
1090:.
1084::
1078:9
1057:.
1037::
1021:8
1004:.
990::
971:.
951::
918:.
906::
873:.
851::
841::
822:.
810::
777:.
765::
755::
732:.
718::
708::
689:.
685::
658:.
654::
621:.
617::
584:.
572::
539:.
535::
512:.
487:.
483::
281:)
275:(
270:)
266:(
256:·
249:·
242:·
235:·
218:.
208:.
47:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
