| 2013 | ||
|---|---|---|
| j23 | ||
| c28 | Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson: Efficient All Path Score Computations on Grid Graphs. CPM 2013: 211-222 | |
| 2011 | ||
| j22 | Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms for Molecular Biology 6: 20 (2011) | |
| j21 | Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9(1): 2-11 (2011) | |
| j20 | Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms 9(1): 12-31 (2011) | |
| j19 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding witnesses by peeling. ACM Transactions on Algorithms 7(2): 24 (2011) | |
| c27 | Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Edit Distance with Duplications and Contractions Revisited. CPM 2011: 441-454 | |
| 2010 | ||
| j18 | ||
| j17 | ||
| c26 | Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications 2010: 158-169 | |
| c25 | Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson: Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. WABI 2010: 65-77 | |
| 2009 | ||
| j16 | Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410(43): 4303-4314 (2009) | |
| c24 | Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248 | |
| c23 | Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA Folding: Time and Space Efficient Algorithms. CPM 2009: 249-262 | |
| 2008 | ||
| j15 | Dekel Tsur: Faster algorithms for guided tree edit distance. Inf. Process. Lett. 108(4): 251-254 (2008) | |
| j14 | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008) | |
| j13 | Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008) | |
| c22 | Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243 | |
| 2007 | ||
| j12 | Dekel Tsur: Tree-edges deletion problems with bounded diameter obstruction sets. Discrete Applied Mathematics 155(10): 1275-1293 (2007) | |
| j11 | Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73(7): 1035-1044 (2007) | |
| j10 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) | |
| j9 | Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur: Character sets of strings. J. Discrete Algorithms 5(2): 330-340 (2007) | |
| j8 | ||
| j7 | Ron Shamir, Dekel Tsur: Improved algorithms for the random cluster graph model. Random Struct. Algorithms 31(4): 418-449 (2007) | |
| c21 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. IEEE Conference on Computational Complexity 2007: 264-277 | |
| c20 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39 | |
| c19 | Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61 | |
| c18 | Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204 | |
| i2 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(054) (2007) | |
| 2006 | ||
| j6 | Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006) | |
| j5 | Amihood Amir, Oren Kapah, Dekel Tsur: Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006) | |
| c17 | Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner: A New Approach to Protein Identification. RECOMB 2006: 363-378 | |
| c16 | ||
| 2005 | ||
| j4 | Dekel Tsur: Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005) | |
| c15 | Dekel Tsur: Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM 2005: 448-459 | |
| c14 | Carmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279 | |
| c13 | Dekel Tsur, Stephen Tanner, Ebrahim Zandi, Vineet Bafna, Pavel A. Pevzner: Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. CSB 2005: 157-166 | |
| c12 | Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262 | |
| i1 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Orientation Properties. Electronic Colloquium on Computational Complexity (ECCC)(153) (2005) | |
| 2004 | ||
| j3 | Ron Shamir, Roded Sharan, Dekel Tsur: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2): 173-182 (2004) | |
| c11 | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73 | |
| c10 | Amihood Amir, Oren Kapah, Dekel Tsur: Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419 | |
| c9 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 | |
| 2003 | ||
| c8 | ||
| c7 | ||
| c6 | Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52 | |
| 2002 | ||
| j2 | Ron Shamir, Dekel Tsur: Large Scale Sequencing by Hybridization. Journal of Computational Biology 9(2): 413-428 (2002) | |
| c5 | ||
| c4 | ||
| 2001 | ||
| c3 | ||
| 1999 | ||
| j1 | ||
| 1998 | ||
| c2 | Ron Shamir, Dekel Tsur: The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). SODA 1998: 394-399 | |
| 1997 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sun May 19 13:25:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page