Homologous gene finding with a hidden Markov model

The homology search problem and the gene finding problem are two fundamental problems in bioinformatics. The homology search problem is to find the homologous regions of two biological sequences; the gene finding problem is to find all the genes in both strands of a genomic sequence. Recently, gene finding research has demonstrated that homology search results can be used to improve the accuracy of gene finding. By combining the two problems, we define a new problem called the homologous gene finding problem. The homologous gene finding problem is to find homologous genes of a query gene in a target genomic sequence.;In this thesis, we also describe several experiments to evaluate and support our homologous gene finding algorithm.;Consequently, we present a new homologous gene finding algorithm in this thesis. We borrow the idea of gene mapping and alignment algorithms, and apply existing seed-based homology search algorithms and hidden Markov model-based (HMM-based) gene finding algorithms to solve the homologous gene finding problem. After we find high-scoring segment pairs (HSPs) between the query gene and the target genomic sequence, we locate target regions that we believe contain a gene homologous to the query gene. Then, we extend existing HMM-based gene finding algorithms to find homologous gene candidates. To improve the accuracy of homologous gene finding, we train a HMM to be biased toward the query gene. We also introduce a new coding sequence (CDS) length penalty as a measure of how the CDS lengths of the query gene and its homologous gene vary to further improve the accuracy. We use the new CDS length penalty together with our enhanced Viterbi algorithm and our flexible finish condition to improve the speed of homologous gene fining without harming the accuracy. Finally, we use protein alignment to pick and rank the best homologous gene candidates.