Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
Improvements On Segment Based Contours Method For Dna Microarray Image Segmentation, Yang Li
Improvements On Segment Based Contours Method For Dna Microarray Image Segmentation, Yang Li
Doctoral Dissertations
DNA microarray is an efficient biotechnology tool for scientists to measure the expression levels of large numbers of genes, simultaneously. To obtain the gene expression, microarray image analysis needs to be conducted. Microarray image segmentation is a fundamental step in the microarray analysis process. Segmentation gives the intensities of each probe spot in the array image, and those intensities are used to calculate the gene expression in subsequent analysis procedures. Therefore, more accurate and efficient microarray image segmentation methods are being pursued all the time.
In this dissertation, we are making efforts to obtain more accurate image segmentation results. We …
A Mathematical Model And Numerical Method For Thermoelectric Dna Sequencing, Liwei Shi
A Mathematical Model And Numerical Method For Thermoelectric Dna Sequencing, Liwei Shi
Doctoral Dissertations
DNA sequencing is the process of determining the precise order of nucleotide bases, adenine, guanine, cytosine, and thymine within a DNA molecule. It includes any method or technology that is used to determine the order of the four bases in a strand of DNA. The advent of rapid DNA sequencing methods has greatly accelerated biological and medical research and discovery. Thermoelectric DNA sequencing is a novel method to sequence DNA by measuring the heat that is released when DNA polymerase inserts a deoxyribonucleoside triphosphate into a growing DNA strand. The thermoelectric device for this project is composed of four parts: …
The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen
The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen
Doctoral Dissertations
Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then a practical approach is described, which separates out important algorithmic decisions so that the algorithm can be easily …