• BMB Reports
• /
• 제50권4호
• /
• pp.201-207
• /
• 2017

Alternations in usage of polyadenylation sites during transcription termination yield transcript isoforms from a gene. Recent findings of transcriptome-wide alternative polyadenylation (APA) as a molecular response to changes in biology position APA not only as a molecular event of early transcriptional termination but also as a cellular regulatory step affecting various biological pathways. With the development of high-throughput profiling technologies at a single nucleotide level and their applications targeted to the 3'-end of mRNAs, dynamics in the landscape of mRNA 3'-end is measureable at a global scale. In this review, methods and technologies that have been adopted to study APA events are discussed. In addition, various bioinformatics algorithms for APA isoform analysis using publicly available RNA-seq datasets are introduced.

• Bulletin of the Korean Chemical Society
• /
• 제31권12호
• /
• pp.3639-3643
• /
• 2010

We have developed CUDA-enabled version of a general purpose molecular dynamics simulation code for GPU. Implementation details including parallelization scheme and performance optimization are described. Here we have focused on the non-bonded force calculation because it is most time consuming part in molecular dynamics simulation. Timing results using CUDA-enabled and CPU versions were obtained and compared for a biomolecular system containing 23558 atoms. CUDA-enabled versions were found to be faster than CPU version. This suggests that GPU could be a useful hardware for molecular dynamics simulation.

• 소성∙가공
• /
• 제12권3호
• /
• pp.171-183
• /
• 2003

• Bulletin of the Korean Chemical Society
• /
• 제21권2호
• /
• pp.200-206
• /
• 2000

• Bulletin of the Korean Chemical Society
• /
• 제10권2호
• /
• pp.216-218
• /
• 1989

• 대한약학회:학술대회논문집
• /
• 대한약학회 2000년도 NEW STRATEGY FOR DRUG DEVELOPMENT IN POST-GENOMIC ERA(대한약학회)
• /
• pp.185.1-185.1
• /
• 2000

• 한국진공학회:학술대회논문집
• /
• 한국진공학회 2007년도 제33회 하계학술대회 초록집
• /
• pp.333-333
• /
• 2007

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2923-2943
• /
• 2021

The double helix structure of DNA makes it diverse, stable and can store information with high density, and these characteristics are consistent with the requirements of molecular communication for transport carriers. In this paper, a specific structure of molecular communication system based on DNA length coding is proposed. Transmitter (Tx) adopts the multi-layer golden foil design to control the release of DNA molecules of different lengths accurately, and receiver (Rx) adopts an effective and sensitive design of nanopore, and the biological information can be converted to the electric signal at Rx. The effect of some key factors, e.g., the length of time slot, transmission distance, the number of releasing molecules, the priori probability, on channel capacity is demonstrated exhaustively. Moreover, we also compare the transmission capacity of DNA-based molecular communication (DNA-MC) system and concentration-based molecular communication (MC) system under the same parameter setting, and the peak value of capacity of DNA-MC system can achieve 0.08 bps, while the capacity of MC system remains 0.025 bps. The simulation results show that DNA-MC system has obvious advantages over MC system in saving molecular resources and improving transmission stability.

• Genomics & Informatics
• /
• 제1권1호
• /
• pp.25-31
• /
• 2003

Local alignment is an important task in molecular biology to see if two sequences contain regions that are similar. The most popular approach to local alignment is the use of dynamic programming due to Smith and Waterman, but the alignment reported by the Smith-Waterman algorithm has some undesirable properties. The recent approach to fix these problems is to use the notion of normalized scores for local alignments by Arslan, Egecioglu and Pevzner. In this paper we consider the problem of finding all local alignments whose normalized scores are above a given threshold, and present a fast heuristic algorithm. Our algorithm is 180-330 times faster than Arslan et al.'s for sequences of length about 120 kbp and about 40-50 times faster for sequences of length about 30 kbp.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제20권12호
• /
• pp.700-705
• /
• 2014

애너그램은 주어진 문자들을 재배열하여 숨겨진 단어를 찾아내는 철자바꾸기 놀이로, 문제를 빨리 풀어내는 사람들은 제약 만족 네트워크의 병렬적 탐색에 의해 문제를 해결한다. 본 연구에서는 이러한 인지적 현상을 모델링한 분자 애너그램 풀이 알고리즘을 제시하였다. 문자를 DNA 서열로 인코딩하고, 문자 DNA 가닥을 연결하여 바이그램과 단어 서열을 만들었다. DNA 혼성화, 연결, 젤 전기영동, 추출 연산을 수행해 문자와 바이그램 집합으로부터 답을 찾는 데 필요한 바이그램을 추출한 후, 추출한 바이그램과 단어 집합으로부터 다시 네 가지 DNA 연산을 반복하여 답을 찾는다. 분자 실험 결과 분자 컴퓨터는 정답인 단어와 오답인 단어를 구분해낼 수 있었다. 이를 통해 인간의 병렬적 사고과정을 분자 컴퓨터로 모델링할 수 있는 가능성을 보였다.