default search action
Oren Weimann
- > Home > Persons > Oren Weimann
Publications
- 2021
- [j31]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021) - 2019
- [c45]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. ISAAC 2019: 4:1-4:18 - [i30]Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. CoRR abs/1902.02187 (2019) - 2018
- [j24]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The nearest colored node in a tree. Theor. Comput. Sci. 710: 66-73 (2018) - [c42]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Greedy Consensus Trees. ICALP 2018: 63:1-63:14 - 2017
- [i21]Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann:
A Faster Construction of Phylogenetic Consensus Trees. CoRR abs/1705.10548 (2017) - 2016
- [j21]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest common extensions in trees. Theor. Comput. Sci. 638: 98-107 (2016) - [c32]Pawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann:
The Nearest Colored Node in a Tree. CPM 2016: 25:1-25:12 - 2015
- [j20]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. Algorithmica 73(3): 571-588 (2015) - [j19]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree compression with top trees. Inf. Comput. 243: 166-177 (2015) - [j18]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44(3): 513-539 (2015) - [c30]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CPM 2015: 52-64 - 2014
- [j17]Erik D. Demaine, Gad M. Landau, Oren Weimann:
On Cartesian Trees and Range Minimum Queries. Algorithmica 68(3): 610-625 (2014) - [i15]Danny Hermelin, Gad M. Landau, Yuri Rabinovich, Oren Weimann:
Binary Jumbled Pattern Matching via All-Pairs Shortest Paths. CoRR abs/1401.2065 (2014) - [i13]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CoRR abs/1412.1254 (2014) - 2013
- [j14]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. Algorithmica 65(2): 339-353 (2013) - [j11]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On approximating string selection problems with outliers. Theor. Comput. Sci. 498: 107-114 (2013) - [c26]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. ESA 2013: 517-528 - [c25]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. ICALP (1) 2013: 160-171 - [i12]Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann:
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures. CoRR abs/1301.6127 (2013) - [i11]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. CoRR abs/1304.5702 (2013) - 2012
- [c21]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CPM 2012: 427-438 - [i9]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012) - 2011
- [j8]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann:
Fast RNA structure alignment for crossing input structures. J. Discrete Algorithms 9(1): 2-11 (2011) - [c18]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - 2010
- [c17]Gad M. Landau, Dekel Tsur, Oren Weimann:
Indexing a Dictionary for Subset Matching Queries. Algorithms and Applications 2010: 158-169 - [i6]Philip Bille, Gad M. Landau, Oren Weimann:
Random Access to Grammar Compressed Strings. CoRR abs/1001.1565 (2010) - [i5]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
Unified Compression-Based Acceleration of Edit-Distance Computation. CoRR abs/1004.1194 (2010) - 2009
- [c15]Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann:
Fast RNA Structure Alignment for Crossing Input Structures. CPM 2009: 236-248 - [c14]Erik D. Demaine, Gad M. Landau, Oren Weimann:
On Cartesian Trees and Range Minimum Queries. ICALP (1) 2009: 341-353 - [c11]Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann:
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. STACS 2009: 529-540 - [i4]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) - 2007
- [j2]Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M. Landau, Mikhail A. Roytberg, Oren Weimann, Kaizhong Zhang:
Locality and Gaps in RNA Comparison. J. Comput. Biol. 14(8): 1074-1087 (2007) - [c5]Gad M. Landau, Dekel Tsur, Oren Weimann:
Indexing a Dictionary for Subset Matching Queries. SPIRE 2007: 195-204 - 2006
- [c3]Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. CPM 2006: 246-257 - 2005
- [j1]Gad M. Landau, Laxmi Parida, Oren Weimann:
Gene Proximity Analysis across Whole Genomes via PQ Trees1. J. Comput. Biol. 12(10): 1289-1306 (2005) - [c2]Gad M. Landau, Laxmi Parida, Oren Weimann:
Using PQ Trees for Comparative Genomics. CPM 2005: 128-143 - [c1]Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint