Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gary L. Andersen

dblp:48/2193 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2010
0000-0002-1618-9827ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
sequence alignment
0.112010
PyNAST: a flexible tool for aligning sequences to a template alignment · Bioinform. 2010
Bioinformatics and computational biology
multiple sequence alignment
0.012003
Comprehensive aligned sequence construction for automated design of effective probes (CASCADE-P) using 16S rDNA · Bioinform. 2003
Bioinformatics and computational biology
probe design
0.012003
Comprehensive aligned sequence construction for automated design of effective probes (CASCADE-P) using 16S rDNA · Bioinform. 2003
Bioinformatics and computational biology › microbiology
microbial ecology
0.012010
PyNAST: a flexible tool for aligning sequences to a template alignment · Bioinform. 2010
Bioinformatics and computational biology › metagenomics
operational taxonomic unit clustering
0.012003
Comprehensive aligned sequence construction for automated design of effective probes (CASCADE-P) using 16S rDNA · Bioinform. 2003
Bioinformatics and computational biology
phylogenetics
0.012003
Comprehensive aligned sequence construction for automated design of effective probes (CASCADE-P) using 16S rDNA · Bioinform. 2003

Methods — techniques the papers use, named apart from their topics

NAST algorithm · 0.1similarity clustering · 0.0
YearPublicationVenuePosition
2010 PyNAST: a flexible tool for aligning sequences to a template alignment
abstract
MOTIVATION: The Nearest Alignment Space Termination (NAST) tool is commonly used in sequence-based microbial ecology community analysis, but due to the limited portability of the original implementation, it has not been as widely adopted as possible. Python Nearest Alignment Space Termination (PyNAST) is a complete reimplementation of NAST, which includes three convenient interfaces: a Mac OS X GUI, a command-line interface and a simple application programming interface (API). RESULTS: The availability of PyNAST will make the popular NAST algorithm more portable and thereby applicable to datasets orders of magnitude larger by allowing users to install PyNAST on their own hardware. Additionally because users can align to arbitrary template alignments, a feature not available via the original NAST web interface, the NAST algorithm will be readily applicable to novel tasks outside of microbial community analysis. AVAILABILITY: PyNAST is available at http://pynast.sourceforge.net.
J. Gregory Caporaso, Kyle Bittinger, Frederic D. Bushman, Todd Z. DeSantis, Gary L. Andersen, Rob Knight 0001
Bioinform.5
2007 Automated group assignment in large phylogenetic trees using GRUNT: GRouping, Ungrouping, Naming Tool
abstract
BACKGROUND: Accurate taxonomy is best maintained if species are arranged as hierarchical groups in phylogenetic trees. This is especially important as trees grow larger as a consequence of a rapidly expanding sequence database. Hierarchical group names are typically manually assigned in trees, an approach that becomes unfeasible for very large topologies. RESULTS: We have developed an automated iterative procedure for delineating stable (monophyletic) hierarchical groups to large (or small) trees and naming those groups according to a set of sequentially applied rules. In addition, we have created an associated ungrouping tool for removing existing groups that do not meet user-defined criteria (such as monophyly). The procedure is implemented in a program called GRUNT (GRouping, Ungrouping, Naming Tool) and has been applied to the current release of the Greengenes (Hugenholtz) 16S rRNA gene taxonomy comprising more than 130,000 taxa. CONCLUSION: GRUNT will facilitate researchers requiring comprehensive hierarchical grouping of large tree topologies in, for example, database curation, microarray design and pangenome assignments. The application is available at the greengenes website 1.
Daniel Dalevi, Todd Z. DeSantis, Jakob Fredslund, Gary L. Andersen, Victor M. Markowitz, Philip Hugenholtz
BMC Bioinform.4
2003 Comprehensive aligned sequence construction for automated design of effective probes (CASCADE-P) using 16S rDNA
abstract
Abstract Motivation: Prokaryotic organisms have been identified utilizing the sequence variation of the 16S rRNA gene. Variations steer the design of DNA probes for the detection of taxonomic groups or specific organisms. The long-term goal of our project is to create probe arrays capable of identifying 16S rDNA sequences in unknown samples. This necessitated the authentication, categorization and alignment of the >75 000 publicly available‘ 16S’ sequences. Preferably, the entire process should be computationally administrated so the aligned collection could periodically absorb 16S rDNA sequences from the public records. A complete multiple sequence alignment would provide a foundation for computational probe selection and facilitates microbial taxonomy and phylogeny. Results: Here we report the alignment and similarity clustering of 62 662 16S rDNA sequences and an approach for designing effective probes for each cluster. A novel alignment compression algorithm, NAST (Nearest Alignment Space Termination), was designed to produce the uniform multiple sequence alignment referred to as the prokMSA. From the prokMSA, 9020 Operational Taxonomic Units (OTUs) were found based on transitive sequence similarities. An automated approach to probe design was straightforward using the prokMSA clustered into OTUs. As a test case, multiple probes were computationally picked for each of the 27 OTUs that were identified within the Staphylococcus Group. The probes were incorporated into a customized microarray and were able to correctly categorize Staphylococcus aureus and Bacillus anthracis into their correct OTUs. Although a successful probe picking strategy is outlined, the main focus of creating the prokMSA was to provide a comprehensive, categorized, updateable 16S rDNA collection useful as a foundation for any probe selection algorithm. Availability: http://greengenes.llnl.gov/16S/ Contact: [email protected] Supplementary Information: Complete prokMSA in aligned fasta format: http://greengenes.llnl.gov/16S_cgi/download/update_28Dec02/prokMSA_aligned.fasta.Z Sequences within each Operational Taxonomic Unit: http://greengenes.llnl.gov/16S_cgi/download/update_15Mar02/SeqDescByOTU.txt DNA probe sequences: http://greengenes.llnl.gov/16S_cgi/download/update_15Mar02/15Mar02_StaphGrpPrbs.xls * To whom correspondence should be addressed.
T. Z. DeSantis Jr., I. Dubosarskiy, S. R. Murray, Gary L. Andersen
Bioinform.4