 | 2009 |
|---|
| 98 |       | Rolf Backofen,
Gad M. Landau,
Mathias Möhl,
Dekel Tsur,
Oren Weimann:
Fast RNA Structure Alignment for Crossing Input Structures.
CPM 2009: 236-248 |
| 97 | | Michael R. Fellows,
Tzvika Hartman,
Danny Hermelin,
Gad M. Landau,
Frances A. Rosamond,
Liat Rozenberg:
Haplotype Inference Constrained by Plausible Haplotype Data.
CPM 2009: 339-352 |
| 96 | | Gad M. Landau,
Avivit Levy,
Ilan Newman:
LCS Approximation via Embedding into Local Non-repetitive Strings.
CPM 2009: 92-105 |
| 95 | | Erik D. Demaine,
Gad M. Landau,
Oren Weimann:
On Cartesian Trees and Range Minimum Queries.
ICALP (1) 2009: 341-353 |
| 94 | | Amihood Amir,
Gad M. Landau,
Joong Chae Na,
Heejin Park,
Kunsoo Park,
Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius.
SPIRE 2009: 234-242 |
| 93 | | Danny Hermelin,
Gad M. Landau,
Shir Landau,
Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.
STACS 2009: 529-540 |
| 92 | | Danny Hermelin,
Gad M. Landau,
Shir Landau,
Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
CoRR abs/0902.2649: (2009) |
| 2008 |
|---|
| 91 |  | Paolo Ferragina,
Gad M. Landau:
Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings
Springer 2008 |
| 90 | | Gad M. Landau:
Approximate Runs - Revisited.
SPIRE 2008: 2 |
| 89 | | Oren Kapah,
Gad M. Landau,
Avivit Levy,
Nitsan Oz:
Interchange Rearrangement: The Element-Cost Model.
SPIRE 2008: 224-235 |
| 88 | | Jin Wook Kim,
Amihood Amir,
Gad M. Landau,
Kunsoo Park:
Similarity between Compressed Strings.
Encyclopedia of Algorithms 2008 |
| 87 | | 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): 268-282 (2008) |
| 86 | | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Dror Rawitz,
Stéphane Vialette:
Approximating the 2-interval pattern problem.
Theor. Comput. Sci. 395(2-3): 283-297 (2008) |
| 2007 |
|---|
| 85 | | Gad M. Landau,
Dekel Tsur,
Oren Weimann:
Indexing a Dictionary for Subset Matching Queries.
SPIRE 2007: 195-204 |
| 84 | | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Dina Sokol:
Dynamic text and static pattern matching.
ACM Transactions on Algorithms 3(2): (2007) |
| 83 | | 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): 1035-1044 (2007) |
| 82 | | Gad M. Landau,
Eugene W. Myers,
Michal Ziv-Ukelson:
Two algorithms for LCS Consecutive Suffix Alignment.
J. Comput. Syst. Sci. 73(7): 1095-1117 (2007) |
| 81 | | Rolf Backofen,
Shihyen Chen,
Danny Hermelin,
Gad M. Landau,
Mikhail A. Roytberg,
Oren Weimann,
Kaizhong Zhang:
Locality and Gaps in RNA Comparison.
Journal of Computational Biology 14(8): 1074-1087 (2007) |
| 2006 |
|---|
| 80 | | Rolf Backofen,
Danny Hermelin,
Gad M. Landau,
Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.
CPM 2006: 246-257 |
| 79 | | Gad M. Landau:
Can dist tables be merged in linear time - An Open Problem.
Stringology 2006: 1 |
| 78 | | Shiri Dori,
Gad M. Landau:
Construction of Aho Corasick automaton in linear time for integer alphabets.
Inf. Process. Lett. 98(2): 66-72 (2006) |
| 77 | | Carmel Kent,
Gad M. Landau,
Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly.
Journal of Computational Biology 13(5): 1013-1027 (2006) |
| 2005 |
|---|
| 76 | | Gad M. Landau,
Laxmi Parida,
Oren Weimann:
Using PQ Trees for Comparative Genomics.
CPM 2005: 128-143 |
| 75 | | Shiri Dori,
Gad M. Landau:
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.
CPM 2005: 168-177 |
| 74 | | Carmel Kent,
Gad M. Landau,
Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly.
CPM 2005: 201-218 |
| 73 | | Maxime Crochemore,
Danny Hermelin,
Gad M. Landau,
Stéphane Vialette:
Approximating the 2-Interval Pattern Problem.
ESA 2005: 426-437 |
| 72 | | Martin Farach-Colton,
Gad M. Landau,
Süleyman Cenk Sahinalp,
Dekel Tsur:
Optimal Spaced Seeds for Faster Approximate String Matching.
ICALP 2005: 1251-1262 |
| 71 | | Jin Wook Kim,
Amihood Amir,
Gad M. Landau,
Kunsoo Park:
Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty.
SPIRE 2005: 315-326 |
| 70 | | Rolf Backofen,
Danny Hermelin,
Gad M. Landau,
Oren Weimann:
Normalized Similarity of RNA Sequences.
SPIRE 2005: 360-369 |
| 69 | | Yoan José Pinzón Ardila,
Costas S. Iliopoulos,
Gad M. Landau,
Manal Mohamed:
Approximation algorithm for the cyclic swap problem.
Stringology 2005: 190-200 |
| 68 | | Nadav Efraty,
Gad M. Landau:
Sparse Normalized Local Alignment.
Algorithmica 43(3): 179-194 (2005) |
| 67 | | Amihood Amir,
Gad M. Landau:
Foreword.
Discrete Applied Mathematics 146(2): 123 (2005) |
| 66 | | Gad M. Landau,
Laxmi Parida,
Oren Weimann:
Gene Proximity Analysis across Whole Genomes via PQ Trees1.
Journal of Computational Biology 12(10): 1289-1306 (2005) |
| 2004 |
|---|
| 65 | | Gad M. Landau,
Eugene W. Myers,
Michal Ziv-Ukelson:
Two Algorithms for LCS Consecutive Suffix Alignment.
CPM 2004: 173-193 |
| 64 | | Nadav Efraty,
Gad M. Landau:
Sparse Normalized Local Alignment.
CPM 2004: 333-346 |
| 63 | | Gad M. Landau,
Ofer Levi,
Steven Skiena:
Alphabet Permutation for Differentially Encoding Text.
SPIRE 2004: 216-217 |
| 62 | | Ayelet Butman,
Revital Eres,
Gad M. Landau:
Permuted and Scaled String Matching.
SPIRE 2004: 72-73 |
| 61 | | Ayelet Butman,
Revital Eres,
Gad M. Landau:
Scaled and permuted string matching.
Inf. Process. Lett. 92(6): 293-297 (2004) |
| 60 | | Revital Eres,
Gad M. Landau,
Laxmi Parida:
Permutation Pattern Discovery in Biosequences.
Journal of Computational Biology 11(6): 1050-1060 (2004) |
| 59 | | Amihood Amir,
Ayelet Butman,
Maxime Crochemore,
Gad M. Landau,
Malka Schaps:
Two-dimensional pattern matching with rotations.
Theor. Comput. Sci. 314(1-2): 173-187 (2004) |
| 2003 |
|---|
| 58 | | Amihood Amir,
Ayelet Butman,
Maxime Crochemore,
Gad M. Landau,
Malka Schaps:
Two-Dimensional Pattern Matching with Rotations.
CPM 2003: 17-31 |
| 57 | | Gad M. Landau,
Baruch Schieber,
Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment.
CPM 2003: 225-236 |
| 56 | | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace 2D matching in compressed images.
SODA 2003: 853-862 |
| 55 | | Revital Eres,
Gad M. Landau,
Laxmi Parida:
A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.
WABI 2003: 139-150 |
| 54 | | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Dina Sokol:
Dynamic Text and Static Pattern Matching.
WADS 2003: 340-352 |
| 53 | | Gad M. Landau,
Baruch Schieber,
Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment.
Inf. Process. Lett. 88(6): 259-270 (2003) |
| 52 | | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace 2D matching in compressed images.
J. Algorithms 49(2): 240-261 (2003) |
| 51 | | Amihood Amir,
Alberto Apostolico,
Gad M. Landau,
Giorgio Satta:
Efficient text fingerprinting via Parikh mapping.
J. Discrete Algorithms 1(5-6): 409-421 (2003) |
| 50 | | Maxime Crochemore,
Gad M. Landau,
Michal Ziv-Ukelson:
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
SIAM J. Comput. 32(6): 1654-1673 (2003) |
| 49 | | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace run-length 2d compressed search.
Theor. Comput. Sci. 290(3): 1361-1383 (2003) |
| 2002 |
|---|
| 48 | | Maxime Crochemore,
Gad M. Landau,
Michal Ziv-Ukelson:
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.
SODA 2002: 679-688 |
| 47 | | Olga G. Troyanskaya,
Ora Arbell,
Yair Koren,
Gad M. Landau,
Alexander Bolshoy:
Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity.
Bioinformatics 18(5): 679-688 (2002) |
| 46 | | Amihood Amir,
Gad M. Landau,
Esko Ukkonen:
Online timestamped text indexing.
Inf. Process. Lett. 82(5): 253-259 (2002) |
| 45 | | Ora Arbell,
Gad M. Landau,
Joseph S. B. Mitchell:
Edit distance of run-length encoded strings.
Inf. Process. Lett. 83(6): 307-314 (2002) |
| 2001 |
|---|
| 44 | | Amihood Amir,
Gad M. Landau:
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
Springer 2001 |
| 43 | | Gad M. Landau,
Michal Ziv-Ukelson:
On the Common Substring Alignment Problem.
J. Algorithms 41(2): 338-359 (2001) |
| 42 | | Gad M. Landau,
Jeanette P. Schmidt,
Dina Sokol:
An Algorithm for Approximate Tandem Repeats.
Journal of Computational Biology 8(1): 1-18 (2001) |
| 2000 |
|---|
| 41 | | Gad M. Landau,
Michal Ziv-Ukelson:
On the shared substring alignment problem.
SODA 2000: 804-814 |
| 40 | | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace run-length 2d compressed search.
SODA 2000: 817-818 |
| 39 | | Amihood Amir,
Yonatan Aumann,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Pattern Matching with Swaps.
J. Algorithms 37(2): 247-266 (2000) |
| 38 | | Amihood Amir,
Dmitry Keselman,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein,
Michael Rodeh:
Text Indexing and Dictionary Matching with One Error.
J. Algorithms 37(2): 309-325 (2000) |
| 1999 |
|---|
| 37 | | Amihood Amir,
Dmitry Keselman,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein,
Michael Rodeh:
Indexing and Dictionary Matching with One Error.
WADS 1999: 181-192 |
| 36 | | Alberto Apostolico,
Gad M. Landau,
Steven Skiena:
Matching for Run-Length Encoded Strings.
J. Complexity 15(1): 4-16 (1999) |
| 1998 |
|---|
| 35 | | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps.
CPM 1998: 209-220 |
| 34 | | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps.
Inf. Process. Lett. 68(3): 125-132 (1998) |
| 33 | | Gad M. Landau,
Eugene W. Myers,
Jeanette P. Schmidt:
Incremental String Comparison.
SIAM J. Comput. 27(2): 557-582 (1998) |
| 1997 |
|---|
| 32 | | Amihood Amir,
Yonatan Aumann,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Pattern Matching with Swaps.
FOCS 1997: 144-153 |
| 1996 |
|---|
| 31 | | Zvi M. Kedem,
Gad M. Landau,
Krishna V. Palem:
Parallel Suffix-Prefix-Matching Algorithm and Applications.
SIAM J. Comput. 25(5): 998-1023 (1996) |
| 1995 |
|---|
| 30 | | Gad M. Landau,
Jeanette P. Schmidt,
Vassilis J. Tsotras:
Historical Queries Along Multiple Lines of Time Evolution
VLDB J. 4(4): 703-726 (1995) |
| 1994 |
|---|
| 29 | | Gad M. Landau,
Uzi Vishkin:
Pattern Matching in a Digitized Image.
Algorithmica 12(4/5): 375-408 (1994) |
| 1993 |
|---|
| 28 | | Gad M. Landau,
Jeanette P. Schmidt:
An Algorithm for Approximate Tandem Repeats.
CPM 1993: 120-133 |
| 27 | | Gad M. Landau,
Uzi Vishkin:
Two Dimensional Pattern Matching in a Digitized Image.
CPM 1993: 134-151 |
| 26 | | Gad M. Landau,
Jeanette P. Schmidt,
Vassilis J. Tsotras:
Efficient Support of Historical Queries for Multiple Lines of Evolution.
ICDE 1993: 319-326 |
| 25 | | Vincent A. Fischetti,
Gad M. Landau,
Peter H. Sellers,
Jeanette P. Schmidt:
Identifying Periodic Occurrences of a Template with Applications to Protein Structure.
Inf. Process. Lett. 45(1): 11-18 (1993) |
| 24 | | Vincent A. Fischetti,
Gad M. Landau,
Jeanette P. Schmidt,
Peter H. Sellers:
Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure.
Inf. Process. Lett. 46(3): 157 (1993) |
| 1992 |
|---|
| 23 | | Vincent A. Fischetti,
Gad M. Landau,
Jeanette P. Schmidt,
Peter H. Sellers:
Identifying Periodic Occurrences of a Template with Applications to Protein Structures.
CPM 1992: 111-120 |
| 22 | | Gad M. Landau,
Uzi Vishkin:
Pattern Matching in a Digitized Image.
SODA 1992: 453-462 |
| 21 | | Dan Gusfield,
Gad M. Landau,
Baruch Schieber:
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.
Inf. Process. Lett. 41(4): 181-185 (1992) |
| 20 | | Amihood Amir,
Gad M. Landau,
Uzi Vishkin:
Efficient Pattern Matching with Scaling.
J. Algorithms 13(1): 2-32 (1992) |
| 1991 |
|---|
| 19 | | Its'hak Dinstein,
Gad M. Landau,
Gideon Guy:
Parallel (pram erew) algorithms for contour-based 2D shape recognition.
Pattern Recognition 24(10): 929-942 (1991) |
| 18 | | Its'hak Dinstein,
Gad M. Landau:
Parallel computable contour based feature strings for 2-D shape recognition.
Pattern Recognition Letters 12(5): 299-306 (1991) |
| 17 | | Amihood Amir,
Gad M. Landau:
Fast Parallel and Serial Multidimensional Aproximate Array Matching.
Theor. Comput. Sci. 81(1): 97-115 (1991) |
| 1990 |
|---|
| 16 | | Amihood Amir,
Gad M. Landau,
Uzi Vishkin:
Efficient Pattern Matching with Scaling.
SODA 1990: 344-357 |
| 15 | | Yehuda Afek,
Gad M. Landau,
Baruch Schieber,
Moti Yung:
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Inf. Comput. 84(1): 97-118 (1990) |
| 14 | | Its'hak Dinstein,
Gad M. Landau:
Parallel algorithms for contour extraction and coding on an EREW PRAM computer.
Pattern Recognition Letters 11(2): 87-93 (1990) |
| 1989 |
|---|
| 13 | | Zvi M. Kedem,
Gad M. Landau,
Krishna V. Palem:
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.
SPAA 1989: 388-398 |
| 12 | | Gad M. Landau,
Uzi Vishkin:
Fast Parallel and Serial Approximate String Matching.
J. Algorithms 10(2): 157-169 (1989) |
| 1988 |
|---|
| 11 | | Yehuda Afek,
Gad M. Landau,
Baruch Schieber,
Moti Yung:
The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.
PODC 1988: 90-104 |
| 10 | | Alberto Apostolico,
Costas S. Iliopoulos,
Gad M. Landau,
Baruch Schieber,
Uzi Vishkin:
Parallel Construction of a Suffix Tree with Applications.
Algorithmica 3: 347-365 (1988) |
| 9 | | Gad M. Landau,
Uzi Vishkin,
Ruth Nussinov:
Locating alignments with k differences for nucleotide and amino acid sequences.
Computer Applications in the Biosciences 4(1): 19-24 (1988) |
| 8 | | Gad M. Landau,
Uzi Vishkin:
Fast String Matching with k Differences.
J. Comput. Syst. Sci. 37(1): 63-78 (1988) |
| 1987 |
|---|
| 7 | | Gad M. Landau,
Baruch Schieber,
Uzi Vishkin:
Parallel Construction of a Suffix Tree (Extended Abstract).
ICALP 1987: 314-325 |
| 6 | | Zvi Galil,
Gad M. Landau,
Mordechai M. Yung:
Distributed Algorithms in Synchronous Broadcasting Networks.
Theor. Comput. Sci. 49: 171-184 (1987) |
| 1986 |
|---|
| 5 | | Gad M. Landau,
Uzi Vishkin:
Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm
STOC 1986: 220-230 |
| 4 | | Gad M. Landau,
Uzi Vishkin,
Ruth Nussinov:
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
Nucleic Acids Research 14(1): 31-46 (1986) |
| 3 | | Gad M. Landau,
Uzi Vishkin:
Efficient String Matching with k Mismatches.
Theor. Comput. Sci. 43: 239-249 (1986) |
| 1985 |
|---|
| 2 | | Gad M. Landau,
Uzi Vishkin:
Efficient String Matching in the Presence of Errors
FOCS 1985: 126-136 |
| 1 | | Gad M. Landau,
Mordechai M. Yung,
Zvi Galil:
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract).
ICALP 1985: 363-372 |
