Gad M. Landau

View Scopus Profile

Gad M. Landau

Former affiliation
 https://orcid.org/0000-0002-5684-0629
    1985 …2024

    Research activity per year

    Filter
    Conference contribution

    Search results

    • 2023

      Order-Preserving Squares in Strings

      Ghazawi, S., Landau, G. M. & Gawrychowski, P., Jun 2023, 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023. Bulteau, L. & Liptak, Z. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 259).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2022

      Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays

      Amir, A., Guerra, C., Kondratovsky, E., Landau, G. M., Marcus, S. & Sokol, D., 2022, String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Arroyuelo, D., Arroyuelo, D. & Poblete, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 55-69 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13617 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2021

      Lower Bounds for the Number of Repetitions in 2D Strings

      Gawrychowski, P., Ghazawi, S. & Landau, G. M., 2021, String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Proceedings. Lecroq, T. & Touzet, H. (eds.). Springer Science and Business Media Deutschland GmbH, p. 179-192 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12944 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2020

      Double String Tandem Repeats

      Amir, A., Butman, A., Landau, G. M., Marcus, S. & Sokol, D., 1 Jun 2020, 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020. Gortz, I. L. & Weimann, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 3. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 161).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On Indeterminate Strings Matching

      Gawrychowski, P., Ghazawi, S. & Landau, G. M., 1 Jun 2020, 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020. Gortz, I. L. & Weimann, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 161).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2019

      Cartesian tree matching and indexing

      Park, S. G., Amir, A., Landau, G. M. & Park, K., 1 Jun 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 128).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Finding periods in Cartesian tree matching

      Bataa, M., Park, S. G., Amir, A., Landau, G. M. & Park, K., 2019, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Colbourn, C. J., Grossi, R. & Pisanti, N. (eds.). Springer Verlag, p. 70-84 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11638 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Top tree compression of tries

      Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2018

      A faster construction of greedy consensus trees

      Gawrychowski, P., Landau, G. M., Sung, W. K. & Weimann, O., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 63. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Fast entropy-bounded string dictionary look-up with mismatches

      Gawrychowski, P., Landau, G. M. & Starikovskaya, T., 1 Aug 2018, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 66. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Two-dimensional maximal repetitions

      Amir, A., Landau, G. M., Marcus, S. & Sokol, D., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 2:1–2:14 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2016

      Period recovery over the hamming and edit distances

      Amir, A., Amit, M., Landau, G. M. & Sokol, D., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (eds.). Springer Verlag, p. 55-67 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9644).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • The nearest colored node in a tree

      Gawrychowski, P., Landau, G. M., Mozes, S. & Weimann, O., 1 Jun 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Grossi, R. & Lewenstein, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 25.1-25.12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 54).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2015

      Longest common extensions in trees

      Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Verlag, p. 52-64 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Range minimum query indexes in higher dimensions

      Davoodi, P., Iacono, J., Landau, G. M. & Lewenstein, M., 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Verlag, p. 149-159 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2014

      Algorithms for jumbled indexing, Jumbled Border and Jumbled Square on run-length encoded strings

      Amir, A., Apostolico, A., Hirst, T., Landau, G. M., Lewenstein, N. & Rozenberg, L., 2014, String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Proceedings. Moura, E. & Crochemore, M. (eds.). Springer Verlag, p. 45-51 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8799).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2013

      A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform

      Crochemore, M., Grossi, R., Kärkkäinen, J. & Landau, G. M., 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 74-82 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Binary jumbled pattern matching on trees and tree-like structures

      Gagie, T., Hermelin, D., Landau, G. M. & Weimann, O., 2013, Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. p. 517-528 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8125 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Locating all maximal approximate runs in a string

      Amit, M., Crochemore, M. & Landau, G. M., 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 13-27 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Tree compression with top trees

      Bille, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 160-171 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2012

      Detecting Approximate Periodic Patterns

      Amir, A., Apostolico, A., Eisenberg, E., Landau, G. M., Levy, A. & Lewenstein, N., 2012, Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. Even, G. & Rawitz, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7659 LNNS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Exact pattern matching for RNA structure ensembles

      Schmiedl, C., Möhl, M., Heyne, S., Amit, M., Landau, G. M., Will, S. & Backofen, R., 2012, Research in Computational Molecular Biology - 16th Annual International Conference, RECOMB 2012, Proceedings. p. 245-260 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7262 LNBI).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Local exact pattern matching for non-fixed RNA structures

      Amit, M., Backofen, R., Heyne, S., Landau, G. M., Möhl, M., Schmiedl, C. & Will, S., 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 306-320 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7354 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On approximating string selection problems with outliers

      Boucher, C., Landau, G. M., Levy, A., Pritchard, D. & Weimann, O., 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 427-438 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7354 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2011

      Algorithms on grammar-compressed strings

      Landau, G. M., 2011, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. p. 1 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6661 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Fast computation of a string duplication history under no-breakpoint-reuse (extended abstract)

      Brejová, B., Landau, G. M. & Vinař, T., 2011, String Processing and Information Retrieval - 18th International Symposium, SPIRE 2011, Proceedings. p. 144-155 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7024 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Random access to grammar-compressed strings

      Bille, P., Landau, G. M., Raman, R., Sadakane, K., Satti, S. R. & Weimann, O., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 373-389 17 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Range LCP

      Amir, A., Apostolico, A., Landau, G. M., Levy, A., Lewenstein, M. & Porat, E., 2011, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 683-692 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2010

      A PTAS for the square tiling problem

      Amir, A., Apostolico, A., Landau, G. M. & Shalom, O. S., 2010, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. p. 118-126 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6393 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Indexing a dictionary for subset matching queries

      Landau, G. M., Tsur, D. & Weimann, O., 2010, Algorithms and Applications - Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday. Elomaa, T., Mannila, H. & Orponen, P. (eds.). p. 158-169 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6060 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Restricted LCS

      Gotthilf, Z., Hermelin, D., Landau, G. M. & Lewenstein, M., 2010, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. p. 250-257 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6393 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2009

      A unified algorithm for accelerating edit-distance computation via text-compression

      Hermelin, D., Landau, G. M., Landau, S. & Weimann, O., 2009, STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. p. 529-540 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 3).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Consensus optimizing both distance sum and radius

      Amir, A., Landau, G. M., Na, J. C., Park, H., Park, K. & Sim, J. S., 2009, String Processing and Information Retrieval - 16th International Symposium, SPIRE 2009, Proceedings. p. 234-242 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5721 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Fast RNA structure alignment for crossing input structures

      Backofen, R., Landau, G. M., Möhl, M., Tsur, D. & Weimann, O., 2009, Combinatorial Pattern Matching - 20th Annual Symposium, CPM 2009, Proceedings. p. 236-248 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5577 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Haplotype inference constrained by plausible haplotype data

      Fellows, M. R., Hartman, T., Hermelin, D., Landau, G. M., Rosamond, F. & Rozenberg, L., 2009, Combinatorial Pattern Matching - 20th Annual Symposium, CPM 2009, Proceedings. p. 339-352 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5577 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • LCS approximation via embedding into local non-repetitive strings

      Landau, G. M., Levy, A. & Newman, I., 2009, Combinatorial Pattern Matching - 20th Annual Symposium, CPM 2009, Proceedings. p. 92-105 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5577 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On cartesian trees and range minimum queries

      Demaine, E. D., Landau, G. M. & Weimann, O., 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 341-353 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2008

      Approximate runs - revisited

      Landau, G. M., 2008, String Processing and Information Retrieval - 15th International Symposium, SPIRE 2008, Proceedings. Turpin, A., Moffat, A. & Amir, A. (eds.). Springer Verlag, p. 2 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5280 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Conservative string covering of indeterminate strings

      Antoniou, P., Crochemore, M., Iliopoulos, C. S., Jayasekera, I. & Landau, G. M., 2008, Proceedings of the Prague Stringology Conference 2008. p. 108-115 8 p. (Proceedings of the Prague Stringology Conference 2008).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2007

      Indexing a dictionary for subset matching queries

      Landau, G. M., Tsur, D. & Weimann, O., 2007, String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings. Springer Verlag, p. 195-204 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4726 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2006

      Can dist tables be merged in linear time an open problem (invited talk)

      Landau, G. M., 2006, Proceedings of the Prague Stringology Conference '06. p. 1-2 2 p. (Proceedings of the Prague Stringology Conference '06).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Local alignment of RNA sequences with arbitrary scoring schemes

      Backofen, R., Hermelin, D., Landau, G. M. & Weimann, O., 2006, Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings. Springer Verlag, p. 246-257 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4009 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2005

      Approximation algorithm for the cyclic swap problem

      Ardila, Y. J. P., Iliopoulos, C. S., Landau, G. M. & Mohamed, M., 2005, Proceedings of the Prague Stringology Conference '05. p. 190-200 11 p. (Proceedings of the Prague Stringology Conference '05).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

      Kim, J. W., Amir, A., Landau, G. M. & Park, K., 2005, String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. Springer Verlag, p. 315-326 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3772 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Normalized similarity of RNA sequences

      Backofen, R., Hermelin, D., Landau, G. M. & Weimann, O., 2005, String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. p. 360-369 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3772 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2004

      Permuted and scaled string matching

      Butman, A., Eres, R. & Landau, G. M., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Apostolico, A., Apostolico, A. & Melucci, M. (eds.). Springer Verlag, p. 72-73 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3246).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2002

      A sub-quadratic sequence alignment algorithm for unrestricted cost matrices

      Crochemore, M., Landau, G. M. & Ziv-Ukelson, M., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 679-688 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 1999

      Indexing and dictionary matching with one error (extended abstract)

      Amir, A., Keselman, D., Landau, G. M., Lewenstein, M., Lewenstein, N. & Rodeh, M., 1999, Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Dehne, F., Sack, J.-R., Gupta, A. & Tamassia, R. (eds.). Springer Verlag, p. 181-192 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1663).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 1998

      Efficient special cases of pattern matching with swaps

      Amir, A., Landau, G. M., Lewenstein, M. & Lewenstein, N., 1998, Combinatorial Pattern Matching - 9th Annual Symposium, CPM 1998, Proceedings. Springer Verlag, p. 209-220 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1448 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 1993

      An algorithm for approximate tandem repeats

      Landau, G. M. & Schmidt, J. P., 1993, Combinatorial Pattern Matching - 4th Annual Symposium, CPM 1993, Proceedings. Apostolico, A., Apostolico, A., Crochemore , M., Galil, Z., Galil, Z. & Manber, U. (eds.). Springer Verlag, p. 120-133 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 684 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review