| 2009 | ||
|---|---|---|
| 41 | Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248 | |
| 40 | Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA Folding: Time and Space Efficient Algorithms. CPM 2009: 249-262 | |
| 2008 | ||
| 39 | Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243 | |
| 38 | Dekel Tsur: Faster algorithms for guided tree edit distance. Inf. Process. Lett. 108(4): 251-254 (2008) | |
| 37 | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008) | |
| 36 | Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008) | |
| 2007 | ||
| 35 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39 | |
| 34 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. IEEE Conference on Computational Complexity 2007: 264-277 | |
| 33 | Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204 | |
| 32 | Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61 | |
| 31 | Dekel Tsur: Tree-edges deletion problems with bounded diameter obstruction sets. Discrete Applied Mathematics 155(10): 1275-1293 (2007) | |
| 30 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(054): (2007) | |
| 29 | 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) | |
| 28 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) | |
| 27 | Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur: Character sets of strings. J. Discrete Algorithms 5(2): 330-340 (2007) | |
| 26 | Dekel Tsur: Improved scheduling in rings. J. Parallel Distrib. Comput. 67(5): 531-535 (2007) | |
| 25 | Ron Shamir, Dekel Tsur: Improved algorithms for the random cluster graph model. Random Struct. Algorithms 31(4): 418-449 (2007) | |
| 2006 | ||
| 24 | Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner: A New Approach to Protein Identification. RECOMB 2006: 363-378 | |
| 23 | Dekel Tsur: Optimal Probing Patterns for Sequencing by Hybridization. WABI 2006: 366-375 | |
| 22 | Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006) | |
| 21 | Amihood Amir, Oren Kapah, Dekel Tsur: Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006) | |
| 2005 | ||
| 20 | Dekel Tsur: Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM 2005: 448-459 | |
| 19 | Carmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279 | |
| 18 | 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 | |
| 17 | Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262 | |
| 16 | Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Orientation Properties Electronic Colloquium on Computational Complexity (ECCC)(153): (2005) | |
| 15 | Dekel Tsur: Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005) | |
| 2004 | ||
| 14 | Amihood Amir, Oren Kapah, Dekel Tsur: Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419 | |
| 13 | Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73 | |
| 12 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 | |
| 11 | Ron Shamir, Roded Sharan, Dekel Tsur: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2): 173-182 (2004) | |
| 2003 | ||
| 10 | Dekel Tsur: Sequencing by Hybridization in Few Rounds. ESA 2003: 506-516 | |
| 9 | Dekel Tsur: Bounds for Resquencing by Hybridization. WABI 2003: 498-511 | |
| 8 | Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52 | |
| 2002 | ||
| 7 | Ron Shamir, Dekel Tsur: Improved Algorithms for the Random Cluster Graph Model. SWAT 2002: 230-239 | |
| 6 | Ron Shamir, Roded Sharan, Dekel Tsur: Cluster Graph Modification Problems. WG 2002: 379-390 | |
| 5 | Ron Shamir, Dekel Tsur: Large Scale Sequencing by Hybridization. Journal of Computational Biology 9(2): 413-428 (2002) | |
| 2001 | ||
| 4 | Ron Shamir, Dekel Tsur: Large scale sequencing by hybridization. RECOMB 2001: 269-277 | |
| 1999 | ||
| 3 | Ron Shamir, Dekel Tsur: Faster Subtree Isomorphism. J. Algorithms 33(2): 267-280 (1999) | |
| 1998 | ||
| 2 | Ron Shamir, Dekel Tsur: The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). SODA 1998: 394-399 | |
| 1997 | ||
| 1 | Ron Shamir, Dekel Tsur: Faster subtree isomorphism. ISTCS 1997: 126-131 | |