#### Filter Results:

- Full text PDF available (45)

#### Publication Year

1997

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ron Shamir, Roded Sharan, Dekel Tsur
- WG
- 2002

In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets. From a graph theoretic point of view, a cluster graph is a vertex-disjoint union of cliques. The clustering problem is the task of making fewest changes to the edge set of an input graph so that it becomes a cluster graph. We study the complexity of… (More)

- Dekel Tsur, Stephen Tanner, Ebrahim Zandi, Vineet Bafna, Pavel A. Pevzner
- 2005 IEEE Computational Systems Bioinformatics…
- 2005

Post-translational modifications (PTMs) are of great biological importance. Most existing approaches perform a restrictive search that can only take into account a few types of PTMs and ignore all others. We describe an unrestrictive PTM search algorithm that searches for all types of PTMs at once in a blind mode, i.e., without knowing which PTMs exist in a… (More)

- Ron Shamir, Dekel Tsur
- J. Algorithms
- 1997

We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O( k1:5 logkn)time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k1:5n) algorithms of Chung and Matula. We also give a… (More)

- Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
- J. Discrete Algorithms
- 2009

Article history: Available online 17 September 2010

- Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur
- J. Discrete Algorithms
- 2007

Given a string S over a finite alphabet Σ, the character set (also called the fingerprint) of a substring S′ of S is the subset C ⊆ Σ of the symbols occurring in S′. The study of the character sets of all the substrings of a given string (or a given collection of strings) appears in several domains such as rule induction for natural language processing or… (More)

- Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
- WAOA
- 2003

We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsoupias and Papadimitriou to measure the performance degradation due to the lack of a centralized traffic regulating authority. We provide a full characterization of the worst-case… (More)

- Ron Shamir, Dekel Tsur
- SWAT
- 2002

The following probabilistic process models the generation of noisy clustering data: Clusters correspond to disjoint sets of vertices in a graph. Each two vertices from the same set are connected by an edge with probability p, and each two vertices from different sets are connected by an edge with probability r < p. The goal of the clustering problem is to… (More)

- Dekel Tsur
- Inf. Process. Lett.
- 2013

We present an index for top-k most frequent document retrieval whose space is |CSA|+o(n)+D log n D+O(D) bits, and its query time is O(log k log 2+ n) per reported document, where D is the number of documents, n is the sum of lengths of the documents, and |CSA| is the space of the compressed suffix array for the documents. This improves over previous results… (More)

- Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
- SPIRE
- 2004

Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision. In this paper, we present a new, more precise and realistic, definition for one dimensional real… (More)

Given two undirected trees T and P , the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as repeatedly removing a degree-2 node and adding the edge joining its two neighbors. In this paper we extend the Subtree Homeomorphism Problem to a new optimization problem by… (More)