A Computation of Repeats in Complete Genomes
碩士 === 國立中央大學 === 資訊工程研究所 === 88 === Repeat sequences are the most abundant sequences in extragenic region of genome. At present, biologists found that a large number of regulatory elements located here. They also may play an important role in the chromatin structure information in nucleus and conta...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14680111725273478570 |
| Summary: | 碩士 === 國立中央大學 === 資訊工程研究所 === 88 === Repeat sequences are the most abundant sequences in extragenic region of genome. At present, biologists found that a large number of regulatory elements located here. They also may play an important role in the chromatin structure information in nucleus and contain important clues in genetic evolution and phylogeny study. This thesis develops an algorithm which allows to determine all exact repeat sequences contained in complete genomes. The algorithm can find both direct and inverted repeats. Our approach can find repeats whose length is longer than twenty bases and small repeats efficiently.
|
|---|