• Title/Summary/Keyword: genetic advance

Search Result 75, Processing Time 0.025 seconds

Studies on Heterosis Selective Index, Genetic Advance and Selective Efficiency for some Characters in Silkworm Breeding (누에 육종에 있어서 잡종강세, 선발지수, 유전진전, 선발효율에 관한 연구)

  • 정원복
    • Journal of Sericultural and Entomological Science
    • /
    • v.32 no.1
    • /
    • pp.8-16
    • /
    • 1990
  • The experiment was conducted to obtain estimates of heterosis, selective index, genetic advance and selective efficiency in cross among silkworm varieties. Seven parents, 21 F$_1$ hybrids, and 21 F$_2$ populaltions from diallel crosses among them were evaluated. The results obtained are summarized as follows: In male and female of F$_1$ generation, the negative heterosis was shown in two characters of fifth instar period and boiling on ratio, and the positive heterosis with the value of 20.90-37.60% in the other characters. In those of F$_2$, the nagative heterosis was shown in two characters of cocoon layer ratio and boiling off ratio, and the positive heterosis in the other characters. The selection weight of cocoon weight for bave weight was the highest of those of all the characters, and that of the combination of the fifth instar period and cocoon weight for it was the highest of those of all the combination. The genetic advance of cocoon weight toward bave weight was the highest of all the characters. The highest genetic advance and selective efficiency were shown in the combination of all the characters.

  • PDF

A Study on the Optimal Trajectory Planning for a Ship Using Genetic algorithm (유전 알고리즘을 이용한 선박의 최적 항로 결정에 관한 연구)

  • 이병결;김종화;김대영;김태훈
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.255-255
    • /
    • 2000
  • Technical advance of electrical chart and cruising equipment make it possible to sail without a man. It is important to decide the cruising route in view of effectiveness and stability of a ship. So we need to study on the optimal trajectory planning. Genetic algorithm is a strong optimization algorithm with adaptational random search. It is a good choice to apply genetic algorithm to the trajectory planning of a ship. We modify a genetic algorithm to solve this problem. The effectiveness of the revised genetic algorithm is assured through computer simulations.

  • PDF

A New Selection Algorithms for Distributed Evolutionary Algorithms

  • Oh, Sang-Keon;Kim, Cheol-Taek;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.490-490
    • /
    • 2000
  • Parallel genetic algorithms are particularly easy to implement and promise substantial gains in performance. Its basic idea is to keep several subpopulations that are processed by genetic algorithms. Furthermore, a migration mechanism produces a chromosome exchange between subpopulation. In this paper, a new selection method based on non-linear fitness assignment presented. The use of proposed ranking selection permits higher local exploitation search, where the diversity of populations is structure. Experimental results show that the relation between local-global search balance and the probabilities of reaching a desired solution.

  • PDF

Selection Index and Genetic Advance on Quantitative Characters of Sesame (참깨의 양적형질에 대한 선발지수 및 유전진전)

  • ;Kwon-Yawl Chang
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.31 no.3
    • /
    • pp.304-310
    • /
    • 1986
  • The studies were intended to clarify the effects of selection in sesame breeding. The 82 cultivars of sesame were used as the materials, and 14 quantitative characters were measured on individual plant basis. Selection indexes and genetic advances were calculated by Robinson's methods. In genetic advance values, combinations of days to flowering + number of capsule per plant, days to flowering + length of stem with capsule + number of capsule per plant and days to flowering + number of nodes with capsule were higher than those of other combinations. The highest genetic advance was the combination of all characters, but unreasonable problems such as the expence, time and labor involved in calculating the selection index are remained. For these reasons, it was realized that the selection index for selection should calculated on the basis of the data of 2-3 useful characters, i.e., days to flowering, length of stem with capsule and number of capsule per plant.

  • PDF

A Study on Multiobjective Genetic Optimization Using Co-Evolutionary Strategy (공진화전략에 의한 다중목적 유전알고리즘 최적화기법에 관한 연구)

  • Kim, Do-Young;Lee, Jong-Soo
    • Proceedings of the KSME Conference
    • /
    • 2000.11a
    • /
    • pp.699-704
    • /
    • 2000
  • The present paper deals with a multiobjective optimization method based on the co-evolutionary genetic strategy. The co-evolutionary strategy carries out the multiobjective optimization in such way that it optimizes individual objective function as compared with each generation's value while there are more than two genetic evolutions at the same time. In this study, the designs that are out of the given constraint map compared with other objective function value are excepted by the penalty. The proposed multiobjective genetic algorithms are distinguished from other optimization methods because it seeks for the optimized value through the simultaneous search without the help of the single-objective values which have to be obtained in advance of the multiobjective designs. The proposed strategy easily applied to well-developed genetic algorithms since it doesn't need any further formulation for the multiobjective optimization. The paper describes the co-evolutionary strategy and compares design results on the simple structural optimization problem.

  • PDF

Genitic Variability and Correlation of Quantitative Characters in Local Garlic Cultivars (在來種마늘의 量的形質에 대한 遺傳變異와 相關)

  • 김정선
    • Korean Journal of Plant Resources
    • /
    • v.11 no.3
    • /
    • pp.264-271
    • /
    • 1998
  • This study was conducted to investigate morphological characteristics of Korean local garlic varieties and to define the genetic variability and the correlations amongthe characters associated with yield. The plant height, the leaf sheath diameter, the nubmer of leaves, and bulb weight were significantly increased in the garlic plants from heavier seed bulbs. The proportation of six clove bulbs was more than 60% in Seosan variety and this was not realted with the number of cloves in seed bulb. While more than 70% bulbs in Jeoksung and Danyang varieties cultivated in paddy field were composed of 6 or 7 cloves, majority of the bulbs of Euisung and Danyang varieties cultivated in upland were composed of bulbs with 7 cloves or more. The highest genotypic coefficient of variation (GCV) and phenotypic coefficient of variation (PCV) were observed in bulb weight. GCV and PCV also showed high value in leaf sheath diameter. Thus, there is a greater scope for selection of these characters. The small difference between PCV and GCV values in plant height indicates that the environmental influence would be limited in this character. High heritability was observed of plant height (56.76%) and bulb weight (45.95%). And the weight per bulb (34.24%) exhibited highest genitic advance followed by leaf sheath diameter (18.8%) and plant height (9.61%), and those would be the ideal characters for selelction.

  • PDF

Genetic variability, associations, and path analysis of chemical and morphological traits in Indian ginseng [Withania somnifera (L.) Dunal] for selection of higher yielding genotypes

  • Srivastava, Abhilasha;Gupta, Anil K.;Shanker, Karuna;Gupta, Madan M.;Mishra, Ritu;Lal, Raj K.
    • Journal of Ginseng Research
    • /
    • v.42 no.2
    • /
    • pp.158-164
    • /
    • 2018
  • Background: The study was carried out to assess the genetic variability present in ashwagandha and to examine the nature of associations of various traits to the root yield of the plant. Methods: Fifty-three diverse genetic stocks of ashwagandha (Withania somnifera) were evaluated for 14 quantitative characteristics. Analysis of variance, correlation, and path coefficient analysis were performed using the mean data of 2 years. Results: Analysis of variance revealed that the genotypes differed significantly for all characteristics studied. High heritability in conjunction with high genetic advance was observed for fresh root weight, 12 deoxywithastramonolide in roots, and plant height, which indicated that selection could be effective for these traits. Dry root weight has a tight linkage with plant height and fresh root weight. Further, in path coefficient analysis, fresh root weight, total alkaloid (%) in leaves, and 12 deoxywithastramonolide (%) in roots had the highest positive direct effect on dry root weight. Conclusion: Therefore, these characteristics can be exploited to improve dry root weight in ashwagandha genotypes and there is also scope for the selection of promising and specific chemotypes (based on the alkaloid content) from the present germplasm.

Genetic diagnosis of systemic autoinflammatory diseases and underlying primary immunodeficiency

  • Seung Hwan Oh
    • Journal of Genetic Medicine
    • /
    • v.19 no.2
    • /
    • pp.57-62
    • /
    • 2022
  • Systemic autoinflammatory diseases (SAIDs) are characterized by unprovoked inflammatory episodes such as recurrent/periodic fever, serositis, skin lesions, abdominal symptoms, arthritis/arthralgia, and central nervous system involvement. Genetic diagnosis of SAIDs has been challenging because disease manifestations overlap among themselves and with other immunological disease categories, such as infection and autoimmune diseases. However, the advent of next-generation sequencing (NGS) technologies and expanding knowledge about the innate immunity and inflammation have made the routine genetic diagnosis of SAIDs possible. Here, we review the recurrent/periodic fevers, other recently identified autoinflammatory diseases, and type I interferonopathies, and discuss the clinical usefulness of NGS targeted sequencing for SAIDs, and recent advance of understandings for this heterogeneous disease group as for underlying primary immunodeficiency.

Genetic Variability and Association of Yield Attributing Characters with Grain Yield in Deepwater Rice

  • Bose L. K.;Pradhan S. K.;Mohanty A.;Nagaraju M.
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.50 no.4
    • /
    • pp.262-264
    • /
    • 2005
  • A study on genetic variability and association of yield attributing characters with grain yield was carried out using 35 deepwater rice genotypes. High genotypic co-efficient of variation (GCV) was observed for plot yield, $EBT/m^2$, plant height and days to $50\%$ flowering (DFF). For all the traits, estimates of the phenotypic co-efficient of variation (PCV) were higher than GCV, indicating presence of environmental influence. High heritability and genetic advance was observed for plot yield, $EBT/m^2$ and plant height. Plot yield had significant positive association with test weight, $EBT/m^2$ and DFF. However, test weight had the maximum direct effect on grain yield

A Hybrid Genetic Algorithm for Optimizing Torch Paths to Cut Stock Plates Nested with Open Contours (열린 윤곽선 부재로 이루어진 판재의 절단가공경로 최적화를 위한 혼합형 유전알고리즘)

  • Lee, Moon-Kyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.30-39
    • /
    • 2010
  • This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is composed of a single depot and a series of starting and ending points of contours to be cut. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem. To solve the problem, a hybrid genetic algorithm with the local search of torch paths is proposed. The genetic algorithm is tested for hypothetical problems whose optimal solutions are known in advance due to the special structure of them. The computational results show that the algorithm generates very near optimal solutions for most cases of the test problems, which verifies the validity of the algorithms.