En savoir plus
With more and more biological sequences available, sequence analyses have become very important in bioinformatics and computational biology. In this book, we present the results of our research on genome sequence alignment, RNA folding with simple pseudoknots, and single nucleotide polymorphism (SNP) association pattern discovery with spatial constraints. In genome sequence alignment, we use the divide and conquer approach to reduce the computational complexity of multiple whole genome sequence alignment. Furthermore, we introduced the concept of solution space of genome sequence alignment to solve the problem that the current genome sequence alignment algorithms do not consider spatial constraints. The solution space is modeled as a multi-bipartite digraph. We provide efficient graph decomposition and traversal algorithms for processing the graph to output solutions as alignments of functionally equivalent clusters.
A propos de l'auteur
Dr. Ma is Director of Bioinformatics Core, Nebraska Center for Virology at University of Nebraska. He is interested in developing efficient algorithms to solve problems in Bioinformatics.Dr. Deogun is Professor of Computer Science and Engineering at University of Nebraska-Lincoln. He is interested in solving algorithmic problems in Bioinformatics.
