Skip to main content

13 Result(s)

within Article Remove this filter Amihood Amir Remove this filter

and

  1. Article

    Open Access

    On the Practical Power of Automata in Pattern Matching

    Many papers in the intersection of theoretical and applied algorithms show that the simple, asymptotically less efficient algorithm, performs better than the bestcomplex theoretical algorithms on random data o...

    Ora Amir, Amihood Amir, Aviezri Fraenkel, David Sarne in SN Computer Science (2024)

    Download PDF (1721 KB) View Article

  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

    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)

  4. Article

    Open Access

    Dynamic and Internal Longest Common Substring

    Given two strings S and T, each of length at most n, the longest common substring (LCS) problem is to find a longest substring common to S and T. This is a classical problem in computer science with an $$\mathca...

    Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis… in Algorithmica (2020)

    Download PDF (4253 KB) View Article

  5. No Access

    Article

    Can We Recover the Cover?

    Data analysis typically involves error recovery and detection of regularities as two different key tasks. In this paper we show that there are data types for which these two tasks can be powerfully combined. A co...

    Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat in Algorithmica (2019)

  6. No Access

    Article

    Mind the Gap!

    We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess a dictionary D of d patterns, where each pattern contains a special gap symbol that can m...

    Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat… in Algorithmica (2019)

  7. No Access

    Article

    On Representations of Ternary Order Relations in Numeric Strings

    Order-preserving matching is a string matching problem of two numeric strings where the relative orders of consecutive substrings are matched instead of the characters themselves. The order relation between tw...

    **il Kim, Amihood Amir, Joong Chae Na, Kunsoo Park… in Mathematics in Computer Science (2017)

  8. No Access

    Article

    Configurations and Minority in the String Consensus Problem

    The Closest String Problem is defined as follows. Let \(S\) S ...

    Amihood Amir, Haim Paryenty, Liam Roditty in Algorithmica (2016)

  9. No Access

    Article

    Faster Two Dimensional Scaled Matching

    The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, ...

    Amihood Amir, Eran Chencinski in Algorithmica (2010)

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

  11. No Access

    Article

    Swap and mismatch edit distance

    There is no known algorithm that solves the general case of theapproximate string matching problem with the extended edit distance, where the edit operations are: insertion, deletion, mismatch and swap, in timeo(

    Amihood Amir, Estrella Eisenberg, Ely Porat in Algorithmica (2006)

  12. No Access

    Article

    Maximal Association Rules: A Tool for Mining Associations in Text

    We describe a new tool for mining association rules, which is of special value in text mining. The new tool, called maximal associations, is geared toward discovering associations that are frequently lost when us...

    Amihood Amir, Yonatan Aumann, Ronen Feldman… in Journal of Intelligent Information Systems (2005)

  13. No Access

    Article

    Efficient matching of nonrectangular shapes

    Most known two-dimensional matching algorithms have a rectangular text (image) and rectangular pattern (template) as their input. These matching algorithms perform a row by row analysis followed by some column...

    Amihood Amir, Martin Farach in Annals of Mathematics and Artificial Intelligence (1991)