27 research outputs found

    Constructing Phylogenetic Networks based on Trinets

    Get PDF
    Abstract The motivation of phylogenetic analysis is to discover the evolutionary relationships between species, with the broader aim of understanding the origins of life. Our understanding of the molecular character- istics of species through DNA sequencing permanently changed the approach to understanding the evolution of species. Indeed, the ad- vancement of technology has played a major role in the fast sequencing of DNA as well as the use of computers in solving biological problems in general. These evolutionary relationships are often visualised and represented using a phylogenetic tree. As a natural generalisation of phylogenetic trees, phylogenetic networks are used in biology to rep- resent evolutionary histories that contain reticulate, or non-treelike events such as recombination, hybridisation and horizontal gene trans- fer. The reconstruction of explicit phylogenetic networks from biolog- ical data is currently an active area of phylogenetics research. Here we consider the problem of constructing such networks from trinets, that is, phylogenetic networks on three leaves. More speci�cally, we present the SeqTrinet and TriLoNet methods, which form a supernet- work based approach to constructing level-1 phylogenetic networks directly from multiple sequence alignments

    TriLoNet: Piecing together small networks to reconstruct reticulate evolutionary histories

    Get PDF
    Phylogenetic networks are a generalisation of evolutionary trees that can be used to represent reticulate processes such as hybridisation and recombination. Here we introduce a new approach called TriLoNet to construct such networks directly from sequence alignments which works by piecing together smaller phylogenetic networks. More specifically, using a bottom up approach similar to Neighbor-Joining, TriLoNet constructs level-1 networks (networks that are somewhat more general than trees) from smaller level-1 networks on three taxa. In simulations we show that TriLoNet compares well with Lev1athan, a method for reconstructing level-1 networks from three-leaved trees. In particular, in simulations we find that Lev1athan tends to generate networks that overestimate the number of reticulate events as compared with those generated by TriLoNet. We also illustrate TriLoNet’s applicability using simulated and real sequence data involving recombination, demonstrating that it has the potential to reconstruct informative reticulate evolutionary histories. TriLoNet has been implemented in JAVA and is freely available at https://www.uea.ac.uk/computing/TriLoNet

    A cubic-time algorithm for computing the trinet distance between level-1 networks

    Get PDF
    In evolutionary biology, phylogenetic networks are constructed to represent the evolution of species in which reticulate events are thought to have occurred, such as recombination and hybridization. It is therefore useful to have efficiently computable metrics with which to systematically compare such networks. Through developing an optimal algorithm to enumerate all trinets displayed by a level-1 network (a type of network that is slightly more general than an evolutionary tree), here we propose a cubic-time algorithm to compute the trinet distance between two level-1 networks. Employing simulations, we also present a comparison between the trinet metric and the so-called Robinson-Foulds phylogenetic network metric restricted to level-1 networks. The algorithms described in this paper have been implemented in JAVA and are freely available at (https://www.uea.ac.uk/computing/TriLoNet

    Effects of Patellar Taping on Knee Joint Proprioception

    No full text
    Introduction Although patellar taping is readily used in the treatment of patients with patellofemoral pain syndrome, doubts still exist as to the mechanism for its success. Patellar instability is often an area of concern with many forms of corrective treatment being instigated. It has been proposed tha
    corecore