Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Runs of Side-Sharing Tandems in Rectangular Arrays

    A side-sharing tandem is a rectangular array that is composed of two adjacent non-overlap** occurrences of the same rectangular block. Furthering our understanding of side-sharing tandems should facilitate t...

    Shoshana Marcus, Dina Sokol, Sarah Zelikovitz in Similarity Search and Applications (2023)

  2. No Access

    Article

    Double String Tandem Repeats

    A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all t...

    Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol in Algorithmica (2023)

  3. No Access

    Chapter and Conference Paper

    Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays

    Reconstructing input from a data structure entails determining whether an instance of the data structure is in fact valid or not, and if valid, discovering the underlying data that it represents. In this paper...

    Amihood Amir, Concettina Guerra in String Processing and Information Retrieval (2022)

  4. No Access

    Article

    2D Lyndon Words and Applications

    A Lyndon word is a primitive string which is lexicographically smallest among cyclic permutations of its characters. Lyndon words are used for constructing bases in free Lie algebras, constructing de Bruijn se...

    Shoshana Marcus, Dina Sokol in Algorithmica (2017)

  5. No Access

    Chapter and Conference Paper

    On Two-Dimensional Lyndon Words

    A Lyndon word is a primitive string which is lexicographically smallest among cyclic permutations of its characters. Lyndon words are used for constructing bases in free algebras, constructing de Bruijn sequen...

    Shoshana Marcus, Dina Sokol in String Processing and Information Retrieval (2013)