Kun-Mao Chao – författare
Visar alla böcker från författaren Kun-Mao Chao. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Inbunden, Engelska, 2008
1 076 kr
Skickas inom 10-15 vardagar
Biomolecular sequence comparison is the origin of bioinformatics. This book gives a complete in-depth treatment of the study of sequence comparison.A comprehensive introduction is followed by a focus on alignment algorithms and techniques, proceeded by a discussion of the theory. The book examines alignment methods and techniques, features a new issue of sequence comparison - the spaced seed technique, addresses several new flexible strategies for coping with various scoring schemes, and covers the theory on the significance of high-scoring segment pairs between two unalignment sequences. Useful appendices on basic concepts in molecular biology, primer in statistics and software for sequence alignment are included in this reader-friendly text, as well as chapter-ending exercise and research questionsA state-of-the-art study of sequence alignment and homology search, this is an ideal reference for advanced students studying bioinformatics and will appeal to biologists who wish to know how to use homology search tools.
Del 7 - Computational Biology
Sequence Comparison
Theory and Methods
Häftad, Engelska, 2010
1 076 kr
Skickas inom 10-15 vardagar
Biomolecular sequence comparison is the origin of bioinformatics. This book gives a complete in-depth treatment of the study of sequence comparison.A comprehensive introduction is followed by a focus on alignment algorithms and techniques, proceeded by a discussion of the theory. The book examines alignment methods and techniques, features a new issue of sequence comparison - the spaced seed technique, addresses several new flexible strategies for coping with various scoring schemes, and covers the theory on the significance of high-scoring segment pairs between two unalignment sequences. Useful appendices on basic concepts in molecular biology, primer in statistics and software for sequence alignment are included in this reader-friendly text, as well as chapter-ending exercise and research questionsA state-of-the-art study of sequence alignment and homology search, this is an ideal reference for advanced students studying bioinformatics and will appeal to biologists who wish to know how to use homology search tools.
Häftad, Engelska, 2012
542 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.
Inbunden, Engelska, 2004
1 268 kr
Tillfälligt slut
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under one cover spanning tree properties, classical results, and recent research developments.Spanning Trees and Optimization Problems offers the first complete treatment of spanning tree algorithms, from their role in classical computer science to their most modern applications. The authors first explain the general properties of spanning trees, then focus on three main categories: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees. Along with the theoretical descriptions of the methods, numerous examples and applications illustrate the concepts in practice. The final chapter explores several other interesting spanning trees, including maximum leaf spanning trees, minimum diameter spanning trees, Steiner trees, and evolutionary trees.With logical organization, well chosen topics, and easy to understand pseudocode, the authors provide not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. This book will be a welcome addition to your reference shelf whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems