Browsing by Subject "Phylogeny--Data processing"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Algorithmic techniques for improving the speed and accuracy of phylogenetic methods(2004) Roshan, Usman Waheed; Warnow, TandyItem Genetic algorithm approaches for the phylogenetic analysis of large biological sequence datasets under the maximum likelihood criterion(2006) Zwickl, Derrick Joel; Hillis, David M.Item Large-scale phylogenetic analysis(2003) Wang, Li-san; Warnow, TandyThe phylogeny problem is to reconstruct the phylogenetic tree in which the leaves are labeled by the taxa we are interested in, and the internal nodes are ancestral taxa. Recent advances in molecular biology and genomics have provided biologists with molecular data at an unprecedented rate and scale; in particular whole genome data for more and more species. First, the number of possible phylogenetic trees grows superexponentially with the increase of the number of species being studied. Second, detailed sequence data for each species usually convey conflict. Third, more species usually means more evolutionary events along the evolutionary tree. This usually leads to highly saturated data, which are difficult to analyze in general. In this thesis I present two possible approaches to solve this difficulty. The first approach is to use genome rearrangement evolution, an evolutionary process that has lower evolutionary rate than DNA sequence evolution. The second approach is to process multiple trees returned by tree reconstruction algorithms by applying clustering methods.