M
Morgan N. Price
Researcher at Lawrence Berkeley National Laboratory
Publications - 150
Citations - 28233
Morgan N. Price is an academic researcher from Lawrence Berkeley National Laboratory. The author has contributed to research in topics: Gene & Genome. The author has an hindex of 49, co-authored 142 publications receiving 23357 citations. Previous affiliations of Morgan N. Price include FX Palo Alto Laboratory & University of Missouri.
Papers
More filters
Journal ArticleDOI
FastTree 2--approximately maximum-likelihood trees for large alignments.
TL;DR: Improvements to FastTree are described that improve its accuracy without sacrificing scalability, and FastTree 2 allows the inference of maximum-likelihood phylogenies for huge alignments.
Journal ArticleDOI
An improved Greengenes taxonomy with explicit ranks for ecological and evolutionary analyses of bacteria and archaea
Daniel McDonald,Morgan N. Price,Julia K. Goodrich,Julia K. Goodrich,Eric P. Nawrocki,Todd Z. DeSantis,Alexander J. Probst,Alexander J. Probst,Gary L. Andersen,Rob Knight,Rob Knight,Philip Hugenholtz +11 more
TL;DR: A ‘taxonomy to tree’ approach for transferring group names from an existing taxonomy to a tree topology is developed and used to apply the Greengenes, National Center for Biotechnology Information (NCBI) and cyanoDB (Cyanobacteria only) taxonomies to a de novo tree comprising 408 315 sequences.
Journal ArticleDOI
FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
TL;DR: FastTree is a method for constructing large phylogenies and for estimating their reliability, instead of storing a distance matrix, that uses sequence profiles of internal nodes in the tree to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins.
Journal Article
Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix
TL;DR: FastTree as mentioned in this paper uses sequence profiles of internal nodes in the tree to implement neighbor-joining and uses heuristics to quickly identify candidate joins, then uses nearest-neighbor interchanges to reduce the length of the tree.
Proceedings ArticleDOI
Beyond paper: supporting active reading with free form digital ink annotations
TL;DR: The XLibris “active reading machine” demonstrates that computers can help active readers organize and find information while retaining many of the advantages of reading on paper.