Oren Weimann

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2013
25Unified Compression-Based Acceleration of Edit-Distance Computation. Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann. Algorithmica (65): 339-353 (2013). Web SearchBibTeXDownload
24Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann. CoRR (abs/1301.6127) (2013). Web SearchBibTeXDownload
23The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann. J. Comb. Optim. (25): 19-46 (2013). Web SearchBibTeXDownload
2012
22On Approximating String Selection Problems with Outliers. Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann. CoRR (abs/1202.2820) (2012). Web SearchBibTeXDownload
2011
21The Stackelberg Minimum Spanning Tree Game. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann. Algorithmica (59): 129-144 (2011). Web SearchBibTeXDownload
20Optimal Packed String Matching. Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann. FSTTCS 2011, 423-432. Web SearchBibTeXDownload
19Fast RNA structure alignment for crossing input structures. Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann. J. Discrete Algorithms (9): 2-11 (2011). Web SearchBibTeXDownload
18Random Access to grammar-Compressed Strings. Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann. SODA 2011, 373-389. Web SearchBibTeXDownload
2010
17Indexing a Dictionary for Subset Matching Queries. Gad M. Landau, Dekel Tsur, Oren Weimann. Algorithms and Applications 2010, 158-169. Web SearchBibTeXDownload
16Random Access to Grammar Compressed Strings. Philip Bille, Gad M. Landau, Oren Weimann. CoRR (abs/1001.1565) (2010). Web SearchBibTeXDownload
15Unified Compression-Based Acceleration of Edit-Distance Computation. Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann. CoRR (abs/1004.1194) (2010). Web SearchBibTeXDownload
2009
14An optimal decomposition algorithm for tree edit distance. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. ACM Transactions on Algorithms (6) (2009). Web SearchBibTeXDownload
13The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann. CoRR (abs/0909.3221) (2009). Web SearchBibTeXDownload
12Fast RNA Structure Alignment for Crossing Input Structures. Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann. CPM 2009, 236-248. Web SearchBibTeXDownload
11On Cartesian Trees and Range Minimum Queries. Erik D. Demaine, Gad M. Landau, Oren Weimann. ICALP (1) 2009, 341-353. Web SearchBibTeXDownload
10A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann. STACS (abs/0902.2649): 529-540 (2009). Web SearchBibTeXDownload
2007
9An Optimal Decomposition Algorithm for Tree Edit Distance. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. ICALP 2007, 146-157. Web SearchBibTeXDownload
8Locality and Gaps in RNA Comparison. Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang. Journal of Computational Biology (14): 1074-1087 (2007). Web SearchBibTeXDownload
7Indexing a Dictionary for Subset Matching Queries. Gad M. Landau, Dekel Tsur, Oren Weimann. SPIRE 2007, 195-204. Web SearchBibTeXDownload
6The Stackelberg Minimum Spanning Tree Game. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann. WADS 2007, 64-76. Web SearchBibTeXDownload
2006
5An O(n^3)-Time Algorithm for Tree Edit Distance. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. CoRR (abs/cs/0604037) (2006). Web SearchBibTeXDownload
4Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann. CPM 2006, 246-257. Web SearchBibTeXDownload
2005
3Using PQ Trees for Comparative Genomics. Gad M. Landau, Laxmi Parida, Oren Weimann. CPM 2005, 128-143. Web SearchBibTeXDownload
2Gene Proximity Analysis across Whole Genomes via PQ Trees1. Gad M. Landau, Laxmi Parida, Oren Weimann. Journal of Computational Biology (12): 1289-1306 (2005). Web SearchBibTeXDownload
1Normalized Similarity of RNA Sequences. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann. SPIRE 2005, 360-369. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research