miun.sePublications
Change search
Refine search result
1 - 23 of 23
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1. Allain, J. P.
    et al.
    Dong, Y.
    Vandamme, A. M.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Salemi, M.
    Evolutionary rate and genetic drift of hepatitis C virus are not correlated with the host immune response: Studies of infected donor-recipient clusters2000In: Journal of Virology, ISSN 0022-538X, E-ISSN 1098-5514, Vol. 74, no 6, 2541-2549 p.Article in journal (Refereed)
    Abstract [en]

    Six donor-recipient clusters of hepatitis C virus (HCV)-infected individuals were studied. For five clusters the period of infection of the donor could be estimated, and for all six clusters the time of infection of the recipients from the donor via blood transfusion was also precisely known. Detailed phylogenetic analyses were carried out to investigate the genomic evolution of the viral quasispecies within infected individuals in each cluster. The molecular clock analysis showed that HCV quasispecies within a patient are evolving at the same rate and that donors that have been infected for longer time tend to have a lower evolutionary rate. Phylogenetic analysis based on the split decomposition method revealed different evolutionary patterns in different donor-recipient clusters. Reactivity of antibody against the first hypervariable region (HVR1) of HCV in donor and recipient sera was evaluated and correlated to the calculated evolutionary rate. Results indicate that anti-HVR1 reactivity was related more to the overall level of humoral immune response of the host than to the HVR1 sequence itself, suggesting that the particular sequence of the HVR1 peptides is not the determinant of reactivity. Moreover, no correlation was found between the evolutionary rate or the heterogeneity of the viral quasispecies in the patients and the strength of the immune response to HVR1 epitopes, Rather, the results seem to imply that genetic drift is less dependent on immune pressure than on the rate of evolution and that the genetic drift of HCV is independent of the host immune pressure.

  • 2. Bandelt, H J
    et al.
    Huber, Katharina T
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Quasi-median graphs from sets of partitions2002In: Discrete Applied Mathematics, ISSN 0166-218X, Vol. 122, no 1-3, 23-35 p.Article in journal (Refereed)
    Abstract [en]

    In studies of molecular evolution, one is typically confronted with the task of inferring a phylogenetic tree from a set X of sequences of length n over a finite alphabet Λ. For studies that invoke parsimony, it has been found helpful to consider the quasi-median graph generated by X in the Hamming graph Λn. Although a great deal is already known about quasi-median graphs (and their algebraic counterparts), little is known about the quasi-median generation in Λn starting from a set X of vertices. We describe the vertices of the quasi-median graph generated by X in terms of the coordinatewise partitions of X. In particular, we clarify when the generated quasi-median graph is the so-called relation graph associated with X. This immediately characterizes the instances where either a block graph or the total Hamming graph is generated. 

  • 3. Cieslik, D
    et al.
    Dress, A
    Huber, Katharina T
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Connectivity calculus2003In: Applied Mathematics Letters, ISSN 0893-9659, E-ISSN 1873-5452, Vol. 16, no 3, 395-399 p.Article in journal (Refereed)
    Abstract [en]

    Given a finite hypergraph H = (V, E) and, for each e E E, a collection of nonempty subsets pi(e) of e, Mobius inversion is used to establish a recursive formula for the number of connected components of the hypergraph H = (V, boolean OR(eis an element ofE)pi(e)). As shown elsewhere, this formula is an essential ingredient in the context of a certain divide-and-conquer strategy that allows us to define a dynamical programming scheme solving Steiner's problem for graphs in linear time (however, with a constant depending hyperexponentially on their tree width).

  • 4. Dress, A.
    et al.
    Huber, K. T.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Affine maps that induce polyhedral complex isomorphisms2000In: Discrete & Computational Geometry, ISSN 0179-5376, E-ISSN 1432-0444, Vol. 24, no 1, 49-60 p.Article in journal (Refereed)
    Abstract [en]

    In this paper we show that an affine bijection f: T-1 --> T-2 between two polyhedral complexes T-1, T-2, both of which consist of a union of faces of two convex polyhedra P-1 and P-2, necessarily respects the cell-complex structure of T-1 and T-2 inherited from P-1 and P-2, respectively, provided f extends to an affine map from P-1 into P-2. In addition, we present an application of this result within the area of T-theory to obtain a far-reaching generalization of previous results regarding the equivalence of two distinct constructions of the phylogenetic tree associated to "perfect" (that is, treelike) distance data.

  • 5. Dress, A.
    et al.
    Huber, K. T.
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex2002In: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 168, no 1, 1-28 p.Article in journal (Refereed)
  • 6. Dress, A.
    et al.
    Huber, K. T.
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Antipodal metrics and split systems2002In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 23, no 2, 187-200 p.Article in journal (Refereed)
    Abstract [en]

    Recall that a metric d on a finite set X is called antipodal if there exists a map sigma : X --> X: x --> (x) over bar so that d(x, (x) over bar) = d(x, y) + d(y, (x) over bar) holds for all x, y epsilon X. Antipodal metrics canonically arise as metrics induced on specific weighted graphs, although their abundance becomes clearer in light of the fact that any finite metric space can be isometrically embedded in a more or less canonical way into an antipodal metric space called its full antipodal extension. In this paper, we examine in some detail antipodal metrics that are, in addition, totally split decomposable. In particular, we give an explicit characterization of such metrics, and prove that-somewhat surprisingly-the full antipodal extension of a proper metric d on a finite set X is totally split decomposable if and only if d is linear or #X = 3 holds.

  • 7.
    Dress, A.
    et al.
    FSPM-Strukturbildungsprozesse, University of Bielefeld, D-33501 Bielefeld, Germany.
    Huber, Katharina T
    Institute of Fundamental Sciences, Massey University, Private Bag 11 222, Palmerston North, New Zealand.
    Koolen, J. H.
    FSPM-Strukturbildungsprozesse, University of Bielefeld, D-33501 Bielefeld, Germany.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Six points suffice: How to check for metric consistency2001In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 22, no 4, 465-474 p.Article in journal (Refereed)
    Abstract [en]

    In many areas of data analysis, it is desirable to have tools at hand for analyzing the structure of distance tables-or, in more mathematical terms, of finite metric spaces. One such tool, known as split decomposition theory has proven particularly useful in this respect. Tbe class of so-called totally decomposable metrics forms a cornerstone for this theory, and much work has been devoted to their study. Recently, it has become apparent that a particular subclass of these metrics, the consistent metrics, are also of fundamental importance. In this paper, we give a six-point characterization of consistent metrics amongst the totally decomposable ones.

  • 8. Dress, A.
    et al.
    Koolen, J. H.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    On line arrangements in the hyperbolic plane2002In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 23, no 5, 549-557 p.Article in journal (Refereed)
    Abstract [en]

    Given a finite collection L of lines in the hyperbolic plane H, we denote by k = k(L) its Karzanov number, i.e., the maximal number of pairwise intersecting lines in L, and by C(L) and n = n(L) the set and the number, respectively, of those points at infinity that are incident with at least one line from L. By using purely combinatorial properties of cyclic seta:, it is shown that #L less than or equal to 2nk - ((2k+1)(2)) always holds and that #L equals 2nk - ((2k+1)(2)) if and only if there is no collection L' of lines in H with L subset of or equal to L', k(L') = k(L) and C(L') = C(L).

  • 9.
    Edvardsson, Sverker
    et al.
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Technology and Media.
    Gardner, Paul P.
    Poole, Anthony M
    Hendy, Michael D
    Penny, David
    Moulton, Vincent
    A search for H/ACA snoRNAs in yeast using MFE secondary structure prediction2003In: Bioinformatics, ISSN 1367-4803, Vol. 19, no 7, 865-873 p.Article in journal (Refereed)
    Abstract [en]

    We develop an algorithm to screen the yeast genome for novel H/ACA snoRNAs. To achieve this, we introduce some new methods for facilitating the search for noncoding RNAs in genomic sequences which are based on properties of predicted minimum free-energy (MFE) secondary structures. The algorithm has been implemented and can be generalized to enable screening of other eukaryote genomes. We find that use of primary sequence alone is insufficient for identifying novel H/ACA snoRNAs. Only the use of secondary structure filters reduces the number of candidates to a manageable size. From genomic context, we identify three strong H/ACA snoRNA candidates. These together with a further 47 candidates obtained by our analysis are being experimentally screened.

  • 10. Goodman, O.
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    On the tight span of an antipodal graph2000In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 218, no 1-3, 73-96 p.Article in journal (Refereed)
    Abstract [en]

    The tight span of a finite metric space is essentially the 'smallest' path geodesic space into which the metric space embeds isometrically. In this situation, the tight span is also contractible and has a natural cell structure, so that it lends itself naturally to the study of the Cayley graph of a group. As a first step in this study, we consider the tight span of a metric space which arises from the graph metric of an antipodal graph. In particular, we develop techniques for the study of the tight span of a graph, which we then apply to antipodal graphs. In this way, we are able to find the polytopal structure of the tight span for special examples of antipodal graphs. Finally, we present computer generated examples of tight spans which were made possible by the techniques developed in this paper. (C) 2000 Elsevier Science B.V. All rights reserved.

  • 11. Gutman, I.
    et al.
    Koolen, J. H.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Parac, M.
    Soldatovic, T.
    Vidovic, D.
    Estimating and approximating the total pi-electron energy of benzenoid hydrocarbons2000In: Zeitschrift fur Naturforschung A-A Journal of Physical Sciences, ISSN 0932-0784, E-ISSN 1865-7109, Vol. 55, no 5, 507-512 p.Article in journal (Refereed)
    Abstract [en]

    Lower and upper bounds as well as approximate formulas for the total pi-electron energy (E) of benzenoid hydrocarbons are deduced, depending only on the number of carbon atoms (n) and number of carbon-carbon bonds (m). These are better than the several previously known (n, m)-type estimates and approximations for E.

  • 12.
    Huber, K. T.
    et al.
    Institute of Fundamental Sciences, Massey University, Private Bag 11 222, Palmerston North, New Zealand.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    The relation graph2002In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 244, no 1-3, 153-166 p.Article in journal (Refereed)
    Abstract [en]

    Given a set R of distinct, non-trivial partitions of a finite set, we define the relation graph G(R) of R. In case R consists only of bipartitions, G(R) is the well-known Buneman graph, a median graph that has applications in the area of phylogenetic analysis., Here we consider properties of the relation graph for general sets of partitions and, in particular, we see that it mimics the behaviour of the Buneman graph by proving the following two theorems:(i) The graph G(R) is a Hamming graph if and only if R is strongly incompatible.(ii) The graph G(R) is a block graph with #R blocks if and only if R is strongly compatible.

  • 13.
    Huber, Katharina T
    et al.
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Lockhart, Peter
    Institute of Biomolecular Sciences, Massey University, PO Box 11-222, Palmerston North, New Zealand.
    Dress, A.
    FSPM-Strukturbildungsprozesse, University of Bielefeld, D-33501, Bielefeld, Germany.
    Pruned median networks: A technique for reducing the complexity of median networks2001In: Molecular Phylogenetics and Evolution, ISSN 1055-7903, E-ISSN 1095-9513, Vol. 19, no 2, 302-310 p.Article in journal (Refereed)
    Abstract [en]

    Observations from molecular marker studies on recently diverged species indicate that substitution patterns in DNA sequences can often be complex and poorly described by tree-like bifurcating evolutionary models. These observations might result from processes of-species diversification and/or processes of sequence evolution that are not tree-like. In these Cases, bifurcating tree representations provide poor visualization of phylogenetic signals in sequence data. In this paper, we use median networks to study DNA sequence substitution patterns in plant nuclear and chloroplast markers. We describe how to prune median networks to obtain so called pruned median networks. These simpler networks may help to provide a useful framework for investigating the phylogenetic complexity of recently diverged taxa with hybrid origins.

  • 14. Koolen, J H
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Hyperbolic bridged graphs2002In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 23, no 6, 683-699 p.Article in journal (Refereed)
    Abstract [en]

    Given a connected graph G, we take, as usual, the distance xy between any two vertices x, y of G to be the length of some geodesic between x and y. The graph G is said to be delta-hyperbolic, for some 3 : 0, if for all vertices x, y, u, v in G the inequality xy + uv :5 max{xu + yv, xv + yu} + delta holds, and G is bridged if it contains no finite isometric cycles of length four or more. In this paper, we will show that a finite connected bridged graph is 1-hyperbolic if and only if it does not contain any of a list of six graphs as an isometric subgraph.

  • 15. Koolen, J H
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Maximal energy bipartite graphs2003In: Graphs and Combinatorics, ISSN 0911-0119, E-ISSN 1435-5914, Vol. 19, no 1, 131-135 p.Article in journal (Refereed)
    Abstract [en]

    Given a graph G, its energy E(G) is defined to be the sum of the absolute values of the eigenvalues of G. This quantity is used in chemistry to approximate the total pi-electron energy of molecules and in particular, in case G is bipartite, alternant hydrocarbons. Here we show that if G is a bipartite graph with n vertices, thenE(G) less than or equal to n/(root8 (root2 + n)must hold, characterize those bipartite graphs for which this bound is sharp, and provide an infinite family of maximal energy bipartite graphs.Given a graph G, define the energy of G, denoted E(G), by[GRAPHICS]where the eigenvalues of, G are simply those of the adjacency matrix of G. In chemistry, the energy of a graph is intensively studied since it can be used to approximate, the total pi-electron energy of a molecule (see, for example, [3, 6, 8]). In [12], we considered maximal energy graphs (see also [9, 10, 13, 14, 17] for related results). In particular, for any graph G with n vertices, we derived an improvement of the well-known McClelland bound [15] for the energy of a graph, showing thatE(G) less than or equal to n/2(1 + rootn)must hold. We also characterized those graphs for which this bound is sharp, i.e. the maximal energy graphs, and provided an infinite family of such graphs.

  • 16.
    Koolen, J H
    et al.
    Univ Bielefeld.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Maximal energy graphs2001In: Advances in Applied Mathematics, ISSN 0196-8858, E-ISSN 1090-2074, Vol. 26, no 1, 47-52 p.Article in journal (Refereed)
    Abstract [en]

    Given a graph G, its energy E(G) is defined as the sum of the absolute values of the eigenvalues of G. The concept of the energy of a graph was introduced in the subject of chemistry by I. Gutman. due to its relevance to the total pi -elrctron energy of certain molecules. In this paper, we show that if G is a graph on n vertices, then E(G) less than or equal to (n/2)(1 + rootn) must hold, and we give an infinite family of graphs for which this bound is sharp.

  • 17. Koolen, J. H.
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Gutman, I.
    Improving the McClelland inequality for total pi-electron energy2000In: Chemical Physics Letters, ISSN 0009-2614, E-ISSN 1873-4448, Vol. 320, no 3-4, 213-216 p.Article in journal (Refereed)
    Abstract [en]

    The McClelland inequality, E less than or equal to root 2mn, estimates the total pi-electron energy (E) of a conjugated hydrocarbon by means of the number of carbon atoms (n) and the number of carbon-carbon bonds (m). We now show that in the general case 2m/n + root(n - 1)(2m - 4m(2)/n(2)) is a better (n,m)-type upper bound for E. An even better estimate, 4m/n + root(n - 2)(2m - 8m(2)/n(2)), holds for alternant hydrocarbons. (C) 2000 Elsevier Science B.V. All rights reserved.

  • 18. Koolen, J. H.
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Gutman, I.
    Vidovic, D.
    More hyperenergetic molecular graphs2000In: Journal of the Serbian Chemical Society, ISSN 0352-5139, E-ISSN 1820-7421, Vol. 65, no 8, 571-575 p.Article in journal (Refereed)
    Abstract [en]

    If G is a molecular graph and lambda(1), lambda(2),... lambda(n) are its eigenvalues, then the energy of G is equal to E(G) = \lambda(1)\+ \lambda(2)\+... + \lambda(n)\. This energy cannot exceed the value n root(n - 1) approximate to n(3/2). The graph G is said to be hyperenergetic if E(G) > 2n - 2. We describe the construction of hyperenergetic graphs G for which E(G) approximate to 1/2 n(3/2).

  • 19. Koolen, J.
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Tonges, U.
    A classification of the six-point prime metrics2000In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 21, no 6, 815-829 p.Article in journal (Refereed)
    Abstract [en]

    The notion of a coherent decomposition of a metric on a finite set has proven fruitful, with applications to areas such as the geometry of metric cones and bioinformatics. In order to obtain a deeper insight into these decompositions it is important to improve our knowledge of those metrics which cannot be coherently decomposed in a non-trivial way, i.e.,the prime metrics. In this paper we classify the prime metrics on six points. (C) 2000 Academic Press.

  • 20.
    Moulton, Vincent
    et al.
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Gardner, P. P.
    Pointon, R. F.
    Creamer, L. K.
    Jameson, G. B.
    Penny, David
    RNA folding argues against a hot-start origin of life2000In: Journal of Molecular Evolution, ISSN 0022-2844, E-ISSN 1432-1432, Vol. 51, no 4, 416-421 p.Article in journal (Other academic)
    Abstract [en]

    Opinion is strongly divided on whether life arose on earth under hot or cold conditions, the hot-start and cold-start Scenarios, respectively. The origin of life close to deep thermal vents appears as the majority opinion among biologists, but there is considerable biochemical evidence that high temperatures are incompatible with an RNA world. To be functional, RNA has to fold into a three-dimensional structure. We report both theoretical and experimental results on RNA folding and show that las expected) hot conditions strongly reduce RNA folding. The theoretical results come from energy-minimization calculations of the average extent of folding of RNA, mainly from 0-90 degreesC, for both random sequences and tRNA sequences. The experimental results are from circular-dichroism measurements of tRNA over a similar range of temperatures. The quantitative agreement between calculations and experiment is remarkable, even to the shape of the curves indicating the cooperative nature of RNA folding and unfolding. These results provide additional evidence for a lower temperature stage being necessary in the origin of life.

  • 21.
    Moulton, Vincent
    et al.
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Zuker, M.
    Steel, M.
    Pointon, R.
    Penny, D.
    Metrics on RNA secondary structures2000In: Journal of Computational Biology, ISSN 1066-5277, E-ISSN 1557-8666, Vol. 7, no 1-2, 277-292 p.Article in journal (Refereed)
    Abstract [en]

    Many different programs have been developed for the prediction of the secondary structure of an RNA sequence, Some of these programs generate an ensemble of structures, all of which have free energy close to that of the optimal structure, making it important to be able to quantify how similar these different structures are. To deal with this problem, we define a new class of metrics, the mountain metrics, on the set of RNA secondary structures of a fixed length, We compare properties of these metrics with other well known metrics on RNA secondary structures. We also study some global and local properties of these metrics.

  • 22. Strimmer, K.
    et al.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Likelihood analysis of phylogenetic networks using directed graphical models2000In: Molecular biology and evolution, ISSN 0737-4038, E-ISSN 1537-1719, Vol. 17, no 6, 875-881 p.Article in journal (Refereed)
    Abstract [en]

    A method for computing the likelihood of a set of sequences assuming a phylogenetic network as an evolutionary hypothesis is presented. The approach applies directed graphical models to sequence evolution on networks and is a natural generalization of earlier work by Felsenstein on evolutionary trees, including it as a special case. The likelihood computation involves several steps. First, the phylogenetic network is rooted to form a directed acyclic graph (DAG). Then, applying standard models for nucleotide/amino acid substitution, the DAG is converted into a Bayesian network from which the joint probability distribution involving all nodes of the network can be directly read. The joint probability is explicitly dependent on branch lengths and on recombination parameters (prior probability of a parent sequence). The likelihood of the data assuming no knowledge of hidden nodes is obtained by marginalization, i.e., by summing over all combinations of unknown states. As the number of terms increases exponentially with the number of hidden nodes, a Markov chain Monte Carlo procedure (Gibbs sampling) is used to accurately approximate the likelihood by summing over the most important states only. Investigating a human T-cell lymphotropic virus (HTLV) data set and optimizing both branch lengths and recombination parameters, we find that the likelihood of a corresponding phylogenetic network outperforms a set of competing evolutionary trees. In general, except for the case of a tree, the likelihood of a network will be dependent on the choice of the root, even if a reversible model of substitution is applied. Thus, the method also provides a way in which to root a phylogenetic network by choosing a node that produces a most likely network.

  • 23.
    Strimmer, K
    et al.
    Department of Zoology, University of Oxford, Oxford, United Kingdom.
    Wiuf, C
    Department of Statistics, University of Oxford, Oxford, United Kingdom.
    Moulton, Vincent
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Engineering, Physics and Mathematics.
    Recombination analysis using directed graphical models2001In: Molecular biology and evolution, ISSN 0737-4038, E-ISSN 1537-1719, Vol. 18, no 1, 97-99 p.Article in journal (Other academic)
1 - 23 of 23
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf