Gad M. Landau - LIST OF PUBLICATIONS

 

 

BD14583_ Landau, G.M. and U. Vishkin,

Efficient string matching with k mismatches,

Theoretical Computer Science, 43, 239--249 (1986).

 

BD14583_ Landau, G.M., U. Vishkin and R. Nussinov,

An efficient string matching algorithm with k differences for nucleotide and amino acid sequences,

Nucleic Acid Research, 14, 1, 31--46 (1986).

 

BD14583_ Galil, Z., G.M. Landau and M.M. Yung,

Distributed algorithms in synchronous broadcasting networks,

Theoretical Computer Science, 49, 171--184 (1987).

 

BD14583_ Landau, G.M., U. Vishkin and R. Nussinov,

An efficient string matching algorithm with k substitutions for nucleotide and amino acid sequences,

Journal of Theoretical Biology, 126, 483--490 (1987).

 

BD14583_ Landau, G.M. and U. Vishkin,

Fast string matching with k differences,

Journal of Computer and System Sciences, 37, 1, 63--78 (1988).

 

BD14583_ Landau, G.M., U. Vishkin and R. Nussinov,

Locating alignments with k differences for nucleotide and amino acid sequences

CABIOS, 4, 1, 19--24 (1988).

 

BD14583_ Apostolico, A., C. Iliopoulos, G.M. Landau, B. Schieber and U. Vishkin,

Parallel construction of a suffix tree with applications

Algorithmica, 3, 347--365 (1988).

BD14583_ Landau, G.M. and U. Vishkin,

Fast parallel and serial approximate string matching

Journal of Algorithms, 10, 2, 157--169 (1989).

 

BD14583_ Afek, Y., G.M. Landau, B. Schieber and M.M. Yung,

The power of multimedia: combining point-to-point and multiaccess networks,

Information and Computation, 84, 1, 97--118 (1990).

 

BD14583_ Landau, G.M., U. Vishkin and R. Nussinov,

Fast alignment of DNA and protein sequences,

Methods in Enzymology, 183, 487--502 (1990).

 

BD14583_ Dinstein, I. and G.M. Landau,

Parallel algorithms for contour extraction and coding on an EREW PRAM computer,

Pattern Recognition Letters, 11, 87--93 (1990).

 

BD14583_ Amir, A. and G.M. Landau,

Fast parallel and serial multidimensional approximate array matching,

Theoretical Computer Science, 81, 1, 97--115 (1991).

 

BD14583_ Dinstein, I. and G.M. Landau,

Parallel computable contour based feature strings for 2-D shape recognition,

Pattern Recognition Letters, 12, 299--306 (1991).

 

BD14583_ Dinstein, I., G.M. Landau and G. Guy,

Parallel (PRAM EREW) algorithms for contour based 2-D shape recognition,

Pattern Recognition, 24, 10, 929--942 (1991).

 

BD14583_ Amir, A., G.M. Landau and U. Vishkin,

Efficient pattern matching with scaling,

Journal of Algorithms, 13, 1, 2--32 (1992).

 

BD14583_ Gusfield, D., G.M. Landau and B. Schieber,

An efficient algorithm for the all pairs suffix-prefix problem,

Information Processing Letters, 41, 181--185 (1992).

 

BD14583_ Fischetti, V.A., V. Pancholi, P. Sellers, J.P. Schmidt, G.M. Landau, X. Xu and O. Schneewind,

Streptococcal M protein: a common structural motif used by Gram-positive bacteria for biological active surface molecules, Molecular Recognition in Host-Parasite Interactions: Mechanisms in viral, bacterial and parasite infections.

Published by Plenum Publishing, 31--38, (1992).

 

BD14583_ Fischetti, V.A., G.M. Landau, J.P. Schmidt and P. Sellers,

Identifying periodic occurrences of a template with applications to protein structure,

Information Processing Letters, 45, 11--18 (1993).

PDF

 

BD14583_ Landau, G.M. and U. Vishkin,

Pattern matching in a digitized image,

Algorithmica, 12, 375-408 (1994).

 

BD14583_ Landau, G.M., J.P. Schmidt and V. Tsotras,

On historical queries along multiple lines of time evolution,

The International Journal on Very Large Databases, 4, 703--726 (1995).

 

BD14583_ Kedem, Z.M., G.M. Landau and K.V. Palem,

Parallel suffix-prefix-matching algorithm and applications,

SIAM J. Comput., 25, 5, 998--1023 (1996).

 

BD14583_ Landau, G.M. and U. Vishkin,

Approximate String Matching,

Pattern Matching Algorithms, A. Apostolico and Zvi Galil (Ed.), Oxford University Press, New York,

185 -- 200, (1997).

 

BD14583_ Landau, G.M., E.W. Myers and J.P. Schmidt,

Incremental string comparison,

