#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1996

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ely Porat, Amir Rothschild
- IEEE Transactions on Information Theory
- 2008

Group testing is a long studied problem in combinatorics: A small set of <i>r</i> ill people should be identified out of the whole (<i>n</i> people) by using only queries (tests) of the form “Does set X contain an ill human?” In this paper we provide an explicit construction of a testing scheme which is better (smaller) than any known explicit… (More)

We give the first non-trivial algorithms for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with at most k mismatches. We first give an O(n(k + log n log log n) log m) time randomised… (More)

- Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
- Search Methodologies
- 2009

We present solutions for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with at most k mismatches. We first give an Θ (n(k + log m log k) log n) time randomised algorithm which finds… (More)

- Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
- SODA
- 2009

We consider the classic problem of pattern matching with few mismatches in the presence of promiscuously matching wildcard symbols. Given a text t of length n and a pattern p of length m with optional wildcard symbols and a bound k, our algorithm finds all the alignments for which the pattern matches the text with Hamming distance at most k and also returns… (More)

- Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
- SPIRE
- 2008

We consider the well known problem of pattern matching under the Hamming distance. Previous approaches have shown how to count the number of mismatches efficiently especially, when a bound is known for the maximum Hamming distance. Our interest is different in that we wish collect a random sample of mismatches of fixed size at each position in the text.… (More)

- A Rothschild, F A Wald, S N Bocca, J S Tandecarz
- Cellular and molecular biology
- 1996

UDP-glucose: protein transglucosylase (UPTG, EC 2.4.1.112) catalyzes the first step of protein-bound alpha-glucan synthesis in potato tuber and developing maize endosperm. The presence of a non-dialyzable, heat labile protein responsible for low levels of UPTG activity in developing maize endosperm was investigated. UPTG activity in 5-day old maize… (More)

- F A Wald, A Rothschild, S Moreno, J S Tandecarz
- Cellular and molecular biology
- 1998

A thermolabile UPTG inhibitor protein (IP) was isolated and purified from a developing maize endosperm preparation. High homology of two internal peptides of IP with known plant sucrose synthase (SS) sequences suggested that IP might be related somehow with SS. IP and SS activities were found in the same preparation and showed thermolability between 60-65… (More)

- Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild
- ArXiv
- 2008

This paper presents a new technique for deterministic length reduction. This technique improves the running time of the algorithm presented in [?] for performing fast convolution in sparse data. While the regular fast convolution of vectors V 1 , V 2 whose sizes are N 1 , N 2 respectively, takes O(N 1 log N 2) using FFT, using the new technique for length… (More)

- Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild
- ArXiv
- 2014

Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many applications and are efficiently solved. In the last decade, several problems required efficient solution of sparse binary convolutions. Both randomized and deterministic algorithms… (More)

- ‹
- 1
- ›