| Cluster graph modification problems R Shamir, R Sharan, D Tsur Discrete Applied Mathematics 144 (1-2), 173-182, 2004 | 341 | 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 | 331 | 2005 |
| Faster subtree isomorphism R Shamir, D Tsur Proceedings of the Fifth Israeli symposium on theory of computing and …, 1997 | 189 | 1997 |
| 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 | 182* | 2007 |
| Tradeoffs in worst-case equilibria B Awerbuch, Y Azar, Y Richter, D Tsur Theoretical Computer Science 361 (2-3), 200-209, 2006 | 105 | 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 | 66 | 2011 |
| Approximate labelled subtree homeomorphism RY Pinter, O Rokhlenko, D Tsur, M Ziv-Ukelson Annual Symposium on Combinatorial Pattern Matching, 59-73, 2004 | 58* | 2004 |
| Faster two-dimensional pattern matching with rotations A Amir, O Kapah, D Tsur Theoretical Computer Science 368 (3), 196-204, 2006 | 50 | 2006 |
| Character sets of strings G Didier, T Schmidt, J Stoye, D Tsur Journal of Discrete Algorithms 5 (2), 330-340, 2007 | 41 | 2007 |
| Large scale sequencing by hybridization R Shamir, D Tsur Journal of Computational Biology 9 (2), 413-428, 2002 | 35 | 2002 |
| 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 | 34 | 2007 |
| Approximate string matching using a bidirectional index G Kucherov, K Salikhov, D Tsur Theoretical Computer Science 638, 145-158, 2016 | 27 | 2016 |
| Generalized LCS A Amir, T Hartman, O Kapah, BR Shalom, D Tsur Theoretical Computer Science 409 (3), 438-449, 2008 | 25 | 2008 |
| 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 | 24 | 2010 |
| Testing properties of constraint-graphs S Halevy, O Lachish, I Newman, D Tsur Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007 | 23* | 2007 |
| Top-k document retrieval in optimal space D Tsur Information Processing Letters 113 (12), 440-443, 2013 | 20 | 2013 |
| Two dimensional parameterized matching C Hazay, M Lewenstein, D Tsur Annual Symposium on Combinatorial Pattern Matching, 266-279, 2005 | 18* | 2005 |
| Improved algorithms for the random cluster graph model R Shamir, D Tsur Scandinavian Workshop on Algorithm Theory, 230-239, 2002 | 17 | 2002 |
| The maximum subforest problem: Approximation and exact algorithms R Shamir, D Tsur Symposium on Discrete Algorithms: Proceedings of the ninth annual ACM-SIAM …, 1998 | 17 | 1998 |
| Fast index for approximate string matching D Tsur Journal of Discrete Algorithms 8 (4), 339-345, 2010 | 14 | 2010 |
