DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Dong-Su | - |
dc.contributor.advisor | 김동수 | - |
dc.contributor.author | Cho, Eun-Kyung | - |
dc.contributor.author | 조은경 | - |
dc.date.accessioned | 2011-12-14T04:54:07Z | - |
dc.date.available | 2011-12-14T04:54:07Z | - |
dc.date.issued | 2002 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=173582&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/42043 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수학전공, 2002.2, [ vi, 24 p. ; ] | - |
dc.description.abstract | A universal DNA tag system is a set of short single-stranded pieces of DNA(oligonucleotides) where each oligonucleotide has a much greater tendency to hybridize with its own Watson-Crick complement than the complement of the other oligonucleotides in the set. The oligonucleotides are referred to as tags and their Watson-Crick complements are referred to as antitags. It has a variety of uses especially labeling distinct chemicals. We implement an algorithm to design these oligonucleotides, apply the algorithm to generate a DNA tag system of other ratios of ω(C or G) / ω(A or T), and to find the largest string that uses each token at most once for a given collection of c-tokens. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | DNA tag | - |
dc.subject | DNA 태그 | - |
dc.title | Combinatorial problems of universal DNA tag sets | - |
dc.title.alternative | 보편적인 DNA 태그 집합에 관한 조합론적 문제 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 173582/325007 | - |
dc.description.department | 한국과학기술원 : 수학전공, | - |
dc.identifier.uid | 020003527 | - |
dc.contributor.localauthor | Kim, Dong-Su | - |
dc.contributor.localauthor | 김동수 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.