Combinatorial problems of universal DNA tag sets보편적인 DNA 태그 집합에 관한 조합론적 문제

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 430
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Dong-Su-
dc.contributor.advisor김동수-
dc.contributor.authorCho, Eun-Kyung-
dc.contributor.author조은경-
dc.date.accessioned2011-12-14T04:54:07Z-
dc.date.available2011-12-14T04:54:07Z-
dc.date.issued2002-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=173582&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/42043-
dc.description학위논문(석사) - 한국과학기술원 : 수학전공, 2002.2, [ vi, 24 p. ; ]-
dc.description.abstractA 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.languageeng-
dc.publisher한국과학기술원-
dc.subjectDNA tag-
dc.subjectDNA 태그-
dc.titleCombinatorial problems of universal DNA tag sets-
dc.title.alternative보편적인 DNA 태그 집합에 관한 조합론적 문제-
dc.typeThesis(Master)-
dc.identifier.CNRN173582/325007-
dc.description.department한국과학기술원 : 수학전공, -
dc.identifier.uid020003527-
dc.contributor.localauthorKim, Dong-Su-
dc.contributor.localauthor김동수-
Appears in Collection
MA-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0