Sciweavers

178 search results - page 30 / 36
» combinatorics 2007
Sort
View
COMPGEOM
2007
ACM
15 years 3 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa
AB
2008
Springer
15 years 1 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
JCB
2008
144views more  JCB 2008»
14 years 12 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
IJAC
2010
231views more  IJAC 2010»
14 years 9 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
15 years 6 hour ago
Random Geometric Graph Diameter in the Unit Ball
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...