Search the dblp DataBase

Publications of Author

1. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
   Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. [Citation Graph (0, 0)][DBLP]
   CPM, 2006, pp:246-257 [Conf]
   
2. Gad M. Landau, Laxmi Parida, Oren Weimann
   Using PQ Trees for Comparative Genomics. [Citation Graph (0, 0)][DBLP]
   CPM, 2005, pp:128-143 [Conf]
   
3. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
   Normalized Similarity of RNA Sequences. [Citation Graph (0, 0)][DBLP]
   SPIRE, 2005, pp:360-369 [Conf]
   
4. Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
   Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. [Citation Graph (0, 0)][DBLP]
   CPM, 2007, pp:4-15 [Conf]
   
5. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
   An Optimal Decomposition Algorithm for Tree Edit Distance. [Citation Graph (0, 0)][DBLP]
   ICALP, 2007, pp:146-157 [Conf]
   
6. Gad M. Landau, Dekel Tsur, Oren Weimann
   Indexing a Dictionary for Subset Matching Queries. [Citation Graph (0, 0)][DBLP]
   SPIRE, 2007, pp:195-204 [Conf]
   
7. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
   The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP]
   WADS, 2007, pp:64-76 [Conf]
   
8. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
   The Stackelberg Minimum Spanning Tree Game [Citation Graph (0, 0)][DBLP]
   CoRR, 2007, v:0, n:, pp:- [Journal]
   
9. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
   An O(n^3)-Time Algorithm for Tree Edit Distance [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
10. 
    Indexing a Dictionary for Subset Matching Queries. [Citation Graph (, )][DBLP]
    
    
11. 
    Fast Algorithms for Computing Tree LCS. [Citation Graph (, )][DBLP]
    
    
12. 
    Fast RNA Structure Alignment for Crossing Input Structures. [Citation Graph (, )][DBLP]
    
    
13. 
    Computing the Girth of a Planar Graph in O(n logn) Time. [Citation Graph (, )][DBLP]
    
    
14. 
    On Cartesian Trees and Range Minimum Queries. [Citation Graph (, )][DBLP]
    
    
15. 
    Finding an optimal tree searching strategy in linear time. [Citation Graph (, )][DBLP]
    
    
16. 
    Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log² n)-time algorithm. [Citation Graph (, )][DBLP]
    
    
17. 
    A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. [Citation Graph (, )][DBLP]
    
    
18. 
    The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. [Citation Graph (, )][DBLP]
    
    
20. 
    A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression [Citation Graph (, )][DBLP]
    
    
21. 
    The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]
    
    
22. 
    Random Access to Grammar Compressed Strings [Citation Graph (, )][DBLP]
    
    
23. 
    Unified Compression-Based Acceleration of Edit-Distance Computation [Citation Graph (, )][DBLP]