2009 |
16 | EE | Philip 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 |
15 | 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 |
14 | 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) |
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) |