- We will send in 10–14 business days.
/images/books/13189977/9783639512182.jpg)
- Author: Fangrui Ma
- Publisher: Scholars' Press
- ISBN-10: 3639512189
- ISBN-13: 9783639512182
- Format: 15.2 x 22.9 x 1.1 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.21:46:53
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Fangrui Ma
- Publisher: Scholars' Press
- ISBN-10: 3639512189
- ISBN-13: 9783639512182
- Format: 15.2 x 22.9 x 1.1 cm, softcover
- Language: English English
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.
Reviews