Evolution of Protein Molecules

https://www.engr.colostate.edu/~hj/journals/71.pdf

A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems

With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed resources. Such application scenarios require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflow management systems for Grid computing. In this paper, we propose a taxonomy that characterizes and classifies various approaches for building and executing workflows on Grids. We also survey several representative Grid workflow systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the design and engineering similarities and differences of state-of-the-art in Grid workflow systems, but also identifies the areas that need further research.

A Taxonomy of Workflow Management Systems for Grid Computing

Ray-finned fishes make up half of all living vertebrate species. Nearly all ray-finned fishes are teleosts, which include most commercially important fish species, several model organisms for genomics and developmental biology, and the dominant component of marine and freshwater vertebrate faunas. Despite the economic and scientific importance of ray-finned fishes, the lack of a single comprehensive phylogeny with corresponding divergence-time estimates has limited our understanding of the evolution and diversification of this radiation. Our analyses, which use multiple nuclear gene sequences in conjunction with 36 fossil age constraints, result in a well-supported phylogeny of all major ray-finned fish lineages and molecular age estimates that are generally consistent with the fossil record. This phylogeny informs three long-standing problems: specifically identifying elopomorphs (eels and tarpons) as the sister lineage of all other teleosts, providing a unique hypothesis on the radiation of early euteleosts, and offering a promising strategy for resolution of the “bush at the top of the tree” that includes percomorphs and other spiny-finned teleosts. Contrasting our divergence time estimates with studies using a single nuclear gene or whole mitochondrial genomes, we find that the former underestimates ages of the oldest ray-finned fish divergences, but the latter dramatically overestimates ages for derived teleost lineages. Our time-calibrated phylogeny reveals that much of the diversification leading to extant groups of teleosts occurred between the late Mesozoic and early Cenozoic, identifying this period as the “Second Age of Fishes.”

https://www.pnas.org/content/pnas/109/34/13698.full.pdf

Resolution of ray-finned fish phylogeny and timing of diversification

The author studies the complexity of the problem of allocating modules to processes in a distributed system to minimize total communication and execution costs. He shows that unless P=NP, there can be no polynomial-time epsilon -approximate algorithm for the problem, nor can there exist a local search algorithm that requires polynomial time per iteration and yields an optimum assignment. Both results hold even if the communication graph is planar and bipartite. On the positive side, it is shown that if the communication graph is a partial k-tree or an almost-tree with parameter k, the module allocation problem can be solved in polynomial time. >

Allocating modules to processors in a distributed system

Supertree methods synthesize collections of small phylogenetic trees with incomplete taxon overlap into comprehensive trees, or supertrees, that include all taxa found in the input trees. Supertree methods based on the well established Robinson-Foulds (RF) distance have the potential to build supertrees that retain much information from the input trees. Specifically, the RF supertree problem seeks a binary supertree that minimizes the sum of the RF distances from the supertree to the input trees. Thus, an RF supertree is a supertree that is consistent with the largest number of clusters (or clades) from the input trees. We introduce efficient, local search based, hill-climbing heuristics for the intrinsically hard RF supertree problem on rooted trees. These heuristics use novel non-trivial algorithms for the SPR and TBR local search problems which improve on the time complexity of the best known (naive) solutions by a factor of Θ(n) and Θ(n2) respectively (where n is the number of taxa, or leaves, in the supertree). We use an implementation of our new algorithms to examine the performance of the RF supertree method and compare it to matrix representation with parsimony (MRP) and the triplet supertree method using four supertree data sets. Not only did our RF heuristic provide fast estimates of RF supertrees in all data sets, but the RF supertrees also retained more of the information from the input trees (based on the RF distance) than the other supertree methods. Our heuristics for the RF supertree problem, based on our new local search algorithms, make it possible for the first time to estimate large supertrees by directly optimizing the RF distance from rooted input trees to the supertrees. This provides a new and fast method to build accurate supertrees. RF supertrees may also be useful for estimating majority-rule(-) supertrees, which are a generalization of majority-rule consensus trees.

/pdf/robinson-foulds-supertrees-4nodvpc3zz.pdf

Robinson-Foulds supertrees.

This paper presents a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed. This solves a longstanding open problem. This result should be contrasted with the proof by Steel [J. Classification, 9(1992), pp. 91--116] and Bodlaender, Fellows, and Warnow [Proceedings of the19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 1992, pp. 273--283] that the perfect phylogeny problem is NP complete in general.

A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny inference is obfuscated by incongruence among gene trees due to evolutionary events such as gene duplication and loss, incomplete lineage sorting (deep coalescence), and horizontal gene transfer. Gene tree parsimony (GTP) addresses this issue by seeking a species tree that requires the minimum number of evolutionary events to reconcile a given set of incongruent gene trees. Despite its promise, the use of gene tree parsimony has been limited by the fact that existing software is either not fast enough to tackle large data sets or is restricted in the range of evolutionary events it can handle. We introduce iGTP, a platform-independent software program that implements state-of-the-art algorithms that greatly speed up species tree inference under the duplication, duplication-loss, and deep coalescence reconciliation costs. iGTP significantly extends and improves the functionality and performance of existing gene tree parsimony software and offers advanced features such as building effective initial trees using stepwise leaf addition and the ability to have unrooted gene trees in the input. Moreover, iGTP provides a user-friendly graphical interface with integrated tree visualization software to facilitate analysis of the results. iGTP enables, for the first time, gene tree parsimony analyses of thousands of genes from hundreds of taxa using the duplication, duplication-loss, and deep coalescence reconciliation costs, all from within a convenient graphical user interface.

/pdf/igtp-a-software-package-for-large-scale-gene-tree-parsimony-5gjt92wzun.pdf

iGTP: a software package for large-scale gene tree parsimony analysis.

We present a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed. This solves a longstanding open problem. Our result should be contrasted with the proof by Steel and Bodlaender, Fellows, and Warnow that the perfect phylogeny problem is NP-complete in general. >

https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1009&context=cs_techreports

David Fernández-Baca

Papers

Allocating modules to processors in a distributed system

Robinson-Foulds supertrees.

A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

iGTP: a software package for large-scale gene tree parsimony analysis.

A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed