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

Doug Hyatt

dblp:43/8247 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author

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
3 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genome annotation
gene prediction
0.112012
Gene and translation initiation site prediction in metagenomic sequences · Bioinform. 2012
Bioinformatics and computational biology
knowledge base
0.112012
BESC knowledgebase public portal · Bioinform. 2012
Bioinformatics and computational biology
metagenomics
0.112012
Gene and translation initiation site prediction in metagenomic sequences · Bioinform. 2012
Bioinformatics and computational biology
proteomics
0.112012
Exhaustive database searching for amino acid mutations in proteomes · Bioinform. 2012
Bioinformatics and computational biology › proteomics
tandem mass spectrometry
0.112012
Exhaustive database searching for amino acid mutations in proteomes · Bioinform. 2012
Bioinformatics and computational biology › genome annotation
translation initiation site prediction
0.112012
Gene and translation initiation site prediction in metagenomic sequences · Bioinform. 2012
Bioinformatics and computational biology
sequence analysis
0.012012
Gene and translation initiation site prediction in metagenomic sequences · Bioinform. 2012

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

sequence tagging · 0.1gene prediction algorithm · 0.1exhaustive database search · 0.1data integration · 0.1
YearPublicationVenuePosition
2012 Gene and translation initiation site prediction in metagenomic sequences
abstract
MOTIVATION: Gene prediction in metagenomic sequences remains a difficult problem. Current sequencing technologies do not achieve sufficient coverage to assemble the individual genomes in a typical sample; consequently, sequencing runs produce a large number of short sequences whose exact origin is unknown. Since these sequences are usually smaller than the average length of a gene, algorithms must make predictions based on very little data. RESULTS: We present MetaProdigal, a metagenomic version of the gene prediction program Prodigal, that can identify genes in short, anonymous coding sequences with a high degree of accuracy. The novel value of the method consists of enhanced translation initiation site identification, ability to identify sequences that use alternate genetic codes and confidence values for each gene call. We compare the results of MetaProdigal with other methods and conclude with a discussion of future improvements. AVAILABILITY: The Prodigal software is freely available under the General Public License from http://code.google.com/p/prodigal/.
Doug Hyatt, Philip F. LoCascio, Loren J. Hauser, Edward C. Uberbacher
Bioinform.1
2012 Exhaustive database searching for amino acid mutations in proteomes
abstract
MOTIVATION: Amino acid mutations in proteins can be found by searching tandem mass spectra acquired in shotgun proteomics experiments against protein sequences predicted from genomes. Traditionally, unconstrained searches for amino acid mutations have been accomplished by using a sequence tagging approach that combines de novo sequencing with database searching. However, this approach is limited by the performance of de novo sequencing. RESULTS: The Sipros algorithm v2.0 was developed to perform unconstrained database searching using high-resolution tandem mass spectra by exhaustively enumerating all single non-isobaric mutations for every residue in a protein database. The performance of Sipros for amino acid mutation identification exceeded that of an established sequence tagging algorithm, Inspect, based on benchmarking results from a Rhodopseudomonas palustris proteomics dataset. To demonstrate the viability of the algorithm for meta-proteomics, Sipros was used to identify amino acid mutations in a natural microbial community in acid mine drainage. AVAILABILITY: The Sipros algorithm is freely available at\newline http://code.google.com/p/sipros.
Doug Hyatt, Chongle Pan
Bioinform.1
2012 BESC knowledgebase public portal
abstract
UNLABELLED: The BioEnergy Science Center (BESC) is undertaking large experimental campaigns to understand the biosynthesis and biodegradation of biomass and to develop biofuel solutions. BESC is generating large volumes of diverse data, including genome sequences, omics data and assay results. The purpose of the BESC Knowledgebase is to serve as a centralized repository for experimentally generated data and to provide an integrated, interactive and user-friendly analysis framework. The Portal makes available tools for visualization, integration and analysis of data either produced by BESC or obtained from external resources. AVAILABILITY: http://besckb.ornl.gov.
Mustafa H. Syed, Tatiana V. Karpinets, Morey Parang, Michael R. Leuze, Doug Hyatt, Steven D. Brown, Steve Moulton, Michael D. Galloway, Edward C. Uberbacher
Bioinform.6
2010 Prodigal: prokaryotic gene recognition and translation initiation site identification
abstract
BACKGROUND: The quality of automated gene prediction in microbial organisms has improved steadily over the past decade, but there is still room for improvement. Increasing the number of correct identifications, both of genes and of the translation initiation sites for each gene, and reducing the overall number of false positives, are all desirable goals. RESULTS: With our years of experience in manually curating genomes for the Joint Genome Institute, we developed a new gene prediction algorithm called Prodigal (PROkaryotic DYnamic programming Gene-finding ALgorithm). With Prodigal, we focused specifically on the three goals of improved gene structure prediction, improved translation initiation site recognition, and reduced false positives. We compared the results of Prodigal to existing gene-finding methods to demonstrate that it met each of these objectives. CONCLUSION: We built a fast, lightweight, open source gene prediction program called Prodigal http://compbio.ornl.gov/prodigal/. Prodigal achieved good results compared to existing methods, and we believe it will be a valuable asset to automated microbial annotation pipelines.
Doug Hyatt, Gwo-Liang Chen, Philip F. LoCascio, Miriam L. Land, Frank W. Larimer, Loren J. Hauser
BMC Bioinform.1