Matches in SemOpenAlex for { <https://semopenalex.org/work/W2520996918> ?p ?o ?g. }
Showing items 1 to 72 of
72
with 100 items per page.
- W2520996918 abstract "Evolutionary relationships between a group of organisms are commonly summarized in a phylogenetic (or evolutionary) tree. The goal of phylogenetic inference is to infer the best tree structure that represents the relationships between a group of organisms, given a set of observations (e.g. molecular sequences). However, popular heuristics for inferring phylogenies output tens to hundreds of thousands of equally weighted candidate trees. Biologists summarize these trees into a single structure called the consensus tree. The central assumption is that the information discarded has less value than the information retained. But, what if this assumption is not true?In this dissertation, we demonstrate the value of retaining and studying tree collections. We also conduct an extensive literature search that highlights the rapid growth of trees produced by phylogenetic analysis. Thus, high performance algorithms are needed to accommodate this increasing production of data. We created several efficient algorithms that allow biologists to easily compare, store and share tree collections over tens to hundreds of thousands of phylogenetic trees. Universal hashing is central to all these approaches, allowing us to quickly identify the shared evolutionary relationships contained in tree collections. Our algorithms MrsRF and Phlash are the fastest in the field for comparing large collections of trees. Our algorithm TreeZip is the most efficient way to store large tree collections. Lastly, we developed Noria, a novel version control system that allows biologists to seamlessly manage and share their phylogenetic analyses.Our work has far-reaching implications for both the biological and computer science communities. We tested our algorithms on four large biological datasets, each consisting of 20; 000 to 150; 000 trees over 150 to 525 taxa. Our experimental results on these datasets indicate the long-term applicability of our algorithms to modern phylogenetic analysis, and underscore their ability to help scientists easily exchange and analyze their large tree collections. In addition to contributing to the reproducibility of phylogenetic analysis, our work enables the creation of test beds for improving phylogenetic heuristics and applications. Lastly, our data structures and algorithms can be applied to managing other tree-like data (e.g XML)." @default.
- W2520996918 created "2016-09-23" @default.
- W2520996918 creator A5047545181 @default.
- W2520996918 creator A5083319931 @default.
- W2520996918 date "2012-01-01" @default.
- W2520996918 modified "2023-09-23" @default.
- W2520996918 title "Efficient algorithms for comparing, storing, and sharing large collections of evolutionary trees" @default.
- W2520996918 hasPublicationYear "2012" @default.
- W2520996918 type Work @default.
- W2520996918 sameAs 2520996918 @default.
- W2520996918 citedByCount "2" @default.
- W2520996918 countsByYear W25209969182015 @default.
- W2520996918 crossrefType "journal-article" @default.
- W2520996918 hasAuthorship W2520996918A5047545181 @default.
- W2520996918 hasAuthorship W2520996918A5083319931 @default.
- W2520996918 hasConcept C104317684 @default.
- W2520996918 hasConcept C111919701 @default.
- W2520996918 hasConcept C113174947 @default.
- W2520996918 hasConcept C114614502 @default.
- W2520996918 hasConcept C124101348 @default.
- W2520996918 hasConcept C127705205 @default.
- W2520996918 hasConcept C177264268 @default.
- W2520996918 hasConcept C193252679 @default.
- W2520996918 hasConcept C199360897 @default.
- W2520996918 hasConcept C33923547 @default.
- W2520996918 hasConcept C41008148 @default.
- W2520996918 hasConcept C53208351 @default.
- W2520996918 hasConcept C55493867 @default.
- W2520996918 hasConcept C80444323 @default.
- W2520996918 hasConcept C86803240 @default.
- W2520996918 hasConceptScore W2520996918C104317684 @default.
- W2520996918 hasConceptScore W2520996918C111919701 @default.
- W2520996918 hasConceptScore W2520996918C113174947 @default.
- W2520996918 hasConceptScore W2520996918C114614502 @default.
- W2520996918 hasConceptScore W2520996918C124101348 @default.
- W2520996918 hasConceptScore W2520996918C127705205 @default.
- W2520996918 hasConceptScore W2520996918C177264268 @default.
- W2520996918 hasConceptScore W2520996918C193252679 @default.
- W2520996918 hasConceptScore W2520996918C199360897 @default.
- W2520996918 hasConceptScore W2520996918C33923547 @default.
- W2520996918 hasConceptScore W2520996918C41008148 @default.
- W2520996918 hasConceptScore W2520996918C53208351 @default.
- W2520996918 hasConceptScore W2520996918C55493867 @default.
- W2520996918 hasConceptScore W2520996918C80444323 @default.
- W2520996918 hasConceptScore W2520996918C86803240 @default.
- W2520996918 hasLocation W25209969181 @default.
- W2520996918 hasOpenAccess W2520996918 @default.
- W2520996918 hasPrimaryLocation W25209969181 @default.
- W2520996918 hasRelatedWork W112302469 @default.
- W2520996918 hasRelatedWork W1497124707 @default.
- W2520996918 hasRelatedWork W1516842100 @default.
- W2520996918 hasRelatedWork W1541429054 @default.
- W2520996918 hasRelatedWork W1973342763 @default.
- W2520996918 hasRelatedWork W2027217060 @default.
- W2520996918 hasRelatedWork W2050224901 @default.
- W2520996918 hasRelatedWork W2084204070 @default.
- W2520996918 hasRelatedWork W2108939563 @default.
- W2520996918 hasRelatedWork W2132010001 @default.
- W2520996918 hasRelatedWork W2135573978 @default.
- W2520996918 hasRelatedWork W2156166254 @default.
- W2520996918 hasRelatedWork W2220230673 @default.
- W2520996918 hasRelatedWork W2570931575 @default.
- W2520996918 hasRelatedWork W2913767699 @default.
- W2520996918 hasRelatedWork W2977721844 @default.
- W2520996918 hasRelatedWork W429196323 @default.
- W2520996918 hasRelatedWork W2604025716 @default.
- W2520996918 hasRelatedWork W3103814403 @default.
- W2520996918 hasRelatedWork W3150744007 @default.
- W2520996918 isParatext "false" @default.
- W2520996918 isRetracted "false" @default.
- W2520996918 magId "2520996918" @default.
- W2520996918 workType "article" @default.