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

Guilherme Steinberger Elias

dblp:53/7971 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
biological database
0.112010
ProteinWorldDB: querying radical pairwise alignments among protein sets from complete genomes · Bioinform. 2010
Bioinformatics and computational biology › sequence alignment › pairwise sequence alignment
protein pairwise alignment
0.112010
ProteinWorldDB: querying radical pairwise alignments among protein sets from complete genomes · Bioinform. 2010
Bioinformatics and computational biology
sequence alignment
0.112010
ProteinWorldDB: querying radical pairwise alignments among protein sets from complete genomes · Bioinform. 2010

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

smith-waterman algorithm · 0.1dynamic programming · 0.1distributed computing · 0.1
YearPublicationVenuePosition
2010 ProteinWorldDB: querying radical pairwise alignments among protein sets from complete genomes
abstract
MOTIVATION: Many analyses in modern biological research are based on comparisons between biological sequences, resulting in functional, evolutionary and structural inferences. When large numbers of sequences are compared, heuristics are often used resulting in a certain lack of accuracy. In order to improve and validate results of such comparisons, we have performed radical all-against-all comparisons of 4 million protein sequences belonging to the RefSeq database, using an implementation of the Smith-Waterman algorithm. This extremely intensive computational approach was made possible with the help of World Community Grid, through the Genome Comparison Project. The resulting database, ProteinWorldDB, which contains coordinates of pairwise protein alignments and their respective scores, is now made available. Users can download, compare and analyze the results, filtered by genomes, protein functions or clusters. ProteinWorldDB is integrated with annotations derived from Swiss-Prot, Pfam, KEGG, NCBI Taxonomy database and gene ontology. The database is a unique and valuable asset, representing a major effort to create a reliable and consistent dataset of cross-comparisons of the whole protein content encoded in hundreds of completely sequenced genomes using a rigorous dynamic programming approach. AVAILABILITY: The database can be accessed through http://proteinworlddb.org
Thomas D. Otto, Marcos Catanho, Cristian Tristão, Márcia Bezerra, Renan Mathias Fernandes, Guilherme Steinberger Elias, Alexandre Capeletto Scaglia, Bill Bovermann, Viktors Berstis, Sérgio Lifschitz, Antonio B. de Miranda, Wim M. Degrave
Bioinform.6