Introduction to Computational Molecular Biology

TL;DR: In this paper, the authors propose a set of procedures, trousses, and systemes for the analysis of molecules in an echantillon, which concerne des procedes, trouses, et systemes, for l'analyse d'une ou plusieurs molecules.

TL;DR: In this article, a carte de pointage of a cellule souche pluripotentes (CSPLP) is defined, i.e., an ensemble of donnees de reference or a caractere approprié d'une lignee de cellules souches pluripototentes for l'utilisation voulue.

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.