Gabriel Valiente Knihy

Focusing on graph isomorphism, this book delves into advanced graph algorithms, extending beyond traditional areas like shortest paths and network flows. It presents algorithmic techniques relevant to fields such as computational molecular biology and chemistry. The content is structured intuitively, with detailed explanations in a literate programming style, including correctness proofs and worst-case analyses. Additionally, it features complete C++ implementations of all algorithms using the LEDA library, making it a practical resource for both theoretical and applied aspects of graph algorithms.

Focusing on the exploration of patterns in biological sequences and data structures, this book illustrates how combinatorial pattern matching algorithms address challenges in computational biology, particularly in genomic and proteomic analysis. It presents algorithms intuitively, accompanied by detailed pseudo-code. Additionally, the author provides alternative implementations in Perl and R, facilitating algorithm testing and project development using the provided code.