000			03129nam a22004575i 4500
001			978-0-387-76731-4
003			DE-He213
005			20250710084025.0
007			cr nn 008mamaa
008			101029s2011 xxu| s |||| 0|eng d
020			_a9780387767314 _a99780387767314
024	7		_a10.1007/978-0-387-76731-4 _2doi
082	0	4	_a570.151 _223
100	1		_aReidys, Christian. _eauthor.
245	1	0	_aCombinatorial Computational Biology of RNA _h[recurso electrónico] : _bPseudoknots and Neutral Networks / _cby Christian Reidys.
264		1	_aNew York, NY : _bSpringer New York, _c2011.
300			_aIX, 257p. 123 illus., 53 illus. in color. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aIntroduction -- Secondary Structures, Pseudoknot RNA and Beyond -- Folding Sequences into Structures -- Evolution of RNA Sequences -- Methods -- References -- Index.
520			_aIn 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	_aMATHEMATICS.
650		0	_aCOMPUTATIONAL COMPLEXITY.
650		0	_aEVOLUTION (BIOLOGY).
650		0	_aBIOLOGY _xMATHEMATICS.
650		0	_aCOMBINATORICS.
650	1	4	_aMATHEMATICS.
650	2	4	_aMATHEMATICAL BIOLOGY IN GENERAL.
650	2	4	_aCOMBINATORICS.
650	2	4	_aDISCRETE MATHEMATICS IN COMPUTER SCIENCE.
650	2	4	_aEVOLUTIONARY BIOLOGY.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387767307
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-76731-4 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SMA
942			_2ddc _cER
999			_c58832 _d58832