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.