Titlebook: Research in Computational Molecular Biology; 11th Annunal Interna Terry Speed,Haiyan Huang Conference proceedings 2007 Springer-Verlag Berl

浪蕩子

Estimating Genome-Wide Copy Number Using Allele Specific Mixture Models,sease subjects [23,11,25,26,5,4,7,18]. These include chromosomal regions with so-called copy number alterations: instead of the expected two copies, a section of the chromosome for a particular individual may have zero copies (homozygous deletion), one copy (hemizygous deletions), or more than two c

ACTIN

HEAVY

惹人反感

progestogen

Reconstructing the Phylogeny of Mobile Elements,bout our evolutionary history. However, because the mammalian genome contains millions of copies of mobile elements exhibiting a complex evolutionary history, traditional phylogenetic methods are ill-suited to reconstructing their history. New phylogenetic reconstruction algorithms which exploit the

莊嚴

Beyond Galled Trees - Decomposition and Computation of Galled Networks,er or recombination. The simplest form of these networks are galled trees, in which all reticulations are independent of each other. This paper introduces a more general class of reticulate networks, that we call galled networks, in which reticulations are not necessarily independent, but may overla

tolerance

Variational Upper Bounds for Probabilistic Phylogenetic Models, for example for the task of selecting suitable parameters for the model. We present a new approximation method, applicable for a wide range of probabilistic models, which guarantees to upper bound the true likelihood of data, and apply it to the problem of probabilistic phylogenetic models. The new

gangrene

Heuristics for the Gene-Duplication Problem: A ,(,) Speed-Up for the Local Search,ions. This problem is NP-hard and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. We show how this local search problem can be solved efficientl

難解

Support Vector Training of Protein Alignment Models,olvent accessibility, or evolutionary information improve sequence to structure alignment accuracy, but conventional generative estimation techniques for alignment models impose independence assumptions that make these features difficult to include in a principled way. In this paper, we overcome thi

和平主義