Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/65312
Title: Two algorithmic problems in analyzing genetic and epigenetic variations
Authors: Sun, Ruimin
Keywords: DRNTU::Science::Mathematics::Discrete mathematics::Algorithms
DRNTU::Science::Biological sciences::Genetics
Issue Date: 2015
Source: Sun, R. (2015). Two algorithmic problems in analyzing genetic and epigenetic variations. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: Single nucleotide polymorphism (SNP) is the most common type of genetic variations.Accurate detection of SNPs is crucial to many downstream studies. To detect SNPs, MALDI-TOF mass spectrometry combined with base-specific cleavage reactions has been employed in many experiments. A new SNP detecting algorithm is presented in the thesis, together with the performance evaluation of its implemented program called SnpMs.Results demonstrate that SnpMs has a high ability to detect SNP mutations accurately. Cytosine methylation plays an important role in many biological regulation processes. The current golden standard method for analyzing cytosine methylation is BS-Seq. In this thesis, a new tool called TAMeBS is introduced to align BS-Seq reads and estimate the methylation status of each cytosine. Experimental results on both simulated and real data showed that TAMeBS could detect many more uniquely best mapped reads while achieving a good balance between sensitivity and precision.
URI: https://hdl.handle.net/10356/65312
DOI: 10.32657/10356/65312
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Theses

Files in This Item:
File Description SizeFormat 
Thesis_Ruimin_SUN.pdf1.44 MBAdobe PDFThumbnail
View/Open

Page view(s) 50

362
checked on Oct 26, 2020

Download(s) 50

123
checked on Oct 26, 2020

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.