Sciweavers

131 search results - page 11 / 27
» On the Maximum Number of Translates in a Point Set
Sort
View
WABI
2009
Springer
142views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Back-Translation for Discovering Distant Protein Homologies
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
Marta Gîrdea, Laurent Noé, Gregory Ku...
CCCG
2010
13 years 9 months ago
k-star-shaped polygons
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
Jeff Sember, William Evans
CCCG
1996
13 years 8 months ago
Fast Stabbing of Boxes in High Dimensions
We present in this paper a simple yet e cient algorithm for stabbing a set S of n axisparallel boxes in d-dimensional space with c(S) points in output-sensitive time O(dn log c(S)...
Frank Nielsen
GD
2004
Springer
14 years 27 days ago
No-Three-in-Line-in-3D
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
Attila Pór, David R. Wood
JCT
2008
76views more  JCT 2008»
13 years 7 months ago
Quadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
Zoltán Füredi, Dhruv Mubayi, Oleg Pikh...