List of publications

Conference papers

Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes. Crystal Kahn, Shay Mozes and Ben Raphael. In Proceedings of the 9th International Workshop (WABI 2009).
Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log^2 n)-Time Algorithm. Philip Klein, Shay Mozes and Oren Weimann. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 236-245.
Fast Algorithms for Computing Tree LCS. Shay Mozes, Dekel Tsur , Oren Weimann and Michal Ziv-Ukelson. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM 2008), pages 230-243.
Finding an Optimal Tree Searching Strategy in Linear Time. Shay Mozes, Krzysztof Onak and Oren Weimann. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pages 1096-1105. comment
Recipient of the CPM 2007 best paper award:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Shay Mozes, Oren Weimann and Michal Ziv-Ukelson. In Proceedings of the 18th annual symposium on Combinatorial Pattern Matching (CPM 2007), pages 4-15. C++/Java Implementation
An Optimal Decomposition Algorithm for Tree Edit Distance. Erik Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), pages 146-157. arXiv:cs.ds/0604037

Efficient Algorithms for Analyzing Segmental Duplications with Deletions and Inversions in Genomes . Crystal Kahn, Shay Mozes and Ben Raphael. Submitted.
Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log^2 n)-Time Algorithm. Philip Klein, Shay Mozes and Oren Weimann. Invited submission to ACM Transactions on Algorithms special issue for SODA 2009 (TALG), to appear.
An Optimal Decomposition Algorithm for Tree Edit Distance. Erik Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. ACM Transactions on Algorithms (TALG), to appear (2008).
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Shay Mozes, Yury Lifshits , Oren Weimann and Michal Ziv-Ukelson. Algorithmica, Vol.54 (3) (2009), Page 379 . Algorithmica C++/Java Implementation
A new construction for a QMA complete 3-local Hamiltonian. Daniel Nagaj and Shay Mozes. J. Math. Phys. 48, 072104 (2007). J.Math.Phys. arXiv:quant-ph/0612113
Deterministic Dense Coding with Partially Entangled states. Shay Mozes, Jonathan Oppenheim and Benni Reznik. Phys. Rev. A. 71, 012311, (2005). PRA arXiv:quant-ph/0403189
The effect of unitary noise on Grover's quantum search algorithm. Daniel Shapira, Shay Mozes and Ofer Biham. Phys. Rev. A. 67, 042301, (2003). PRA arXiv:quant-ph/0307142

shaycsbrownedu

Home