Dekel Tsur
Dekel Tsur
Department of Computer Science, Ben-Gurion University of the Negev
כתובת אימייל מאומתת בדומיין
צוטט על ידי
צוטט על ידי
Cluster graph modification problems
R Shamir, R Sharan, D Tsur
Discrete Applied Mathematics 144 (1-2), 173-182, 2004
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
Faster subtree isomorphism
R Shamir, D Tsur
Journal of Algorithms 33 (2), 267-280, 1999
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
Tradeoffs in worst-case equilibria
B Awerbuch, Y Azar, Y Richter, D Tsur
Theoretical Computer Science 361 (2-3), 200-209, 2006
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
Approximate labelled subtree homeomorphism
RY Pinter, O Rokhlenko, D Tsur, M Ziv-Ukelson
Annual Symposium on Combinatorial Pattern Matching, 59-73, 2004
Faster two-dimensional pattern matching with rotations
A Amir, O Kapah, D Tsur
Theoretical Computer Science 368 (3), 196-204, 2006
Character sets of strings
G Didier, T Schmidt, J Stoye, D Tsur
Journal of Discrete Algorithms 5 (2), 330-340, 2007
Large scale sequencing by hybridization
R Shamir, D Tsur
Proceedings of the fifth annual international conference on Computational …, 2001
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
Approximate string matching using a bidirectional index
G Kucherov, K Salikhov, D Tsur
Theoretical Computer Science 638, 145-158, 2016
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
International Workshop on Algorithms in Bioinformatics, 65-77, 2010
Generalized LCS
A Amir, T Hartman, O Kapah, BR Shalom, D Tsur
Theoretical computer science 409 (3), 438-449, 2008
Top-k document retrieval in optimal space
D Tsur
Information Processing Letters 113 (12), 440-443, 2013
Testing properties of constraint-graphs
S Halevy, O Lachish, I Newman, D Tsur
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
Two dimensional parameterized matching
C Hazay, M Lewenstein, D Tsur
Annual Symposium on Combinatorial Pattern Matching, 266-279, 2005
Improved algorithms for the random cluster graph model
R Shamir, D Tsur
Scandinavian Workshop on Algorithm Theory, 230-239, 2002
Method for identification and sequencing of proteins
PA Pevzner, NFC Bandeira, D Tsur
US Patent 8,457,900, 2013
The maximum subforest problem: Approximation and exact algorithms
R Shamir, D Tsur
Symposium on Discrete Algorithms: Proceedings of the ninth annual ACM-SIAM …, 1998
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20