Some selected chromosomal substitution lines were used to determine the role of their relevant chromosomes in affecting variation of epicuticular wax, water statues and stomatal characteristics under water-deficit conditions. Recipient and donor parents of the substitution lines were Chinese spring (CS) and Timstein, respectively. Analyses of variance revealed highly significant variations among the candidate substitution lines for leaf relative water content (LRWC), excised leaf water lost and grain weight. However, no significant variation was found for epicuticular wax (ECW). In the case of stomatal characteristics, analyses of variance indicated significant variation for stomatal frequency only and no significant variation was found for other stomatal characteristics. Comparison between the substitution lines and their recipient parent (CS) revealed that none of the substitution lines was significantly different with the recipient parent (CS) for ECW, thus indicating none of the candidate chromosomes involved in controlling this character. However, the results indicated the effects of chromosomes 1A, 3D and 7D from donor parent (Tim) in controlling LRWC. Chromosomes 7D of Timstein also had a significant effect in enhancing LRWC when substituted into CS background. In addition, it was observed that none of the characters correlated with grain yield in water-stressed experiments.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The Average Common Substring (ACS) is a popular alignment-free distance measure for phylogeny reconstruction. The ACS of a sequence X[1; x] w.r.t. another sequence Y[1; y] is ACS(X;Y) =[formula] The lcp(., .) of two input sequences is the length of their longest common prefix. The ACS can be computed in O(n) space and time, where n = x + y is the input size. The compressed string matching is the study of string matching problems with the following twist: the input data is in a compressed format and the underling task must be performed with little or no decompression. In this paper, we revisit the ACS problem under this paradigm where the input sequences are given in their run-length encoded format. We present an algorithm to compute ACS(X,Y) in O(N log N) time using O(N) space, where N is the total length of sequences after run-length encoding.