Lighted to lighten : a study of missional families in Bangalore, India

https://place.asburyseminary.edu/ecommonsatsdissertations/1382/thumbnail.jp

Range Shortest Unique Substring queries

Let be a string of length n and be the substring of starting at position i and ending at position j. A substring of is a repeat if it occurs more than once in; otherwise, it is a unique substring of. Repeats and unique substrings are of great interest in computational biology and in information retrieval. Given string as input, the Shortest Unique Substring problem is to find a shortest substring of that does not occur elsewhere in. In this paper, we introduce the range variant of this problem, which we call the Range Shortest Unique Substring problem. The task is to construct a data structure over answering the following type of online queries efficiently. Given a range, return a shortest substring of with exactly one occurrence in. We present an -word data structure with query time, where is the word size. Our construction is based on a non-trivial reduction allowing us to apply a recently introduced optimal geometric data structure [Chan et al. ICALP 2018]

Longest property-preserved common factor

In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. Here we consider two fundamental string properties: square-free factors and periodic factors under two different settings, one per property. In the first setting, we are given a string x and we are asked to construct a data structure over x answering the following type of on-line queries: given string y, find a longest square-free factor common to x and y. In the second setting, we are given k strings and an integer 1 < k’ ≤ k and we are asked to find a longest periodic factor common to at least k’ strings. We present linear-time solutions for both settings. We anticipate that our paradigm can be extended to other string properties

Longest Common Prefixes with kk-Errors and Applications

Although real-world text datasets, such as DNA sequences, are far from being uniformly random, average-case string searching algorithms perform significantly better than worst-case ones in most applications of interest. In this paper, we study the problem of computing the longest prefix of each suffix of a given string of length $n$ over a constant-sized alphabet that occurs elsewhere in the string with $k$-errors. This problem has already been studied under the Hamming distance model. Our first result is an improvement upon the state-of-the-art average-case time complexity for non-constant $k$ and using only linear space under the Hamming distance model. Notably, we show that our technique can be extended to the edit distance model with the same time and space complexities. Specifically, our algorithms run in $\mathcal{O}(n \log^k n \log \log n)$ time on average using $\mathcal{O}(n)$ space. We show that our technique is applicable to several algorithmic problems in computational biology and elsewhere

Efficient data structures for range shortest unique substring queries†

Let T[1, n] be a string of length n and T[i, j] be the substring of T starting at position i and ending at position j. A substring T[i, j] of T is a repeat if it occurs more than once in T; otherwise, it is a unique substring of T. Repeats and unique substrings are of great interest in computational biology and information retrieval. Given string T as input, the Shortest Unique Substring problem is to find a shortest substring of T that does not occur elsewhere in T. In this paper, we introduce the range variant of this problem, which we call the Range Shortest Unique Substring problem. The task is to construct a data structure over T answering the following type of online queries efficiently. Given a range [α, β], return a shortest substring T[i, j] of T with exactly one occurrence in [α, β]. We present an O(n log n)-word data structure with O(logw n) query time, where w = Ω(log n) is the word size. Our construction is based on a non-trivial reduction allowing for us to apply a recently introduced optimal geometric data structure [Chan et al., ICALP 2018]. Additionally, we present an O(n)-word data structure with O(√ n logɛ n) query time, where ɛ > 0 is an arbitrarily small constant. The latter data structure relies heavily on another geometric data structure [Nekrich and Navarro, SWAT 2012]

Nutrient intakes of rural Tibetan mothers: a cross-sectional survey

<p>Abstract</p> <p>Background</p> <p>Tibetan food intake is influenced by the region's high altitude and unique culture. Few published studies of nutrient intakes among Tibetan women are available. The present study of Tibetan mothers with young children explores dietary patterns, nutrient intakes, and differences between socio-demographic groups.</p> <p>Methods</p> <p>A cross-sectional survey of 386 women with a child aged less than 24 months was conducted in rural areas surrounding Lhasa, Tibet. All participants were recruited using simple random sampling and were interviewed face-to-face by trained investigators. Dietary information was collected via a food frequency questionnaire. Nutrient intakes were calculated using food composition tables. Non-parametric tests were used to compare nutrient intakes according to socio-demographic variables, and to compare results with the <it>2002 Chinese National Nutrition and Health Survey </it>(2002 NNHS) and dietary reference intakes (DRIs).</p> <p>Results</p> <p>Median intakes of energy (<it>p </it>< 0.001), protein (<it>p </it>< 0.001), fat (<it>p </it>< 0.001), vitamin A (<it>p </it>< 0.001), vitamin B1 (<it>p </it>< 0.001), vitamin B2 (<it>p </it>< 0.001), vitamin C (<it>p </it>< 0.001), and vitamin E (<it>p </it>< 0.001) were lower than the average levels reported in 2002 NNHS. The median intakes of calcium (517 mg/d, <it>p </it>< 0.001), iron (35 mg/d, <it>p </it>< 0.001), and zinc (17.3 mg/d, <it>p </it>< 0.001) were higher than the average levels in 2002 NNHS. The highest education subgroup had significantly higher intakes of vitamins A and C than the lowest education subgroup.</p> <p>Conclusion</p> <p>Although the diet of Tibetan mothers with young children has been partially influenced by other factors, their dietary patterns are still mostly composed of Tibetan traditional foods. Compared with the 2002 NNHS, Tibetan women with young children appear to have insufficient intakes of many nutrients, which will affect their nutritional status.</p

Calculation of electric field gradients in some linear molecules using semi-empirical scfmo formalisms

The electric field gradients (EFG) at the D. Li. N and O sites in the linear molecules LID, DF, DCN, DCCD. OCCF, N2, CO and NCCN have been rigorously evaluated with the inclusion of all integrals using four different semi-empirical SCFMO methods with a view to assess their suitability for EFG calculations. The methods chosen are the CNDO/2 and INDO methods of Pople, a method using explicitly orthogonalised AO's and distinguishing s and p orbitals in the valence shell due to Nanda and Narasimhan (NN-INDO) and a reparametrisation of the same using Clementi-Raimondi exponents. It is found that orbital exponents play a crucial role in semi-empirical EFG calculations. Use of explicitly orthogonalised basis sets as in the NN-INDO schemes is seen to improve the EFG values for the first-row atoms. A few comments are made on population-based methods for EFG calculations