Toward automatic reconstruction of a highly resolved tree of life

Contains fulltext : 51078.pdf (publisher's version ) (Closed access)We have developed an automatable procedure for reconstructing the tree of life with branch lengths comparable across all three domains. The tree has its basis in a concatenation of 31 orthologs occurring in 191 species with sequenced genomes. It revealed interdomain discrepancies in taxonomic classification. Systematic detection and subsequent exclusion of products of horizontal gene transfer increased phylogenetic resolution, allowing us to confirm accepted relationships and resolve disputed and preliminary classifications. For example, we place the phylum Acidobacteria as a sister group of delta-Proteobacteria, support a Gram-positive origin of Bacteria, and suggest a thermophilic last universal common ancestor

Quadratic Assignment Problem. 1 Acknowledgments

When they introduced the Ant System paradigm, Dorigo, Maniezzo, and Colorni also suggested an improvement to the original algorithm. By making use of global information, a set of ‘elitist ’ ants could focus the search, potentially accelerating convergence on an optimal solution. In a later paper, White, Kaegi, and Oda proposed a refinement of elitism in which local information is used instead of global information. By focusing the search on the local best tours (LBT) rather than the global best tour, the ants could search a wider area and avoid becoming trapped in local optima. Test results using the symmetric Travelling Salesman Problem showed considerable promise. We will examine the effectiveness of this refinement when applied against the assymetrica

Regular realizations of p-groups

textThis thesis is concerned with the Regular Inverse Galois Problem for p-groups over fields of characteristic unequal to p. Building upon results of Saltman, Dentzer characterized a class of finite groups that are automatically realized over every field, and proceeded to show that every group of order dividing p⁴ belongs to this class. We extend this result to include groups of order p⁵, provided that the base field k contains the p³-th roots of unity. The proof involves reducing to certain Brauer embedding problems defined over the rational function field k(x). Through explicit computation, we describe the cohomological obstructions to these embedding problems. Then by applying results about the Brauer group of a Dedekind domain, we show that they all possess solutions.Mathematic