dblp.uni-trier.dewww.uni-trier.de

Dekel Tsur

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2007
34EEYonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39
33EEShirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Properties of Constraint-Graphs. IEEE Conference on Computational Complexity 2007: 264-277
32EEGad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204
31EEAmihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61
30EEDekel Tsur: Tree-edges deletion problems with bounded diameter obstruction sets. Discrete Applied Mathematics 155(10): 1275-1293 (2007)
29EEMartin 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)
28EEAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)
27EEGilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur: Character sets of strings. J. Discrete Algorithms 5(2): 330-340 (2007)
26EEDekel Tsur: Improved scheduling in rings. J. Parallel Distrib. Comput. 67(5): 531-535 (2007)
25EERon Shamir, Dekel Tsur: Improved algorithms for the random cluster graph model. Random Struct. Algorithms 31(4): 418-449 (2007)
2006
24EENuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner: A New Approach to Protein Identification. RECOMB 2006: 363-378
23EEDekel Tsur: Optimal Probing Patterns for Sequencing by Hybridization. WABI 2006: 366-375
22EEBaruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006)
21EEAmihood Amir, Oren Kapah, Dekel Tsur: Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006)
2005
20EEDekel Tsur: Tight Bounds for String Reconstruction Using Substring Queries. APPROX-RANDOM 2005: 448-459
19EECarmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279
18EEDekel 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
17EEMartin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262
16EEShirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur: Testing Orientation Properties Electronic Colloquium on Computational Complexity (ECCC)(153): (2005)
15EEDekel Tsur: Sequencing by hybridization with errors: handling longer sequences. Theor. Comput. Sci. 332(1-3): 559-566 (2005)
2004
14EEAmihood Amir, Oren Kapah, Dekel Tsur: Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419
13EERon Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73
12EEAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9
11EERon Shamir, Roded Sharan, Dekel Tsur: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2): 173-182 (2004)
2003
10EEDekel Tsur: Sequencing by Hybridization in Few Rounds. ESA 2003: 506-516
9EEDekel Tsur: Bounds for Resquencing by Hybridization. WABI 2003: 498-511
8EEBaruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52
2002
7EERon Shamir, Dekel Tsur: Improved Algorithms for the Random Cluster Graph Model. SWAT 2002: 230-239
6EERon 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
4EERon 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
1EERon Shamir, Dekel Tsur: Faster subtree isomorphism. ISTCS 1997: 126-131

Coauthor Index

1Amihood Amir [12] [14] [21] [28] [31]
2Yonatan Aumann [34]
3Baruch Awerbuch [8] [22]
4Yossi Azar [8] [22]
5Vineet Bafna [18]
6Nuno Bandeira [24]
7Ayelet Butman [12] [28]
8Gilles Didier [27]
9Martin Farach-Colton (Martin Farach) [17] [29]
10Ari Frank [24]
11Shirley Halevy [16] [33]
12Tzvika Hartman [31]
13Carmit Hazay [19]
14Oren Kapah [14] [21] [31]
15Oded Lachish [16] [33]
16Gad M. Landau [17] [29] [32]
17Moshe Lewenstein [12] [19] [28] [34]
18Noa Lewenstein [34]
19Ilan Newman [16] [33]
20Pavel A. Pevzner [18] [24]
21Ron Y. Pinter [13]
22Ely Porat [12] [28]
23Yossi Richter [8] [22]
24Oleg Rokhlenko [13]
25Süleyman Cenk Sahinalp [17] [29]
26Thomas Schmidt [27]
27B. Riva Shalom [31]
28Ron Shamir [1] [2] [3] [4] [5] [6] [7] [11] [25]
29Roded Sharan [6] [11]
30Jens Stoye [27]
31Stephen Tanner [18]
32Oren Weimann [32]
33Ebrahim Zandi [18]
34Michal Ziv-Ukelson [13]

Colors in the list of coauthors

Copyright © Thu Jun 5 07:42:39 2008 by Michael Ley (ley@uni-trier.de)