SIAM J. Comput., 27, 2, 557--582 (1998).

 

BD14583_ Amir, A., G.M. Landau, N. Lewenstein and M. Lewenstein,

Efficient special cases pattern matching with swaps,

Information Processing Letters, 68, 3, 125--132 (1998).

PDF

 

BD14583_ Apostolico, A., G.M. Landau, and S. Skiena,

Matching for run-length encoded strings,

Journal of Complexity, 15, 1, 4--16 (1999).

 

BD14583_ Amir, A., Y. Aumann, G.M. Landau, N. Lewenstein and M. Lewenstein,

Pattern Matching with swaps,

Journal of Algorithms, 37, 2, 247--266 (2000).

 

BD14583_ Amir, A. ,D. Keselman, G.M. Landau, N. Lewenstein, M. Lewenstein, and M. Rodeh,

Indexing and dictionary matching with one error,

Journal of Algorithms, 37, 2, 309--325 (2000).

 

BD14583_ Landau, G.M.,  J.P. Schmidt and D. Sokol,

An algorithm for approximate tandem repeats,

Journal of Computational  Biology, 8, 1, 1-18 (2001).

 

BD14583_ Landau, G.M. and M. Ziv-Ukelson,

On the Common Substring Alignment Problem,

Journal of Algorithms, 41, 2, 338--359 (2001).

 

BD14583_ Amir A., and G.M. Landau

Combinatorial Pattern Matching,

12th Annual Symposium, CPM 2001,

Lecture Notes in Computer Science 2089, Springer-Verlag, (2001).

 

BD14583_ Amir, A., G.M. Landau and E. Ukkonen,

Online Time Stamped Text Indexing,

Information Processing Letters, 82 ,5, 253--259 (2002).

 

BD14583_ Troyanskaya, O.G., O. Arbell, Y. Koren, G.M. Landau and A. Bolshoy,

Sequence Complexity Profiles of Prokaryotic Genomic Sequences: A Fast Algorithm for Calculating Linguistic Complexity,

Bioinformatics, 18, 5, 5, 679--688 (2002).

 

BD14583_ Arbell, O., G.M. Landau and J.S.B. Mitchell,

Edit distance of run-length encoded strings,

Information Processing Letters, 83, 6, 307--314 (2002).

 

 

BD14583_ Carmel, D., N. Efrati, G.M. Landau, Y.S. Maarek and Y. Mass,

An Extension of the Vector Space Model for Querying XML Documents via XML Fragments.

XML and Information Retrieval (Workshop),14-25, Tampere, Finland, August (2002).

PDF

 

BD14583_ Crochemore, M., G.M. Landau and M. Ziv-Ukelson,

A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices,

SIAM J. Comput. 32, 5, 1654--1673 (2003).

PDF

 

BD14583_ Amir, A., G.M. Landau and D. Sokol,

Inplace Run-Length 2d Compressed Search,

Theoretical Computer Science, 290, 3, 1361--1383 (2003).

 

 

BD14583_ Amir, A., G.M. Landau and D. Sokol,

Inplace 2D Matching in Compressed Images.

Journal of Algorithms, 49, 2, 240-261 (2003).

 

BD14583_ Amir, A., A. Apostolico, G.M. Landau and G. Satta,

Efficient Text Fingerprinting Via Parikh Mapping,

Journal of Discrete Algorithms, 1,5-6, 409-421 (2003).

PDFPS

  

BD14583_ Landau, G.M., B. Schieber and M. Ziv-Ukelson,

Sparse LCS Common Substring Alignment,

Information Processing Letters, 88,6, 259-270 (2003).

PDFPS

 

BD14583_ Eres, R., G.M. Landau, and L. Parida,

Permutation pattern discovery in biosequences,

Journal of Computational Biology, 11, 6, 1050--1060, (2004).

PDFPS

 

 

BD14583_ Amir, A., A. Butman, M. Crochemore, G.M. Landau and M. Schaps

Two-Dimensional Pattern Matching with Rotations,

Theoretical Computer Science, 314, 1-2, 173--187 (2004).

PDFPS

 

BD14583_ Butman, A., R. Eres, and G.M. Landau,

Scaled and Permuted String Matching.

Information Processing Letters, 92, 6, 293--297 (2004).

 PDFPS

 

BD14583_ Landau, G.M., O. Levi, and S. Skiena,

Alphabet Permutation for Differentially Encoding Text,

Proc. 11th Symposium on String Processing and Information

Retrieval (SPIRE), Lecture Notes in Computer Science 3246,

Springer-Verlag, 216--217 (2004).

 PDFPS

 

BD14583_ Efraty, N., and G.M. Landau,

Sparse Normalized Local Alignment,

Algorithmica, 43, 3, 179--194, (2005).

PDF

 

BD14583_ Landau, G.M., L. Parida and O. Weimann

