Följ
Oren Weimann
Titel
Citeras av
Citeras av
År
An optimal decomposition algorithm for tree edit distance
ED Demaine, S Mozes, B Rossman, O Weimann
ACM Transactions on Algorithms (TALG) 6 (1), 1-19, 2009
3402009
Consequences of faster alignment of sequences
A Abboud, VV Williams, O Weimann
International Colloquium on Automata, Languages, and Programming, 39-51, 2014
1452014
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm
PN Klein, S Mozes, O Weimann
ACM Transactions on Algorithms (TALG) 6 (2), 1-18, 2010
1172010
Random access to grammar-compressed strings and trees
P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann
SIAM Journal on Computing 44 (3), 513-539, 2015
972015
Random access to grammar-compressed strings
P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
872011
A unified algorithm for accelerating edit-distance computation via text-compression
D Hermelin, GM Landau, S Landau, O Weimann
arXiv preprint arXiv:0902.2649, 2009
702009
On cartesian trees and range minimum queries
ED Demaine, GM Landau, O Weimann
International Colloquium on Automata, Languages, and Programming, 341-353, 2009
662009
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
542011
Gene Proximity Analysis across Whole Genomes via PQ Trees1
GM Landau, L Parida, O Weimann
Journal of Computational Biology 12 (10), 1289-1306, 2005
512005
Finding an optimal tree searching strategy in linear time.
S Mozes, K Onak, O Weimann
SODA 8, 1096-1105, 2008
502008
Replacement paths and distance sensitivity oracles via fast matrix multiplication
O Weimann, R Yuster
ACM Transactions on Algorithms (TALG) 9 (2), 1-13, 2013
492013
Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)
K Bringmann, P Gawrychowski, S Mozes, O Weimann
ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020
482020
Better tradeoffs for exact distance oracles in planar graphs
P Gawrychowski, S Mozes, O Weimann, C Wulff-Nilsen
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
482018
Tree compression with top trees
P Bille, IL Gørtz, GM Landau, O Weimann
Information and Computation 243, 166-177, 2015
472015
Improved bounds for online preemptive matching
L Epstein, A Levin, D Segev, O Weimann
arXiv preprint arXiv:1207.1788, 2012
452012
On cartesian trees and range minimum queries
ED Demaine, GM Landau, O Weimann
Algorithmica 68 (3), 610-625, 2014
422014
Minimum Cut in Time
P Gawrychowski, S Mozes, O Weimann
arXiv preprint arXiv:1911.01145, 2019
382019
Using PQ trees for comparative genomics
GM Landau, L Parida, O Weimann
Annual Symposium on Combinatorial Pattern Matching, 128-143, 2005
382005
Binary jumbled pattern matching on trees and tree-like structures
T Gagie, D Hermelin, GM Landau, O Weimann
Algorithmica 73 (3), 571-588, 2015
372015
Speeding up HMM decoding and training by exploiting sequence repetitions
Y Lifshits, S Mozes, O Weimann, M Ziv-Ukelson
Algorithmica 54 (3), 379-399, 2009
362009
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20