Regular Article
An Algorithm for Constructing Local Regions in a Phylogenetic Network

https://doi.org/10.1006/mpev.2000.0891Get rights and content

Abstract

The groupings of taxa in a phylogenetic tree cannot represent all the conflicting signals that usually occur among site patterns in aligned homologous genetic sequences. Hence a tree-building program must compromise by reporting a subset of the patterns, using some discriminatory criterion. Thus, in the worst case, out of possibly a large number of equally good trees, only an arbitrarily chosen tree might be reported by the tree-building program as “The Tree.” This tree might then be used as a basis for phylogenetic conclusions. One strategy to represent conflicting patterns in the data is to construct a network. The Buneman graph is a theoretically very attractive example of such a network. In particular, a characterization for when this network will be a tree is known. Also the Buneman graph contains each of the most parsimonious trees indicated by the data. In this paper we describe a new method for constructing the Buneman graph that can be used for a generalization of Hadamard conjugation to networks. This new method differs from previous methods by allowing us to focus on local regions of the graph without having to first construct the full graph. The construction is illustrated by an example.

References (32)

  • K.A. Crandall et al.

    Empirical tests of some predictions from coalescent theory with applications to intraspecific phylogeny reconstruction

    Genetics

    (1993)
  • J. Dopazo et al.

    Split decomposition: A technique to analyze viral evolution

    Proc. Natl. Acad. Sci. USA

    (1993)
  • A. Dress et al.

    On the number of vertices and edges in the Buneman graph

    Ann. Combin.

    (1997)
  • M. Eigen

    Stufen zum Leben

    (1987)
  • M. Eigen et al.

    Statistical geometry on sequence space

    Methods Enzymol.

    (1990)
  • Cited by (7)

    • Inferring Process from Pattern in Fungal Population Genetics

      2004, Applied Mycology and Biotechnology
      Citation Excerpt :

      A second complication could arise if all loci have not accumulated sufficient mutations at the intraspecific level, or have undergone extensive intra- and inter-genic recombination. Recombination would scramble genealogical relationships, necessitating inference of phylogenetic networks rather than trees, a breaking area of theoretical research (Bandelt et al. 1999; Huber et al. 2001; Posada and Crandall 2001b; Strimmer and Moulton 2000; van Nimwegen et al. 1999; Wang et al. 2001). A further complication could arise when different loci evolve at different rates.

    • The relation graph

      2002, Discrete Mathematics
    • Phylogenetic networks: A new form of multivariate data summary for data mining and exploratory data analysis

      2014, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
    View all citing articles on Scopus
    1

    To whom correspondence should be addressed.

    View full text