Sciweavers

376 search results - page 12 / 76
» Betweenness Centrality : Algorithms and Lower Bounds
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 11 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
IWCMC
2009
ACM
14 years 2 months ago
Multiple-antenna multiple-relay system with precoding for multiuser transmission
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
Arash Talebi, Witold A. Krzymien
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 2 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
JCB
2006
115views more  JCB 2006»
13 years 7 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger