• Genomics & Informatics
• /
• 제11권1호
• /
• pp.38-45
• /
• 2013

In cancer genome studies, the annotation of newly detected oncogene/tumor suppressor gene candidates is a challenging process. We propose using concept lattice analysis for the annotation and interpretation of genes having candidate somatic mutations in whole-exome sequencing in acute myeloid leukemia (AML). We selected 45 highly mutated genes with whole-exome sequencing in 10 normal matched samples of the AML-M2 subtype. To evaluate these genes, we performed concept lattice analysis and annotated these genes with existing knowledge databases.

• International Journal of Computer Science & Network Security
• /
• 제21권12spc호
• /
• pp.526-538
• /
• 2021

Machine and deep learning-based models are emerging techniques that are being used to address prediction problems in biomedical data analysis. DNA sequence prediction is a critical problem that has attracted a great deal of attention in the biomedical domain. Machine and deep learning-based models have been shown to provide more accurate results when compared to conventional regression-based models. The prediction of the gene sequence that leads to cancerous diseases, such as prostate cancer, is crucial. Identifying the most important features in a gene sequence is a challenging task. Extracting the components of the gene sequence that can provide an insight into the types of mutation in the gene is of great importance as it will lead to effective drug design and the promotion of the new concept of personalised medicine. In this work, we extracted the exons in the prostate gene sequences that were used in the experiment. We built a Deep Neural Network (DNN) and Bi-directional Long-Short Term Memory (Bi-LSTM) model using a k-mer encoding for the DNA sequence and one-hot encoding for the class label. The models were evaluated using different classification metrics. Our experimental results show that DNN model prediction offers a training accuracy of 99 percent and validation accuracy of 96 percent. The bi-LSTM model also has a training accuracy of 95 percent and validation accuracy of 91 percent.

• 대한수학교육학회지:수학교육학연구
• /
• 제12권4호
• /
• pp.557-579
• /
• 2002

The purpose of this study is to find out the problems which are caused when the limit concept of sequences is learned through an intuitive definition and to suggest a way of solving those problems. Students in Korea study the limit concept of sequences through an intuitive definition. They fail to apply the intuitive definition properly to the problems and they are apt to have misconception even though the Intuitive definition is applied properly. To solve these problems, this study examined the develop- mental process of the limit concept of sequences from the Intuitive definition to the formal definition, and looked into the way of students' internalization of the process through a field study. In this study, the levels of the limit concept of sequences possessed by the students at ZPD are as follows; level 0 : Students understand the limit concept of sequences through the intuitive definition. level 1 : Students understand the limit concept of sequences as 'The difference between $\alpha$$_{n}$ and $\alpha$ approaches 0' rather than 'The sequence approaches $\alpha$ infinitely.' level 2 : Students understand the limit concept of sequences through the formal definition. The levels of students' limit concept development were analysed by those criteria. Almost of the students who studied the limit concept of sequences through the intuitive defition stayed at level 0, whereas almost of the students who studied through the formal definition stayed at level 1. Through the study, I found that it was difficult for the students to develop the higher level of understanding for themselves but the teachers and peers could help the students to progress to the higher level. Students' learning ability was one of major factors that make the students progress to the higher level of understanding as the concept was developed hierarchically from Level 0 to Level 2. If you want to see your students get to the higher level of understanding in the limit concept, you need to facilitate them to fully develop understanding in lower levels through enough experiences so that they can be promoted to the highest level.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제22권1호
• /
• pp.32-37
• /
• 2016

시퀀스 다이어그램에 대한 모델 기반 테스트를 수행하기 위하여 시퀀스 다이어그램으로부터 테스트 케이스를 자동으로 생성해야 한다. 이를 위해서는 시퀀스 다이어그램이 나타내는 시나리오를 파악하고 테스트 커버리지를 만족하는 경로를 추출하여 테스트 정보를 생성해야 한다. 하지만 시퀀스 다이어그램은 결합 조각을 사용하여 반복 및 조건, 대안 정보를 나타내므로 시퀀스 다이어그램으로부터 테스트 케이스를 자동으로 생성하는 것은 복잡하다. 이러한 문제를 해결하기 위하여 본 논문에서는 시퀀스 다이어그램으로부터 액티비티 다이어그램으로 변환을 수행하는 모델 변환 프로세스를 정의하고, 이를 통해 시퀀스 다이어그램의 시나리오를 제어 흐름 형태로 표현하고 여기에 테스트 커버리지를 적용하여 테스트 케이스를 생성하는 과정을 정의한다. 마지막으로, 사례 연구를 통하여 시퀀스 다이어그램으로부터 테스트 케이스를 생성하는 과정을 보인다.

• 정보과학회 논문지
• /
• 제44권8호
• /
• pp.842-853
• /
• 2017

스트리밍 데이터는 시간에 따라 지속적으로 생성되는 데이터 시퀀스이다. 시간이 지남에 따라 데이터의 분포 또는 컨셉이 변화할 수 있으며, 이러한 변화는 분류 모델의 성능을 저하시키는 요인이 된다. 점층적 적응적 학습 방법은 컨셉 변화의 정도에 따라 현재 분류 모델의 가중치를 조절하여 업데이트를 수행함으로써 컨셉 변화에 대한 분류 모델의 성능을 유지할 수 있게 한다. 그러나, 컨셉 변화의 정도에 맞는 적절한 가중치를 결정하기가 어렵다는 문제점이 있다. 본 논문에서는 컨셉 변화에 따른 적응적 가중치 조정에 기반한 동적 앙상블 방법을 제안한다. 실험 결과는 제안한 방법이 다른 비교 방법들에 비해 높은 성능을 보여줌을 입증한다.

• 대한수학회지
• /
• 제49권5호
• /
• pp.1083-1096
• /
• 2012

For a given ideal I of a Noetherian ring R and an arbitrary integer ${\kappa}{\geq}-1$, we apply the concept of ${\kappa}$-regular sequences and the notion of ${\kappa}$-depth to give some results on modules called ${\kappa}$-Cohen Macaulay modules, which in local case, is exactly the ${\kappa}$-modules (as a generalization of f-modules). Meanwhile, we give an expression of local cohomology with respect to any ${\kappa}$-regular sequence in I, in a particular case. We prove that the dimension of homology modules of the Koszul complex with respect to any ${\kappa}$-regular sequence is at most ${\kappa}$. Therefore homology modules of the Koszul complex with respect to any filter regular sequence has finite length.

• 산업경영시스템학회지
• /
• 제17권31호
• /
• pp.115-123
• /
• 1994

Group scheduling, which is a kind of operations scheduling based on the GT concept is analyzed in a multi-stage manufacturing system. The purpose of this research is to develop and evaluate a heuristic algorithm for determining gro up sequence and job sequence within each group to minimize a complex cost function, i.e. the sum of the total pe-nalty cost for tardiness and the total holding cost for flow time, in a multi-stage manufacturing system with group setup time dependent upon group sequence. A heuristic algorithm for group sc heduling is developed, and a numerical example is illustrated. For the evaluation of the pro-posed heuristic algorithm, the heuristic solution of each of 63 problems is compared with that of random scheduling. The result shows that the proposed heuristic algorithm provides better solution in light of the proposed cost function.

• 생물정신의학
• /
• 제8권2호
• /
• pp.203-207
• /
• 2001

The genome sequencing project has generated and will continue to generate enormous amounts of sequence data including 5 eukaryotic and about 60 prokaryotic genomes. Given this ever-increasing amounts of sequence information, new strategies are necessary to efficiently pursue the next phase of the genome project-the elucidation of gene expression patterns and gene product function on a whole genome scale. In order to assign functional information to the genome sequence, DNA chip(or gene microarray) technology was developed to efficiently identify the differential expression pattern of independent biological samples. DNA chip provides a new tool for genome expression analysis that may revolutionize many aspects of biotechnology including new drug discovery and disease diagnostics.

• Interdisciplinary Bio Central
• /
• 제3권4호
• /
• pp.14.1-14.9
• /
• 2011

Protein homology detection is an important issue in comparative genomics. Because of the exponential growth of sequence databases, fast and efficient homology detection tools are urgently needed. Currently, for homology detection, sequence comparison methods using local alignment such as BLAST are generally used as they give a reasonable measure for sequence similarity. However, these methods have drawbacks in offering overall sequence similarity, especially in dealing with eukaryotic genomes that often contain many insertions and duplications on sequences. Also these methods do not provide the explicit models for speciation, thus it is difficult to interpret their similarity measure into homology detection. Here, we present a novel method based on Word Conservation Score (WCS) to address the current limitations of homology detection. Instead of counting each amino acid, we adopted the concept of 'Word' to compare sequences. WCS measures overall sequence similarity by comparing word contents, which is much faster than BLAST comparisons. Furthermore, evolutionary distance between homologous sequences could be measured by WCS. Therefore, we expect that sequence comparison with WCS is useful for the multiple-species-comparisons of large genomes. In the performance comparisons on protein structural classifications, our method showed a considerable improvement over BLAST. Our method found bigger micro-syntenic blocks which consist of orthologs with conserved gene order. By testing on various datasets, we showed that WCS gives faster and better overall similarity measure compared to BLAST.

• 대한산업공학회지
• /
• 제29권1호
• /
• pp.49-64
• /
• 2003

Although assembly sequence planning is an essential task in assembly process planning, it is known as one of the most difficult and time consuming jobs because its complexity is increased geometrically when the number of parts in an assembly is increased. The purpose of this study is to develop a more efficient algorithm for generating assembly sequences automatically. By considering subassemblies, a new heuristic method generates a preferred parallel assembly sequence that can be used in robotic assembly systems. A parallel assembly sequence concept provides a new representation scheme for an assembly in which the assembly sequence precedence information is not required. After an user inputs both the directional mating relation information and the mating condition information, an assembly product is divided into subgroups if the product has cut-vertices. Then, a virtual disassembly process is executed to generate alternate parallel assembly sequences with intermediate assembly stability. Through searching parts relations in the virtual disassembly process, stable subassemblies are extracted from translation-free parts along disassembling directions and this extraction continues until no more subassemblies are existed. Also, the arithmetic mean parallelism formula as a preference criterion is adapted to select the best parallel assembly sequence among others. Finally a preferred parallel assembly sequence is converted to an assembly BOM structure. The results from this study can be utilized for developing CAAPP(Computer-Aided Assembly Process Planning) systems as an efficient assembly sequence planning algorithm.