Introduction to Computational Molecular Biology

TL;DR: In this article, a maniere generale des procedes permettant d'identifier and d'utiliser des proteines and des produits de transcription specifiques d'organes is presented.

TL;DR: Non-deterministic formal grammars are presented to define biologically interesting subsequences of DNA and compact representations of ambiguities by directed acyclic graphs are presented.

TL;DR: This overview paper shows how the concept of breakpoint graph, known from the theory of sorting by reversal, can be used in the Theory of gene assembly, and presents the material in an intuitive and informal manner to allow for an efficient introduction into the subject.

TL;DR: A method for constructing compact representations of de Bruijn subgraphs without passing through the usual memory expensive step of constructing the graph in its traditional form is presented and used in three different applications: marking repeated sequences in a set of reads, identifying new repeat families in incompletely sequenced genomes, and creating splicing graphs for a collection of transcripts.

TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.

TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.

TL;DR: Recent developments of statistical methods in molecular phylogenetics are reviewed and it is shown that the mathematical foundations of these methods are not well established, but computer simulations and empirical data indicate that currently used methods produce reasonably good phylogenetic trees when a sufficiently large number of nucleotides or amino acids are used.