Follow
Dekel Tsur
Dekel Tsur
Department of Computer Science, Ben-Gurion University of the Negev
Verified email at cs.bgu.ac.il
Title
Cited by
Cited by
Year
Cluster graph modification problems
R Shamir, R Sharan, D Tsur
Discrete Applied Mathematics 144 (1-2), 173-182, 2004
4582004
Identification of post-translational modifications via blind search of mass-spectra
D Tsur, S Tanner, E Zandi, V Bafna, PA Pevzner
2005 IEEE Computational Systems Bioinformatics Conference (CSB'05), 157-166, 2005
3612005
Faster subtree isomorphism
R Shamir, D Tsur
Journal of Algorithms 33 (2), 267-280, 1999
2121999
Protein identification by spectral networks analysis
N Bandeira, D Tsur, A Frank, PA Pevzner
Proceedings of the National Academy of Sciences 104 (15), 6140-6145, 2007
2092007
Tradeoffs in worst-case equilibria
B Awerbuch, Y Azar, Y Richter, D Tsur
Theoretical Computer Science 361 (2-3), 200-209, 2006
1132006
Sparse RNA folding: Time and space efficient algorithms
R Backofen, D Tsur, S Zakov, M Ziv-Ukelson
Journal of Discrete Algorithms 9 (1), 12-31, 2011
812011
Approximate labelled subtree homeomorphism
RY Pinter, O Rokhlenko, D Tsur, M Ziv-Ukelson
Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul …, 2004
60*2004
Faster two-dimensional pattern matching with rotations
A Amir, O Kapah, D Tsur
Theoretical Computer Science 368 (3), 196-204, 2006
542006
Approximate string matching using a bidirectional index
G Kucherov, K Salikhov, D Tsur
Theoretical Computer Science 638, 145-158, 2016
482016
Character sets of strings
G Didier, T Schmidt, J Stoye, D Tsur
Journal of Discrete Algorithms 5 (2), 330-340, 2007
452007
Large scale sequencing by hybridization
R Shamir, D Tsur
Proceedings of the fifth annual international conference on Computational …, 2001
402001
Optimal spaced seeds for faster approximate string matching
M Farach-Colton, GM Landau, SC Sahinalp, D Tsur
Journal of Computer and System Sciences 73 (7), 1035-1044, 2007
382007
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approach
S Zakov, D Tsur, M Ziv-Ukelson
Algorithms for Molecular Biology 6, 1-22, 2011
322011
Generalized lcs
A Amir, T Hartman, O Kapah, BR Shalom, D Tsur
Theoretical computer science 409 (3), 438-449, 2008
312008
Parameterized algorithm for 3-path vertex cover
D Tsur
Theoretical Computer Science 783, 1-8, 2019
302019
Method for identification and sequencing of proteins
PA Pevzner, NFC Bandeira, D Tsur
US Patent 8,457,900, 2013
302013
Testing properties of constraint-graphs
S Halevy, O Lachish, I Newman, D Tsur
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
28*2007
Top-k document retrieval in optimal space
D Tsur
Information Processing Letters 113 (12), 440-443, 2013
272013
Faster deterministic parameterized algorithm for k-path
D Tsur
Theoretical Computer Science 790, 96-104, 2019
252019
Faster parameterized algorithm for Cluster Vertex Deletion
D Tsur
Theory of Computing Systems, 2021
242021
The system can't perform the operation now. Try again later.
Articles 1–20