AIMS Our aim was to evaluate the invasive haemodynamic indices of high-risk symptomatic patients presenting with 'paradoxical' low-flow, low-gradient, severe aortic stenosis (AS) (PLF-LG) and low-flow, low-gradient severe AS (LEF-LG) and to compare clinical outcomes following transcatheter aortic valve implantation (TAVI) among these challenging AS subgroups. METHODS AND RESULTS Of 534 sympto...

We present a new probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time with very-high probability 1 ? 2 ?(n) (the best previously known probability bound has been 1 ? 2 ?(n=(lg n lg lg n))). We also describe an EREW PRAM version of the algorithm that sorts in O((n=p + lg p) lg n= lg (n=p + lg n)) time using p ...

Backgrounds. Magnifying endoscopy with narrow-band imaging (NBI-ME) is useful for diagnosing differentiated early gastric cancer (D-EGC). D-EGC is classified as high- or low-grade based on its glandular architectural and cytological atypia. Low-grade, well-differentiated tubular adenocarcinoma (LG-tub1) mixed with high-grade tub1 (HG-tub1) and/or other histological types (M-LG-tub1) may indicat...

Results: The EG and LG group had 343 and 430 Rb patients respectively. The incidence of Rb in 1997 and in 2012 was 0.06 and 0.03 per 1,000 live births in Saudi Arabia respectively. The gender distribution was similar. The median age of presentation was 24 (range 11, 39) months in EG vs. 18 (8, 31) months in LG (p <0.001). Incidence of unilateral Rb was 58% [200/343] in EG vs. 56% [278/485] in L...

Seed coat color is an important agronomic trait in sesame, as it is associated with seed biochemical properties, antioxidant content and activity and even disease resistance of sesame. Here, using a high-density linkage map, we analyzed genetic segregation and quantitative trait loci (QTL) for sesame seed coat color in six generations (P1, P2, F1, BC1, BC2 and F2). Results showed that two major...

We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lg lgn) words of space and O(lg lg n+ k lg lg n) query time, where k is the number of points in the query range. This data structure improves a recent result of Nekrich and Navarro [8] by a factor of O(lg lgn) in query time, and matches the state of the art for unsorted range reporting [1].

The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the string itself must be maintained dynamically, allowing characters of the string to be inserted and deleted. Under the word RAM model with word size w = Ω(lg n), we design a succinct representation of dynamic strings using ...

Consider a tree T on n nodes, each having a weight drawn from [1..σ]. In this paper, we design succinct data structures to encode T using nH(WT ) + o(n lg σ) bits of space, such that we can support path counting queries in O( lg σ lg lgn + 1) time, path reporting queries in O((occ+1)( lg σ lg lgn +1)) time, and path median and path selection queries in O( lg σ lg lg σ ) time, where H(WT ) is th...

BACKGROUND In the present study, we investigated the effect of Origanum majorana ethanolic extract on the survival of the highly proliferative and invasive triple-negative p53 mutant breast cancer cell line MDA-MB-231. RESULTS We found that O. majorana extract (OME) was able to inhibit the viability of the MDA-MB-231 cells in a time- and concentration-dependent manner. The effect of OME on ce...

We introduce a probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time and sorts all but a very small fraction 2−Ω(n) of the input sequences; the best previously known bound was 2−Ω(n/(lg n lg lgn)). An EREW PRAM extension of this sequential algorithm sorts in O((n/p + lg p) lg n/ lg (n/p + lg n)) time using p ≤...