|
|
|
|
| LEADER |
03162nam a22004935i 4500 |
| 001 |
978-0-387-76731-4 |
| 003 |
DE-He213 |
| 005 |
20151204180527.0 |
| 007 |
cr nn 008mamaa |
| 008 |
101029s2011 xxu| s |||| 0|eng d |
| 020 |
|
|
|a 9780387767314
|9 978-0-387-76731-4
|
| 024 |
7 |
|
|a 10.1007/978-0-387-76731-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QH323.5
|
| 050 |
|
4 |
|a QH324.2-324.25
|
| 072 |
|
7 |
|a PDE
|2 bicssc
|
| 072 |
|
7 |
|a MAT003000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 570.285
|2 23
|
| 100 |
1 |
|
|a Reidys, Christian.
|e author.
|
| 245 |
1 |
0 |
|a Combinatorial Computational Biology of RNA
|h [electronic resource] :
|b Pseudoknots and Neutral Networks /
|c by Christian Reidys.
|
| 264 |
|
1 |
|a New York, NY :
|b Springer New York,
|c 2011.
|
| 300 |
|
|
|a X, 258 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 505 |
0 |
|
|a Introduction -- Secondary Structures, Pseudoknot RNA and Beyond -- Folding Sequences into Structures -- Evolution of RNA Sequences -- Methods -- References -- Index.
|
| 520 |
|
|
|a 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 pseudoknotted RNA structures and their random graph theory, including neutral paths, giant components and connectivity All algorithms presented in the book are implemented in C and are freely available through a link on springer.com. 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.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Evolutionary biology.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 650 |
|
0 |
|a Biomathematics.
|
| 650 |
1 |
4 |
|a Mathematics.
|
| 650 |
2 |
4 |
|a Mathematical and Computational Biology.
|
| 650 |
2 |
4 |
|a Combinatorics.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Evolutionary Biology.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9780387767307
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-0-387-76731-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
