| 2008 |
|---|
| 10 | EE | Shay Mozes,
Krzysztof Onak,
Oren Weimann:
Finding an optimal tree searching strategy in linear time.
SODA 2008: 1096-1105 |
| 2007 |
|---|
| 9 | EE | Shay Mozes,
Oren Weimann,
Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
CPM 2007: 4-15 |
| 8 | EE | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance.
ICALP 2007: 146-157 |
| 7 | EE | Gad M. Landau,
Dekel Tsur,
Oren Weimann:
Indexing a Dictionary for Subset Matching Queries.
SPIRE 2007: 195-204 |
| 6 | 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 |
| 5 | 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) |
| 2006 |
|---|
| 4 | EE | Rolf Backofen,
Danny Hermelin,
Gad M. Landau,
Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes.
CPM 2006: 246-257 |
| 3 | 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 |
|---|
| 2 | EE | Gad M. Landau,
Laxmi Parida,
Oren Weimann:
Using PQ Trees for Comparative Genomics.
CPM 2005: 128-143 |
| 1 | EE | Rolf Backofen,
Danny Hermelin,
Gad M. Landau,
Oren Weimann:
Normalized Similarity of RNA Sequences.
SPIRE 2005: 360-369 |
