Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Tsur, Dekel - Department of Computer Science, Ben-Gurion University
Improved Scheduling in Rings Dekel Tsur
Cluster Graph Modification Problems Roded Sharan
Faster algorithms for guided tree edit distance The guided tree edit distance problem is to find a minimum cost series of edit operations
Faster Two Dimensional Pattern Matching with Rotations Amihood Amir
Generalized LCS Amihood Amir
Two Dimensional Parameterized Matching Richard Cole
Bounds for Resequencing By Hybridization We study the problem of finding the sequence of an unknown DNA
Sequencing by Hybridization in Few Rounds Sequencing by Hybridization (SBH) is a method for reconstructing an un-
Approximate Labelled Subtree Homeomorphism Ron Y. Pinter
Fast Algorithms for Computing Tree LCS Oren Weimann
A New Approach to Protein Identification Nuno Bandeira, Dekel Tsur, Ari Frank, and Pavel Pevzner
Testing Properties of Constraint-Graphs Extended Abstract + Appendix
Sparse RNA Folding: Time and Space Efficient Rolf Backofen1
Indexing a Dictionary for Subset Matching Queries Gad M. Landau
Optimal Probing Patterns for Sequencing By Hybridization
Fast RNA Structure Alignment for Crossing Input Rolf Backofena
Tradeoffs in worst-case equilibria Baruch Awerbuch
Faster Subtree Isomorphism Ron Shamir Dekel Tsur
The maximum subforest problem: Approximation and exact algorithms
Large Scale Sequencing By Hybridization Sequencing by Hybridization is a method for reconstructing a DNA
Efficient One Dimensional Real Scaled Matching Amihood Amir
Sequencing by Hybridization with Errors: Handling Longer Sequences
Optimal spaced seeds for faster approximate string Martin Farach-Colton
Tight bounds for string reconstruction using substring queries We resolve two open problems presented in [8]. First, we consider the problem of recon-
Character sets of strings Gilles Didier a
Finding Witnesses by Peeling Yonatan Aumann
Fast index for approximate string matching We present an index that stores a text of length n such that given a
REDUCING THE WORST CASE RUNNING TIMES OF A FAMILY OF RNA AND CFG PROBLEMS, USING VALIANT'S