| 1. |
- Estrada, Karol, et al.
(författare)
-
Genome-wide meta-analysis identifies 56 bone mineral density loci and reveals 14 loci associated with risk of fracture.
- 2012
-
Ingår i: Nature genetics. - : Springer Science and Business Media LLC. - 1546-1718 .- 1061-4036. ; 44:5, s. 491-501
-
Tidskriftsartikel (refereegranskat)abstract
- Bone mineral density (BMD) is the most widely used predictor of fracture risk. We performed the largest meta-analysis to date on lumbar spine and femoral neck BMD, including 17 genome-wide association studies and 32,961 individuals of European and east Asian ancestry. We tested the top BMD-associated markers for replication in 50,933 independent subjects and for association with risk of low-trauma fracture in 31,016 individuals with a history of fracture (cases) and 102,444 controls. We identified 56 loci (32 new) associated with BMD at genome-wide significance (P < 5 × 10(-8)). Several of these factors cluster within the RANK-RANKL-OPG, mesenchymal stem cell differentiation, endochondral ossification and Wnt signaling pathways. However, we also discovered loci that were localized to genes not known to have a role in bone biology. Fourteen BMD-associated loci were also associated with fracture risk (P < 5 × 10(-4), Bonferroni corrected), of which six reached P < 5 × 10(-8), including at 18p11.21 (FAM210A), 7q21.3 (SLC25A13), 11q13.2 (LRP5), 4q22.1 (MEPE), 2p16.2 (SPTBN1) and 10q21.1 (DKK1). These findings shed light on the genetic architecture and pathophysiological mechanisms underlying BMD variation and fracture susceptibility.
|
|
| 2. |
- Munro, Malcolm G, et al.
(författare)
-
The two FIGO systems for normal and abnormal uterine bleeding symptoms and classification of causes of abnormal uterine bleeding in the reproductive years: 2018 revisions.
- 2018
-
Ingår i: International journal of gynaecology and obstetrics: the official organ of the International Federation of Gynaecology and Obstetrics. - : Wiley. - 1879-3479. ; 143:3, s. 393-408
-
Tidskriftsartikel (refereegranskat)abstract
- The International Federation of Gynecology and Obstetrics (FIGO) systems for nomenclature of symptoms of normal and abnormal uterine bleeding (AUB) in the reproductive years (FIGO AUB System 1) and for classification of causes of AUB (FIGO AUB System 2; PALM-COEIN) were first published together in 2011. The purpose was to harmonize the definitions of normal and abnormal bleeding symptoms and to classify and subclassify underlying potential causes of AUB in the reproductive years to facilitate research, education, and clinical care. The systems were designed to be flexible and to be periodically reviewed and modified as appropriate.To review, clarify, and, where appropriate, revise the previously publishedsystems.To a large extent, the process has been an iterative one involving the FIGO Menstrual Disorders Committee, as well as a number of invited contributions from epidemiologists, gynecologists, and other experts in the field from around the world between 2012 and 2017. Face-to-face meetings have been held in Rome, Vancouver, and Singapore, and have been augmented by a number of teleconferences and other communications designed to evaluate various aspects of the systems. Where substantial change was considered, anonymous voting, in some instances using a modified RAND Delphi technique, was utilized.
|
|
| 3. |
|
|
| 4. |
- Bose, Prosenjit, et al.
(författare)
-
Online routing in convex subdivisions
- 2000
-
Ingår i: Algorithms and Computation. - Berlin : Encyclopedia of Global Archaeology/Springer Verlag. - 3540412557 ; , s. 47-59
-
Konferensbidrag (refereegranskat)abstract
- We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.
|
|
| 5. |
- Bose, Prosenjit, et al.
(författare)
-
Online routing in convex subdivisions
- 2002
-
Ingår i: International journal of computational geometry and applications. - 0218-1959. ; 12:4, s. 283-295
-
Tidskriftsartikel (refereegranskat)abstract
- We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.
|
|
| 6. |
- Brodnik, Andrej, et al.
(författare)
-
An O(1) solution to the prefix sum problem on a specialized memory architecture
- 2006
-
Ingår i: PFourth IFIP International Conference on Theoretical Computer Science - TCS 2006. - New York : Encyclopedia of Global Archaeology/Springer Verlag. - 9780387346335 ; , s. 103-114
-
Konferensbidrag (refereegranskat)abstract
- In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ(lgN) time under the comparison based model of computation.
|
|
| 7. |
- Brodnik, Andrej, et al.
(författare)
-
Membership in constant time and almost-minimum space
- 1999
-
Ingår i: SIAM journal on computing (Print). - 0097-5397 .- 1095-7111. ; 28:5, s. 1627-1640
-
Tidskriftsartikel (refereegranskat)abstract
- This paper deals with the problem of storing a subset of elements from the bounded universe $\mathcal{M} = \{0, \ldots, M-1\}$ so that membership queries can be performed efficiently. In particular, we introduce a data structure to represent a subset of $N$ elements of $\mathcal{M}$ in a number of bits close to the information-theoretic minimum, $B = \left\lceil \lg {M\choose N} \right\rceil$, and use the structure to answer membership queries in constant time.
|
|
| 8. |
- Brodnik, Andrej, et al.
(författare)
-
Neighbours on a grid
- 1996
-
Ingår i: Algorithm Theory - SWAT'96. - Berlin : Encyclopedia of Global Archaeology/Springer Verlag. - 3540614222 ; , s. 309-320
-
Konferensbidrag (refereegranskat)abstract
- We address the problem of a succinct static data structure representing points on an M × M grid (M = 2m where m is size of a word) that permits to answer the question of finding the closest point to a query point under the L ∞ or L 1 norm in constant time. Our data structure takes essentially minimum space. These results are extended to d dimensions under L ∞.
|
|
| 9. |
- Brodnik, Andrej, et al.
(författare)
-
Resizable arrays in optimal time and space
- 1999
-
Ingår i: Algorithms and Data Structures. - Berlin : Encyclopedia of Global Archaeology/Springer Verlag. - 3540662790 ; , s. 37-48
-
Konferensbidrag (refereegranskat)abstract
- We present simple, practical and efficient data structures for the fundamental problem of maintaining a resizable one-dimensional array, A[l..l + n - 1], of fixed-size elements, as elements are added to or removed from one or both ends. Our structures also support access to the element in position i. All operations are performed in constant time. The extra space (i.e., the space used past storing the n current elements) is O(√n) at any point in time. This is shown to be within a constant factor of optimal, even if there are no constraints on the time. If desired, each memory block can be made to have size 2k - c for a specified constant c, and hence the scheme works effectively with the buddy system. The data structures can be used to solve a variety of problems with optimal bounds on time and extra storage. These include stacks, queues, randomized queues, priority queues, and deques.
|
|
| 10. |
- Brodnik, Andrej, et al.
(författare)
-
Trans-dichotomous algorithms without multiplication : some upper and lower bounds
- 1997
-
Ingår i: Algorithms and Data Structures. - Berlin : Encyclopedia of Global Archaeology/Springer Verlag. - 9783540633075 ; , s. 426-439
-
Konferensbidrag (refereegranskat)abstract
- We show that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication, there is a transdichotomous solution to the static dictionary problem using linear space and with query time log n(log log n)1+0(1). On the way, we show that two w-bit words can be multiplied in time (log w)1+0(1) and that time (log w) is necessary, and that (log log w) time is necessary and sufficient for identifying the least significant set bit of a word.
|
|
