Algorithms for Quartet Based Phylogeny Reconstruction
Title | Algorithms for Quartet Based Phylogeny Reconstruction PDF eBook |
Author | Gang Wu |
Publisher | |
Pages | 79 |
Release | 2009 |
Genre | Computer algorithms |
ISBN |
Fast Algorithms for Large-scale Phylogenetic Reconstruction
Title | Fast Algorithms for Large-scale Phylogenetic Reconstruction PDF eBook |
Author | Jakub Truszkowski |
Publisher | |
Pages | 135 |
Release | 2013 |
Genre | |
ISBN |
One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories, known as phylogenies are usually represented as binary trees where leaves represent extant species, whereas internal nodes represent their shared ancestors. As the amount of sequence data available to biologists increases, very fast phylogenetic reconstruction algorithms are becoming necessary. Currently, large sequence alignments can contain up to hundreds of thousands of sequences, making traditional methods, such as Neighbor Joining, computationally prohibitive. To address this problem, we have developed three novel fast phylogenetic algorithms. The first algorithm, QTree, is a quartet-based heuristic that runs in O(n log n) time. It is based on a theoretical algorithm that reconstructs the correct tree, with high probability, assuming every quartet is inferred correctly with constant probability. The core of our algorithm is a balanced search tree structure that enables us to locate an edge in the tree in O(log n) time. Our algorithm is several times faster than all the current methods, while its accuracy approaches that of Neighbour Joining. The second algorithm, LSHTree, is the first sub-quadratic time algorithm with theoretical performance guarantees under a Markov model of sequence evolution. Our new algorithm runs in O(n^{1+[gamma](g)} log^2 n) time, where [gamma] is an increasing function of an upper bound on the mutation rate along any branch in the phylogeny, and [gamma](g)
Algorithms in Bioinformatics
Title | Algorithms in Bioinformatics PDF eBook |
Author | Vincent Moulton |
Publisher | Springer Science & Business Media |
Pages | 385 |
Release | 2010-08-25 |
Genre | Computers |
ISBN | 3642152937 |
This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms in Bioinformatics, WABI 2010, held in Liverpool, UK, in September 2010. The 30 revised full papers presented were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on biomolecular structure: RNA, protein and molecular comparison; comparative genomics; haplotype and genotype analysis; high-throughput data analysis: next generation sequencing and flow cytometry; networks; phylogenetics; and sequences, strings and motifs.
Alignment-free Phylogeny Reconstruction Based On Quartet Trees
Title | Alignment-free Phylogeny Reconstruction Based On Quartet Trees PDF eBook |
Author | Thomas Dencker |
Publisher | |
Pages | |
Release | 2020 |
Genre | Phylogeny |
ISBN |
Algorithms in Bioinformatics
Title | Algorithms in Bioinformatics PDF eBook |
Author | Teresa M. Przytycka |
Publisher | Springer |
Pages | 388 |
Release | 2011-08-31 |
Genre | Computers |
ISBN | 3642230385 |
This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms in Bioinformatics, WABI 2011, held in Saarbrücken, Germany, in September 2011. The 30 papers presented were carefully reviewed and selected from 77 submissions. They cover aspects of algorithms in bioinformatics, computational biology and systems biology.
Quartet-joining Algorithms for Reconstructing Phylogenetic Trees
Title | Quartet-joining Algorithms for Reconstructing Phylogenetic Trees PDF eBook |
Author | Lei Xin |
Publisher | |
Pages | 250 |
Release | 2005 |
Genre | |
ISBN |
Phylogenetic Supertrees
Title | Phylogenetic Supertrees PDF eBook |
Author | Olaf R.P. Bininda-Emonds |
Publisher | Springer Science & Business Media |
Pages | 547 |
Release | 2004-05-31 |
Genre | Science |
ISBN | 1402023308 |
This is the first book on "phylogenetic supertrees", a recent, but controversial development for inferring evolutionary trees. Rather than analyze the combined primary character data directly, supertree construction proceeds by combining the tree topologies derived from those data. This difference in strategy has allowed for the exciting possibility of larger, more complete phylogenies than are otherwise currently possible, with the potential to revolutionize evolutionarily-based research. This book provides a comprehensive look at supertrees, ranging from the methods used to build supertrees to the significance of supertrees to bioinformatic and biological research. Reviews of many the major supertree methods are provided and four new techniques, including a Bayesian implementation of supertrees, are described for the first time. The far-reaching impact of supertrees on biological research is highlighted both in general terms and through specific examples from diverse clades such as flowering plants, even-toed ungulates, and primates. The book also critically examines the many outstanding challenges and problem areas for this relatively new field, showing the way for supertree construction in the age of genomics. Interdisciplinary contributions from the majority of the leading authorities on supertree construction in all areas of the bioinformatic community (biology, computer sciences, and mathematics) will ensure that this book is a valuable reference with wide appeal to anyone interested in phylogenetic inference.