Graphs with small additive stretch number

2004 ◽  
Vol 24 (2) ◽  
pp. 291 ◽  
Author(s):  
Dieter Rautenbach
Genetics ◽  
2001 ◽  
Vol 159 (3) ◽  
pp. 1045-1057 ◽  
Author(s):  
Kenneth Weber ◽  
Robert Eisman ◽  
Shawn Higgins ◽  
Lisa Morey ◽  
April Patty ◽  
...  

AbstractGenetic effects on an index of wing shape on chromosome 2 of Drosophila melanogaster were mapped using isogenic recombinants with transposable element markers. At least 10 genes with small additive effects are dispersed evenly along the chromosome. Many interactions exist, with only small net effects in homozygous recombinants and little effect on phenotypic variance. Heterozygous chromosome segments show almost no dominance. Pleiotropic effects on leg shape are only minor. At first view, wing shape genes form a rather homogeneous class, but certain complexities remain unresolved.


Algorithmica ◽  
2020 ◽  
Vol 82 (12) ◽  
pp. 3458-3491
Author(s):  
Merav Parter ◽  
David Peleg

1988 ◽  
Vol 34 (4) ◽  
pp. 671-675 ◽  
Author(s):  
B W Collins ◽  
H O Goodman ◽  
C H Swanton ◽  
C N Remy

Abstract A previous study showed that significantly less taurine is excreted in the urine by epileptics than by control subjects. The difference is ascribed to genetic variation in taurine transport governed by a pair of codominant polymorphic alleles. The present study of plasma taurine concentrations and urinary taurine output confirms previous findings among epileptics and provides evidence that some anticonvulsant medications may affect taurine transport. The posited codominant alleles represent the first single-locus component in the polygenic complexes creating susceptibility to seizures and epitomizes the small additive effects classically attributed to such genes.


1995 ◽  
Vol 05 (04) ◽  
pp. 369-395 ◽  
Author(s):  
ESTHER M. ARKIN ◽  
JOSEPH S.B. MITCHELL ◽  
SUBHASH SURI

We develop a data structure for answering link distance queries between two arbitrary points in a simple polygon. The data structure requires O(n3) time and space for its construction and answers link distance queries in O(log n) time, after which a minimum-link path can be reported in time proportional to the number of links. Here, n denotes the number of vertices of the polygon. Our result extends to link distance queries between pairs of segments or polygons. We also propose a simpler data structure for computing a link distance approximately, where the error is bounded by a small additive constant. Finally, we also present a scheme for approximating the link and the shortest path distance simultaneously.


Sign in / Sign up

Export Citation Format

Share Document