Combinatorial Computational Biology of RNA
Pseudoknots and Neutral Networks
Seiten
2010
Springer-Verlag New York Inc.
978-0-387-76730-7 (ISBN)
Springer-Verlag New York Inc.
978-0-387-76730-7 (ISBN)
In this monograph, new combinatorial and computational approaches in the study of RNA structures are presented which enhance both mathematics and computational biology.
It begins with an introductory chapter, which motivates and sets the background of this research. In the following chapter, all the concepts are systematically developed.
The reader will find
* integration of more than forty research papers covering topics like,
RSK-algorithm, reflection principle, singularity analysis and random
graph theory
* systematic presentation of the theory of pseudo-knotted RNA structures
including their generating function, uniform generation as well as central
and discrete limit theorems
* computational biology of pseudo-knotted RNA structures, including dynamic
programming paradigms and a new folding algorithm
* analysis of neutral networks of pseudo knotted RNA structures and their
random graph theory, including neutral paths, giant components and
connectivity
All algorithms presented are freely available through springer.com and implemented in C. A proofs section at the end contains the necessary technicalities.
This book will serve graduate students and researchers in the fields of discrete mathematics, mathematical and computational biology. It is suitable as a textbook for a graduate course in mathematical and computational biology.
It begins with an introductory chapter, which motivates and sets the background of this research. In the following chapter, all the concepts are systematically developed.
The reader will find
* integration of more than forty research papers covering topics like,
RSK-algorithm, reflection principle, singularity analysis and random
graph theory
* systematic presentation of the theory of pseudo-knotted RNA structures
including their generating function, uniform generation as well as central
and discrete limit theorems
* computational biology of pseudo-knotted RNA structures, including dynamic
programming paradigms and a new folding algorithm
* analysis of neutral networks of pseudo knotted RNA structures and their
random graph theory, including neutral paths, giant components and
connectivity
All algorithms presented are freely available through springer.com and implemented in C. A proofs section at the end contains the necessary technicalities.
This book will serve graduate students and researchers in the fields of discrete mathematics, mathematical and computational biology. It is suitable as a textbook for a graduate course in mathematical and computational biology.
Introduction.- Secondary Structures, Pseudoknot RNA and Beyond.- Folding Sequences into Structures.- Evolution of RNA Sequences.- Methods.- References.- Index.
| Erscheint lt. Verlag | 1.11.2010 |
|---|---|
| Zusatzinfo | X, 258 p. |
| Verlagsort | New York, NY |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Weitere Themen ► Bioinformatik |
| Mathematik / Informatik ► Mathematik ► Algebra | |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| Naturwissenschaften ► Biologie ► Evolution | |
| Naturwissenschaften ► Biologie ► Genetik / Molekularbiologie | |
| ISBN-10 | 0-387-76730-4 / 0387767304 |
| ISBN-13 | 978-0-387-76730-7 / 9780387767307 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Internationale statistische Klassifikation der Krankheiten und …
Buch | Softcover (2023)
Deutscher Ärzteverlag
CHF 34,95
Operationen- und Prozedurenschlüssel; Internationale Klassifikation …
Buch | Softcover (2023)
Deutscher Ärzteverlag
CHF 34,95
