E-business adoption research at the firm level has a strong grounding in both prior and current IS research. When designing empirical studies, researchers choose among a variety of base adoption models. This study is the first to empirically compare three prominent models regarding their explanatory power: the technology-organizationenvironment model, the task-technology-fit model, and the unif...

The latest charge against parsimony in phylogenetic inference is that it involves estimating too many parameters. The charge is derived from the fact that, when each character is allowed a branch length vector of its own (instead of the homogeneous branch lengths assumed in current likelihood models), the results for likelihood and parsimony are identical. Parsimony, however, can also be derive...

Hybridization events generate reticulate species relationships, giving rise to species networks rather than species trees. We report a comparative study of consensus, maximum parsimony, and maximum likelihood methods of species network reconstruction using gene trees simulated assuming a known species history. We evaluate the role of the divergence time between species involved in a hybridizati...

The phylogenetic inference of ancestral protein sequences is a powerful technique for the study of molecular evolution, but any conclusions drawn from such studies are only as good as the accuracy of the reconstruction method. Every inference method leads to errors in the ancestral protein sequence, resulting in potentially misleading estimates of the ancestral protein's properties. To assess t...

A phylogenetic algorithm computes a tree of distance relationships on a set, S, of phylogenetic descriptions (which may not be complete), given a phylogenetic-description transformation function, D, defined on S. Maximum Parsimony (MP) is a widely used phylogenetic algorithm that computes the shortest phylogenetic tree that represents the tree distances on S determined by D. To date, the sensit...

In phylogenetics, distances are often used to measure the incongruence between a pair of phylogenetic trees that are reconstructed by different methods or using different regions of genome. Motivated by the maximum parsimony principle in tree inference, we recently introduced the maximum parsimony (MP) distance, which enjoys various attractive properties due to its connection with several other...

Phylogeny reconstruction is too complex a combinatorial problem for an exhaustive search, because the number of possible solutions increases exponentially with the number of taxa involved. In this paper, we adopt the parsimony principle and design a tabu search algorithm for finding a most parsimonious phylogeny tree. A special array structure is employed to represent the topology of trees and ...

Partial 18S rRNA sequence of the nemertine Cerebratulus lacteus was obtained and compared with those of coelomate metazoans and acoelomate platyhelminths to test whether nemertines share a most recent common ancestor with the platyhelminths, as traditionally has been implied, or whether nemertines lie within a protostome coelomate clade, as suggested by more recent morphological analyses. Maxim...

In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n) time dynamic programming algorithm for computing the maximum circular ordering lower bound. The well-known gene order phylogeny program, GRAPPA, currently implements the brute-force exponential time algorithm and the Swap-as-yougo heuristic....

Phylogenetics is the study of evolutionary relations between different organisms. Phylogenetic trees are the representations of these relations. Researchers have been working on finding fast and systematic approaches to reconstruct phylogenetic trees from observed data for over 40 years. It has been shown that, given a certain criterion to evaluate each tree, finding the best fitted phylogeneti...