Skip to main content

10 Result(s)

within Ayelet Butman Remove this filter

and

  1. 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)

  2. No Access

    Article

    Multidimensional Period Recovery

    Multidimensional data are widely used in real-life applications. Intel’s new brand of SSDs, called 3D XPoint, is an example of three-dimensional data. Motivated by a structural analysis of multidimensional dat...

    Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol in Algorithmica (2022)

  3. No Access

    Chapter and Conference Paper

    Multidimensional Period Recovery

    Multidimensional data are widely used in real-life applications. Intel’s new brand of SSDs, called 3D XPoint, is an example of three-dimensional data. Motivated by a structural analysis of multidimensional dat...

    Amihood Amir, Ayelet Butman… in String Processing and Information Retrieval (2020)

  4. No Access

    Chapter and Conference Paper

    Permuted Scaled Matching

    Scaled matching and permutation matching are two well known paradigms in the domain of pattern matching. Scaled matching refers to finding an occurrence of a pattern which is enlarged proportionally by some sc...

    Ayelet Butman, Noa Lewenstein, J. Ian Munro in Combinatorial Pattern Matching (2014)

  5. No Access

    Article

    Real Two Dimensional Scaled Matching

    Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Scaled matching ...

    Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat in Algorithmica (2009)

  6. No Access

    Chapter and Conference Paper

    Jump-Matching with Errors

    Two equal-length integer-value strings jump-match if each of their corresponding (locationwise) elements differ by the same value d. In Jump matching one seeks all text substrings which jump-match the pattern. St...

    Ayelet Butman, Noa Lewenstein, Benny Porat… in String Processing and Information Retrieval (2007)

  7. No Access

    Chapter and Conference Paper

    Efficient One Dimensional Real Scaled Matching

    Real Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled ma...

    Amihood Amir, Ayelet Butman… in String Processing and Information Retrieval (2004)

  8. No Access

    Chapter and Conference Paper

    Permuted and Scaled String Matching

    The goal of scaled permuted string matching is to find all occurrences of a pattern in a text, in all possible scales and permutations. Given a text of length n and a pattern of length m we present an O(n) algori...

    Ayelet Butman, Revital Eres, Gad M. Landau in String Processing and Information Retrieval (2004)

  9. No Access

    Chapter and Conference Paper

    Two-Dimensional Pattern Matching with Rotations

    The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such diffe...

    Amihood Amir, Ayelet Butman, Maxime Crochemore… in Combinatorial Pattern Matching (2003)

  10. No Access

    Chapter and Conference Paper

    Real Two Dimensional Scaled Matching

    Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Scaled matching is ...

    Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat in Algorithms and Data Structures (2003)