000 03033nam a22003615i 4500
001 279568
003 MX-SnUAN
005 20160429153950.0
007 cr nn 008mamaa
008 150903s2011 xxu| o |||| 0|eng d
020 _a9780387767314
_99780387767314
024 7 _a10.1007/9780387767314
_2doi
035 _avtls000332740
039 9 _a201509030757
_bVLOAD
_c201404122236
_dVLOAD
_c201404092006
_dVLOAD
_y201402041036
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQH323.5
100 1 _aReidys, Christian.
_eautor
_9303973
245 1 0 _aCombinatorial Computational Biology of RNA :
_bPseudoknots and Neutral Networks /
_cby Christian Reidys.
264 1 _aNew York, NY :
_bSpringer New York,
_c2011.
300 _aIx, 257 páginas 123 ilustraciones, 53 ilustraciones en color.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387767307
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-76731-4
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c279568
_d279568