2 resultados para chains with unbounded variable length memory


Relevância:

100.00% 100.00%

Publicador:

Resumo:

The super early genotypes (SEG) of dry bean (Phaseolus vulgaris L.) have a shorter life cycle (65-75 days) when compared with the season length of traditional cultivars (90-100 days). Timing of nitrogen top-dressing fertilization could be different because of this reduction in length of the SEG life cycle. This study aimed at characterizing, by using growth analysis and vegetation index, super early genotypes of dry bean development as affected by timing of nitrogen application. Field experiments were conducted in the 2014 and 2015 growing seasons in central Brazil with a randomized block experimental design with split plots scheme and four replicates. The plots comprised the dry bean genotypes (Colibri ? check cultivar, CNFC 15873, CNFC 15874, and CNFC 15875), and subplots comprised applications of N at different timings: 90 kg of N at sowing, 90 kg N at top-dressing; 45 kg of N at sowing plus 45 kg at top-dressing, with urea as the source of N. We also used a control treatment without N application. The CNFC 15874 super early genotype of dry bean had the higher grain yield (2776 kg ha-1) and differed from the CNFC 15873 genotype (2492 kg ha-1). Nitrogen fertilization allowed higher grain yield (2619 kg ha-1, when applied N at sowing, 2605 kg ha-1, when applied N at sowing and at top-dressing, and 2680 kg ha-1, when applied N at top-dressing) than the control, 2360 kg ha-1 (no N fertilization). The time of N fertilization in super early genotype of dry bean did not affect grain yield.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this study, we carried out a comparative analysis between two classical methodologies to prospect residue contacts in proteins: the traditional cutoff dependent (CD) approach and cutoff free Delaunay tessellation (DT). In addition, two alternative coarse-grained forms to represent residues were tested: using alpha carbon (CA) and side chain geometric center (GC). A database was built, comprising three top classes: all alpha, all beta, and alpha/beta. We found that the cutoff value? at about 7.0 A emerges as an important distance parameter.? Up to 7.0 A, CD and DT properties are unified, which implies that at this distance all contacts are complete and legitimate (not occluded). We also have shown that DT has an intrinsic missing edges problem when mapping the first layer of neighbors. In proteins, it may produce systematic errors affecting mainly the contact network in beta chains with CA. The almost-Delaunay (AD) approach has been proposed to solve this DT problem. We found that even AD may not be an advantageous solution. As a consequence, in the strict range up ? to 7.0 A, the CD approach revealed to be a simpler, more complete, and reliable technique than DT or AD. Finally, we have shown that coarse-grained residue representations may introduce bias in the analysis of neighbors in cutoffs up to ? 6.8 A, with CA favoring alpha proteins and GC favoring beta proteins. This provides an additional argument pointing to ? the value of 7.0 A as an important lower bound cutoff to be used in contact analysis of proteins.