Oren Weimann Vis

*	2009
21	EE	Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann: Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248
20	EE	Erik D. Demaine, Gad M. Landau, Oren Weimann: On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353
19	EE	Oren Weimann, Raphael Yuster: Computing the Girth of a Planar Graph in O(n logn) Time. ICALP (1) 2009: 764-773
18	EE	Philip N. Klein, Shay Mozes, Oren Weimann: Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm. SODA 2009: 236-245
17	EE	Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540
16	EE	Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009)
15	EE	Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann: A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression CoRR abs/0902.2649: (2009)
14	EE	Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs CoRR abs/0909.3221: (2009)
	2008
13	EE	Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243
12	EE	Shay Mozes, Krzysztof Onak, Oren Weimann: Finding an optimal tree searching strategy in linear time. SODA 2008: 1096-1105
	2007
11	EE	Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15
10	EE	Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157
9	EE	Gad M. Landau, Dekel Tsur, Oren Weimann: Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204
8	EE	Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76
7	EE	Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game CoRR abs/cs/0703019: (2007)
6	EE	Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang: Locality and Gaps in RNA Comparison. Journal of Computational Biology 14(8): 1074-1087 (2007)
	2006
5	EE	Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257
4	EE	Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An O(n^3)-Time Algorithm for Tree Edit Distance CoRR abs/cs/0604037: (2006)
	2005
3	EE	Gad M. Landau, Laxmi Parida, Oren Weimann: Using PQ Trees for Comparative Genomics. CPM 2005: 128-143
2	EE	Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann: Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369
1	EE	Gad M. Landau, Laxmi Parida, Oren Weimann: Gene Proximity Analysis across Whole Genomes via PQ Trees1. Journal of Computational Biology 12(10): 1289-1306 (2005)

Coauthor Index

1	Rolf Backofen	[2] [5] [6] [21]
2	Jean Cardinal	[7] [8] [14]
3	Shihyen Chen	[6]
4	Erik D. Demaine	[4] [7] [8] [10] [14] [20]
5	Samuel Fiorini	[7] [8] [14]
6	Danny Hermelin	[2] [5] [6] [15] [17]
7	Gwenaël Joret	[7] [8] [14]
8	Philip N. Klein	[18]
9	Gad M. Landau	[1] [2] [3] [5] [6] [9] [15] [17] [20] [21]
10	Shir Landau	[15] [17]
11	Stefan Langerman	[7] [8]
12	Yury Lifshits	[16]
13	Mathias Möhl	[21]
14	Shay Mozes	[4] [10] [11] [12] [13] [16] [18]
15	Ilan Newman	[7] [8] [14]
16	Krzysztof Onak	[12]
17	Laxmi Parida	[1] [3]
18	Benjamin Rossman	[4] [10]
19	Mikhail A. Roytberg	[6]
20	Dekel Tsur	[9] [13] [21]
21	Raphael Yuster	[19]
22	Kaizhong Zhang	[6]
23	Michal Ziv-Ukelson	[11] [13] [16]

Colors in the list of coauthors