Gene Proximity Analysis Across Whole Genomes via PQ Trees,

Journal of Computational Biology, 12, 10, 12891306, (2005).

PDF

 

BD14583_ Dori S. and G. M. Landau,

Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.

Information Processing Letters, 98, 2, 66--72 (2006).

PDF 

 

BD14583_ Kent C., G. M. Landau and M. Ziv-Ukelson,

On the Complexity of Sparse Exon Assembly.

Journal of Computational Biology, 13, 5, 1013--1027 (2006).

PDF 

 

BD14583_ Amir, A., G.M. Landau, M. Lewenstein and D. Sokol,

Dynamic text and static pattern matching.

ACM Transactions on Algorithms (TALG) 3, Article No. 19, (2007).

 PDF

 

BD14583_ Farach-Colton, M., G. M. Landau, S. Cenk Sahinalp and D. Tsur,

Optimal spaced seeds for faster approximate string.

Journal of Computer and System Sciences (JCSS), 73, 7, 1035-1044 (2007).

 PDF

 

BD14583_ Landau, G.M., E.W. Myers and M. Ziv-Ukelson,

Two Algorithms for LCS Consecutive Suffix Alignment.

Journal of Computer and System Sciences (JCSS) 73, 7, 1095-1117 (2007).

PDF

 

BD14583_ Backofen, R., S. Chen, D. Hermelin, G.M. Landau, M.A. Roytberg, O. Weimann and K. Zhang,

Locality and Gaps in RNA Comparison.

Journal of Computational Biology, 14, 8, 1074-1087 (2007).

PDF

 

BD14583_ Landau, Gad M., Dekel Tsur and Oren Weimann,

Indexing a Dictionary for Subset Matching Queries.

Proc. 14th Symposium on String Processing and Information Retrieval (SPIRE), Lecture Notes in Computer Science, 4726, Springer-Verlag, 195--204 (2007).

PDF

 

BD14583_ Kim, J.W., A. Amir, G.M. Landau, and K. Park,

Computing similarity of run-length encoded strings with affine gap penalty.

Theoretical Computer Science, 395, 2-3, 268--282 (2008).

BD14583_ Crochemore, M., D. Hermelin, G.M. Landau, D. Rawitz and S. Vialette,

Approximating the 2-Interval Pattern problem.

Theoretical Computer Science, 395, 2-3, 283-297 (2008).

PDF

BD14583_ Ardila, Y.J.P., R. Clifford, C.S. Iliopoulos, G.M. Landau, and M. Mohamed,

Necklace Swap Problem for Rhythmic Similarity Measures.

International Journal of Computational Methods, 5, 3, 351-363 (2008).

PDF

BD14583_ Antoniou, Pavlos, M. Crochemore, C.~S. Iliopoulos, I. Jayasekera and Gad M. Landau,

Conservative String Covering of Indeterminate Strings.

The Prague Stringology Conference 108--115, (2008).

BD14583_ Kapah, Oren, Gad M. Landau, Avivit Levy and Nitsan Oz,

Interchange Rearrangement: The Element-Cost Model.

Theoretical Computer Science.

PDF

 

BD14583_ Hermelin, D., G.~M. Landau, S. Landau and O. Weimann,

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.

Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 529--540 (2009).

PDF

 

BD14583_ Backofen, Rolf, Gad M. Landau, Mathias Mohl, Dekel Tsur and Oren Weimann,

Fast RNA Structure Alignment for Crossing Input Structures,LCS Approximation via Embedding into Local Non-Repetitive Strings.

Proc. 20th Combinatorial Pattern Matching Conference (CPM), Lecture Notes in Computer Science, 5577, Springer-Verlag, 236248 (2009).

PDF

BD14583_ Fellows, Michael, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond and Liat Rozenberg,

Haplotype Inference Constrained by Plausible Haplotype.

Proc. 20th Combinatorial Pattern Matching Conference (CPM), Lecture Notes in Computer Science, 5577, Springer-Verlag, 339--352 (2009).

PDF

BD14583_ Landau, Gad M., Avivit Levy and Ilan Newman,

LCS Approximation via Embedding into Local Non-Repetitive Strings.

Proc. 20th Combinatorial Pattern Matching Conference (CPM), Lecture Notes in Computer Science, 5577, Springer-Verlag, 92--105 (2009).

PDF

 

BD14583_ Demaine, Erik D., Gad M. Landau and Oren Weimann,

On Cartesian Trees and Range Minimum Queries.

Proc. 36th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, 5555, Springer-Verlag, 341--353 (2009).

PDF

 

Amir, Amihood, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park and Jeong Seop Sim,

Consensus Optimizing Both Distance Sum and Radius,

Proc. 16th Symposium on String Processing and Information Retrieval (SPIRE), Lecture Notes in Computer Science, Springer-Verlag, (2009).

PDF