1
|
Shakoor H, Jehan N, Khan S, Khattak NU. Investigation of Radon Sources, Health Hazard and Risks assessment for children using analytical and geospatial techniques in District Bannu (Pakistan). Int J Radiat Biol 2021; 98:1176-1184. [PMID: 33428859 DOI: 10.1080/09553002.2021.1872817] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
Abstract
PURPOSE Radon (Rn) is a radioactive, odorless, and colorless gas which has a half-life of 3.83 days. One of the main sources of Rn which is directly consumed by the population is Groundwater (Tube well, Bore well, Hand pump). Rn gas is found naturally in rock, soil and water and can be considered as main health risk factor in terms of lung cancer, stomach diseases, leukemia and childhood cancer. The objective of this study was to determine the concentration of Rn in the drinking water sources, appraisal of health risk for children in District Bannu, Pakistan. MATERIAL AND METHOD Total of 98 drinking water samples were analyzed by using RAD-7 detector. The experimental data was statistically analyzed by using Pearson's test. The experimental and epidemiological data of the study area are shown on map using ArcGIS version 10.5. RESULTS The analytical results show that Rn in drinking water was found varying from 10.1 Bq/l to 53.1 Bq/l with the average highest and lowest depth of 60 ft to 550 ft respectively. Pearson's test was used to show the concentration of Rn verses the depth of the water sources so +1 positive linear correlation was observed among the depth of water sources and the concentration of Rn. Out of 98 drinking water samples 40 sample were above the maximum contaminant level of 11.1 Bq/l (MCL) set by WHO, 2002. The effective doses (AED and DEing) for children ranges from 0.00001 to 3.792 mSv/y which exceeds the Permissible Exposure Limit (PEL) of Rn (0.1mSv/y) in 30 drinking water samples . On the basis of analytical results Rn high concentration areas are shown on the map using IDW model of interpolation and health risks were shown in areas where Rn content was above the maximum contaminant level. High correlations of diseases related to Rn were observed amongst the residence of the study area. Gastrointestinal diseases, brain tumor, lung cancer and kidney diseases were observed among the children of the study area. CONCLUSION From the overall analysis it was observed that high Rn concentration in drinking water may cause substantial health damage in children after long term exposure.
Collapse
Affiliation(s)
- Huma Shakoor
- Department of Environmental Sciences, University of Peshawar, Peshawar, Pakistan
| | - Noor Jehan
- Department of Environmental Sciences, University of Peshawar, Peshawar, Pakistan
| | - Sardar Khan
- Department of Environmental Sciences, University of Peshawar, Peshawar, Pakistan
| | - Nimat Ullah Khattak
- Department of Environmental Sciences, University of Peshawar, Peshawar, Pakistan
| |
Collapse
|
2
|
Collienne L, Gavryushkin A. Computing nearest neighbour interchange distances between ranked phylogenetic trees. J Math Biol 2021; 82:8. [PMID: 33492606 PMCID: PMC7835203 DOI: 10.1007/s00285-021-01567-5] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/20/2020] [Revised: 10/20/2020] [Accepted: 01/07/2021] [Indexed: 11/26/2022]
Abstract
Many popular algorithms for searching the space of leaf-labelled (phylogenetic) trees are based on tree rearrangement operations. Under any such operation, the problem is reduced to searching a graph where vertices are trees and (undirected) edges are given by pairs of trees connected by one rearrangement operation (sometimes called a move). Most popular are the classical nearest neighbour interchange, subtree prune and regraft, and tree bisection and reconnection moves. The problem of computing distances, however, is [Formula: see text]-hard in each of these graphs, making tree inference and comparison algorithms challenging to design in practice. Although anked phylogenetic trees are one of the central objects of interest in applications such as cancer research, immunology, and epidemiology, the computational complexity of the shortest path problem for these trees remained unsolved for decades. In this paper, we settle this problem for the ranked nearest neighbour interchange operation by establishing that the complexity depends on the weight difference between the two types of tree rearrangements (rank moves and edge moves), and varies from quadratic, which is the lowest possible complexity for this problem, to [Formula: see text]-hard, which is the highest. In particular, our result provides the first example of a phylogenetic tree rearrangement operation for which shortest paths, and hence the distance, can be computed efficiently. Specifically, our algorithm scales to trees with tens of thousands of leaves (and likely hundreds of thousands if implemented efficiently).
Collapse
Affiliation(s)
- Lena Collienne
- Department of Computer Science, University of Otago, Dunedin, New Zealand
| | - Alex Gavryushkin
- Department of Computer Science, University of Otago, Dunedin, New Zealand
| |
Collapse
|
3
|
Yamada K, Chen ZZ, Wang L. Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number. J Comput Biol 2020; 27:1422-1432. [PMID: 32048865 DOI: 10.1089/cmb.2019.0432] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
The problem of computing the rooted subtree prune and regraft (rSPR) distance of two phylogenetic trees is computationally hard and so is the problem of computing the hybridization number of two phylogenetic trees (denoted by Hybridization Number Computation [HNC]). Since they are important problems in phylogenetics, they have been studied extensively in the literature. Indeed, quite a number of exact or approximation algorithms have been designed and implemented for them. In this article, we design and implement several approximation algorithms for them and one exact algorithm for HNC. Our experimental results show that the resulting exact program is much faster (namely, more than 80 times faster for the easiest dataset used in the experiments) than the previous best and its superiority in speed becomes even more significant for more difficult instances. Moreover, the resulting approximation program's output has much better results than the previous bests; indeed, the outputs are always nearly optimal and often optimal. Of particular interest is the usage of the Monte Carlo tree search (MCTS) method in the design of our approximation algorithms. Our experimental results show that with MCTS, we can often solve HNC exactly within short time.
Collapse
Affiliation(s)
- Kohei Yamada
- Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan
| | - Zhi-Zhong Chen
- Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan
| | - Lusheng Wang
- Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong SAR
| |
Collapse
|
4
|
Chen ZZ, Ueta S, Li J, Wang L. Computing a Consensus Phylogeny via Leaf Removal. J Comput Biol 2020; 27:175-188. [PMID: 31638413 DOI: 10.1089/cmb.2019.0269] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
Given a set [Formula: see text]. of phylogenetic trees with the same leaf-label set X, we wish to remove some leaves from the trees so that there is a tree T with leaf-label set X displaying all the resulting trees. Note that the labels of leaves removed from one input tree may be different from those of leaves removed from another input tree. One objective is to minimize the total number of leaves removed from the trees, whereas the other is to minimize the maximum number of leaves removed from an input tree. Chauve et al. refer to the problem with the first (respectively, second) objective as AST-LR (respectively, AST-LR-d), and they show that both problems are NP-hard, where NP is the class of problems solvable in non-deterministic polynomial time. They further present algorithms for the parameterized versions of both problems. In this article, we point out that their algorithm for the parameterized version of AST-LR is flawed and present a new algorithm. Since neither Chauve et al.'s algorithm for AST-LR-d nor our new algorithm for AST-LR looks practical, we further design integer-linear programming (ILP for short) models for AST-LR and AST-LR-d, and we discuss speedup issues when using popular ILP solvers (say, GUROBI or CPLEX) to solve the models. Our experimental results show that our ILP approach is quite efficient.
Collapse
Affiliation(s)
- Zhi-Zhong Chen
- Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama, Japan
| | - Shohei Ueta
- Division of Information System Design, Tokyo Denki University, Hatoyama, Saitama, Japan
| | - Jingyu Li
- Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong SAR
| | - Lusheng Wang
- Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong SAR
| |
Collapse
|
5
|
Chen ZZ, Harada Y, Nakamura Y, Wang L. Faster Exact Computation of rSPR Distance via Better Approximation. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018; 17:916-929. [PMID: 30387740 DOI: 10.1109/tcbb.2018.2878731] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/08/2023]
Abstract
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to measure the dissimilarity of the two trees. The rooted subtree prune and regraft (rSPR) distance of the two trees has been used for this purpose. The problem of computing the rSPR distance of two given trees has many applications but is NP-hard. Accordingly, a number of programs have been developed for solving the problem either exactly or approximately. In this paper, we develop two new programs one of which solves the problem exactly and outperforms the previous best (namely, Whidden et al.'s rSPR-v1.3.0) significantly, while the other solves the problem approximately and outputs significantly better lower and upper bounds on the rSPR distance of the two given trees than the previous best due to Schalekamp et al. Our programs can be downloaded at http://rnc.r.dendai.ac.jp/rspr.html.
Collapse
|
6
|
Huson DH, Linz S. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018; 15:398-410. [PMID: 26955052 DOI: 10.1109/tcbb.2016.2537326] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/05/2023]
Abstract
A minimum hybridization network is a rooted phylogenetic network that displays two given rooted phylogenetic trees using a minimum number of reticulations. Previous mathematical work on their calculation has usually assumed the input trees to be bifurcating, correctly rooted, or that they both contain the same taxa. These assumptions do not hold in biological studies and "realistic" trees have multifurcations, are difficult to root, and rarely contain the same taxa. We present a new algorithm for computing minimum hybridization networks for a given pair of "realistic" rooted phylogenetic trees. We also describe how the algorithm might be used to improve the rooting of the input trees. We introduce the concept of "autumn trees", a nice framework for the formulation of algorithms based on the mathematics of "maximum acyclic agreement forests". While the main computational problem is hard, the run-time depends mainly on how different the given input trees are. In biological studies, where the trees are reasonably similar, our parallel implementation performs well in practice. The algorithm is available in our open source program Dendroscope 3, providing a platform for biologists to explore rooted phylogenetic networks. We demonstrate the utility of the algorithm using several previously studied data sets.
Collapse
|
7
|
Whidden C, Matsen F. Calculating the Unrooted Subtree Prune-and-Regraft Distance. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018; 16:898-911. [PMID: 29994585 DOI: 10.1109/tcbb.2018.2802911] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/08/2023]
Abstract
The subtree prune-and-regraft (SPR) distance metric is a fundamental way of comparing evolutionary trees. It has wide-ranging applications, such as to study lateral genetic transfer, viral recombination, and Markov chain Monte Carlo phylogenetic inference. Although the rooted version of SPR distance can be computed relatively efficiently between rooted trees using fixed-parameter-tractable maximum agreement forest (MAF) algorithms, no MAF formulation is known for the unrooted case. Correspondingly, previous algorithms are unable to compute unrooted SPR distances larger than 7.
Collapse
|
8
|
Huang W, Zhou G, Marchand M, Ash JR, Morris D, Van Dooren P, Brown JM, Gallivan KA, Wilgenbusch JC. TreeScaper: Visualizing and Extracting Phylogenetic Signal from Sets of Trees. Mol Biol Evol 2016; 33:3314-3316. [PMID: 27634869 DOI: 10.1093/molbev/msw196] [Citation(s) in RCA: 15] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
Modern phylogenomic analyses often result in large collections of phylogenetic trees representing uncertainty in individual gene trees, variation across genes, or both. Extracting phylogenetic signal from these tree sets can be challenging, as they are difficult to visualize, explore, and quantify. To overcome some of these challenges, we have developed TreeScaper, an application for tree set visualization as well as the identification of distinct phylogenetic signals. GUI and command-line versions of TreeScaper and a manual with tutorials can be downloaded from https://github.com/whuang08/TreeScaper/releases TreeScaper is distributed under the GNU General Public License.
Collapse
Affiliation(s)
- Wen Huang
- Department of Computational and Applied Mathematics, Rice University, St. Housten, TX
| | - Guifang Zhou
- Department of Biological Sciences and Museum of Natural Science, Louisiana State University, Baton Rouge, LA
| | - Melissa Marchand
- Department of Mathematics, Florida State University, Tallahassee, FL
| | - Jeremy R Ash
- Bioinformatics Research Center, North Carolina State University, Raleigh, NC
| | - David Morris
- Department of Biological Sciences and Museum of Natural Science, Louisiana State University, Baton Rouge, LA
| | - Paul Van Dooren
- Department of Mathematical Engineering, ICTEAM, Université catholique de Louvain, Belgium, Germany
| | - Jeremy M Brown
- Department of Biological Sciences and Museum of Natural Science, Louisiana State University, Baton Rouge, LA
| | - Kyle A Gallivan
- Department of Mathematics, Florida State University, Tallahassee, FL
| | - Jim C Wilgenbusch
- Minnesota Supercomputing Institute, University of Minnesota, Minneapolis, MN
| |
Collapse
|
9
|
Lanfear R, Hua X, Warren DL. Estimating the Effective Sample Size of Tree Topologies from Bayesian Phylogenetic Analyses. Genome Biol Evol 2016; 8:2319-32. [PMID: 27435794 PMCID: PMC5010905 DOI: 10.1093/gbe/evw171] [Citation(s) in RCA: 44] [Impact Index Per Article: 5.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
Bayesian phylogenetic analyses estimate posterior distributions of phylogenetic tree topologies and other parameters using Markov chain Monte Carlo (MCMC) methods. Before making inferences from these distributions, it is important to assess their adequacy. To this end, the effective sample size (ESS) estimates how many truly independent samples of a given parameter the output of the MCMC represents. The ESS of a parameter is frequently much lower than the number of samples taken from the MCMC because sequential samples from the chain can be non-independent due to autocorrelation. Typically, phylogeneticists use a rule of thumb that the ESS of all parameters should be greater than 200. However, we have no method to calculate an ESS of tree topology samples, despite the fact that the tree topology is often the parameter of primary interest and is almost always central to the estimation of other parameters. That is, we lack a method to determine whether we have adequately sampled one of the most important parameters in our analyses. In this study, we address this problem by developing methods to estimate the ESS for tree topologies. We combine these methods with two new diagnostic plots for assessing posterior samples of tree topologies, and compare their performance on simulated and empirical data sets. Combined, the methods we present provide new ways to assess the mixing and convergence of phylogenetic tree topologies in Bayesian MCMC analyses.
Collapse
Affiliation(s)
- Robert Lanfear
- Department of Biological Sciences, Macquarie University, Sydney, Australia Ecology, Evolution, and Genetics, Australian National University, Canberra, Australia
| | - Xia Hua
- Ecology, Evolution, and Genetics, Australian National University, Canberra, Australia
| | - Dan L Warren
- Department of Biological Sciences, Macquarie University, Sydney, Australia Ecology, Evolution, and Genetics, Australian National University, Canberra, Australia
| |
Collapse
|
10
|
|
11
|
Goloboff PA, Szumik CA. Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees. Cladistics 2016; 32:82-89. [PMID: 34732022 DOI: 10.1111/cla.12111] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Accepted: 12/12/2014] [Indexed: 11/26/2022] Open
Abstract
This paper examines a recent proposal to calculate supertrees by minimizing the sum of subtree prune-and-regraft distances to the input trees. The supertrees thus calculated may display groups present in a minority of the input trees but contradicted by the majority, or groups that are not supported by any input tree or combination of input trees. The proponents of the method themselves stated that these are serious problems of "matrix representation with parsimony", but they can in fact occur in their own method. The majority rule supertrees, being explicitly clade-based, cannot have these problems, and seem much more suited to retrieving common clades from a set of trees with different taxon sets. However, it is dubious that so-called majority rule supertrees can always be interpreted as displaying those clades present (or compatible with) with a majority of the trees. The majority rule consensus is always a median tree, in terms of the Robinson-Foulds distances (i.e. it minimizes the sum of Robinson-Foulds distances to the input trees). In contrast, majority rule supertrees may not be median-different, contradictory trees may minimize Robinson-Foulds distances, while their strict consensus does not. If being "majority" results from being median in Robinson-Foulds distances, this means that in the supertree setting a "majority" is ambiguously defined, sometimes achievable only by mutually contradictory trees.
Collapse
Affiliation(s)
- Pablo A Goloboff
- Unidad Ejecutora Lillo, Consejo Nacional de Investigaciones Científicas y Técnicas, Miguel Lillo 251, 4000, S.M. de Tucumán, Argentina
| | - Claudia A Szumik
- Unidad Ejecutora Lillo, Consejo Nacional de Investigaciones Científicas y Técnicas, Miguel Lillo 251, 4000, S.M. de Tucumán, Argentina
| |
Collapse
|
12
|
Whidden C, Matsen FA. Quantifying MCMC exploration of phylogenetic tree space. Syst Biol 2015; 64:472-91. [PMID: 25631175 PMCID: PMC4395846 DOI: 10.1093/sysbio/syv006] [Citation(s) in RCA: 42] [Impact Index Per Article: 4.7] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/09/2014] [Accepted: 01/20/2015] [Indexed: 11/30/2022] Open
Abstract
In order to gain an understanding of the effectiveness of phylogenetic Markov chain Monte Carlo (MCMC), it is important to understand how quickly the empirical distribution of the MCMC converges to the posterior distribution. In this article, we investigate this problem on phylogenetic tree topologies with a metric that is especially well suited to the task: the subtree prune-and-regraft (SPR) metric. This metric directly corresponds to the minimum number of MCMC rearrangements required to move between trees in common phylogenetic MCMC implementations. We develop a novel graph-based approach to analyze tree posteriors and find that the SPR metric is much more informative than simpler metrics that are unrelated to MCMC moves. In doing so, we show conclusively that topological peaks do occur in Bayesian phylogenetic posteriors from real data sets as sampled with standard MCMC approaches, investigate the efficiency of Metropolis-coupled MCMC (MCMCMC) in traversing the valleys between peaks, and show that conditional clade distribution (CCD) can have systematic problems when there are multiple peaks.
Collapse
Affiliation(s)
- Chris Whidden
- Program in Computational Biology, Fred Hutchinson Cancer Research Center, Seattle, WA 98109, USA
| | - Frederick A Matsen
- Program in Computational Biology, Fred Hutchinson Cancer Research Center, Seattle, WA 98109, USA
| |
Collapse
|
13
|
Iersel LV, Kelk S, Lekić N, Scornavacca C. A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. BMC Bioinformatics 2014; 15:127. [PMID: 24884964 PMCID: PMC4023542 DOI: 10.1186/1471-2105-15-127] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/02/2013] [Accepted: 04/24/2014] [Indexed: 12/01/2022] Open
Abstract
BACKGROUND Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve instances with reticulation number larger than 40-50. RESULTS Here we present CycleKiller and NonbinaryCycleKiller, the first methods to produce solutions verifiably close to optimality for instances with hundreds or even thousands of reticulations. CONCLUSIONS Using simulations, we demonstrate that these algorithms run quickly for large and difficult instances, producing solutions that are very close to optimality. As a spin-off from our simulations we also present TerminusEst, which is the fastest exact method currently available that can handle nonbinary trees: this is used to measure the accuracy of the NonbinaryCycleKiller algorithm. All three methods are based on extensions of previous theoretical work (SIDMA 26(4):1635-1656, TCBB 10(1):18-25, SIDMA 28(1):49-66) and are publicly available. We also apply our methods to real data.
Collapse
Affiliation(s)
- Leo van Iersel
- Centrum Wiskunde & Informatica (CWI), P.O. Box 94079, 1090 GB, Amsterdam, The Netherlands
| | - Steven Kelk
- Department of Knowledge Engineering (DKE), Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands
| | - Nela Lekić
- Department of Knowledge Engineering (DKE), Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands
| | - Celine Scornavacca
- ISEM, CNRS – Université Montpellier II, Place Eugène Bataillon, 34095 Montpellier, France
| |
Collapse
|
14
|
Scornavacca C, Linz S, Albrecht B. A first step toward computing all hybridization networks for two rooted binary phylogenetic trees. J Comput Biol 2012; 19:1227-42. [PMID: 23134319 DOI: 10.1089/cmb.2012.0192] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard app1235roach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to not only compute one network, but all possible networks. In this article, we make a first step toward approaching this goal by presenting the first algorithm--called ALLMAAFs--that calculates all maximum-acyclic-agreement forests for two rooted binary phylogenetic trees on the same set of taxa.
Collapse
Affiliation(s)
- Celine Scornavacca
- Institut des Sciences de l'Evolution Université Montpellier II, Montpellier, France
| | | | | |
Collapse
|
15
|
Park HJ, Nakhleh L. MURPAR: A Fast Heuristic for Inferring Parsimonious Phylogenetic Networks from Multiple Gene Trees. ACTA ACUST UNITED AC 2012. [DOI: 10.1007/978-3-642-30191-9_20] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/22/2023]
|
16
|
Chen ZZ, Wang L. Algorithms for reticulate networks of multiple phylogenetic trees. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2011; 9:372-384. [PMID: 22025766 DOI: 10.1109/tcbb.2011.137] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/31/2023]
Abstract
A reticulate network N of multiple phylogenetic trees may have vertices with two or more parents (called reticulation vertices). There are two ways to define the reticulation number of N. One is to define it as the number of reticulation vertices in N; in this case, a reticulate network with the smallest reticulation number is called an optimal type-I reticulate network of the trees. The other is to define it as the total number of parents of reticulation vertices in N minus the number of reticulation vertices in N; in this case, a reticulate network with the smallest reticulation number is called an optimal type-II reticulate network of the trees. In this paper, we present a fast algorithm for constructing one or all optimal type-I reticulate networks of multiple phylogenetic trees. We then use the algorithm together with other ideas to obtain an algorithm for estimating a lower bound on the reticulation number of an optimal type-II reticulate network of the input trees. To our knowledge, these are the first fast algorithms for the problems. Our experimental data shows that our algorithms can construct optimal type-I reticulate networks rapidly and can compute better lower bounds for optimal type-II reticulate networks within much shorter time than the previously best program.
Collapse
|
17
|
Whidden C, Beiko RG, Zeh N. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. EXPERIMENTAL ALGORITHMS 2010. [DOI: 10.1007/978-3-642-13193-6_13] [Citation(s) in RCA: 24] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/14/2022]
|