Oren Weimann
2014
A researcher in the Science corpus: 1 paper; trusts 5 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Oren Weimann trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Oren Weimann's perspective
Ordered by how strongly the researchers Oren Weimann trusts endorse each paper. Same corpus, a different order for every researcher.
- Identification of common molecular subsequences.
- Basic local alignment search tool.
- Multiple Sequence Alignment (Theory and Mathematical Methods for Bioinformatics)
- Subcubic Equivalences between Path, Matrix and Triangle Problems (IEEE Annual Symposium on Foundations of Computer Science)
- Binary codes capable of correcting deletions, insertions, and reversals
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems (IEEE Annual Symposium on Foundations of Computer Science)
- On the Complexity of Multiple Sequence Alignment
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Gaussian elimination is not optimal
Their papers
- Consequences of Faster Alignment of Sequences (2014) — 166 citations