 | 2009 |
|---|
| 11 |       | 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 |
| 10 | | Crystal L. Kahn,
Shay Mozes,
Benjamin J. Raphael:
Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes.
WABI 2009: 169-180 |
| 9 | | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An optimal decomposition algorithm for tree edit distance.
ACM Transactions on Algorithms 6(1): (2009) |
| 8 | | 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) |
| 7 | | Shay Mozes,
Christian Wulff-Nilsen:
Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time
CoRR abs/0911.4963: (2009) |
| 6 | | Shay Mozes,
Dekel Tsur,
Oren Weimann,
Michal Ziv-Ukelson:
Fast algorithms for computing tree LCS.
Theor. Comput. Sci. 410(43): 4303-4314 (2009) |
| 2008 |
|---|
| 5 | | Shay Mozes,
Dekel Tsur,
Oren Weimann,
Michal Ziv-Ukelson:
Fast Algorithms for Computing Tree LCS.
CPM 2008: 230-243 |
| 4 | | Shay Mozes,
Krzysztof Onak,
Oren Weimann:
Finding an optimal tree searching strategy in linear time.
SODA 2008: 1096-1105 |
| 2007 |
|---|
| 3 | | Shay Mozes,
Oren Weimann,
Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.
CPM 2007: 4-15 |
| 2 | | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance.
ICALP 2007: 146-157 |
| 2006 |
|---|
| 1 | | Erik D. Demaine,
Shay Mozes,
Benjamin Rossman,
Oren Weimann:
An O(n^3)-Time Algorithm for Tree Edit Distance
CoRR abs/cs/0604037: (2006) |
