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

Bora Uyar

dblp:54/9916 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
0000-0002-3170-4890ORCID · reported

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 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genome annotation
gene prediction
0.112011
genBlastG: using BLAST searches to build homologous gene models · Bioinform. 2011
Bioinformatics and computational biology › genome annotation › gene prediction
homology-based gene prediction
0.112011
genBlastG: using BLAST searches to build homologous gene models · Bioinform. 2011
Bioinformatics and computational biology › sequence alignment › heuristic alignment
BLAST
0.012011
genBlastG: using BLAST searches to build homologous gene models · Bioinform. 2011
Bioinformatics and computational biology
sequence alignment
0.012011
genBlastG: using BLAST searches to build homologous gene models · Bioinform. 2011
YearPublicationVenuePosition
2011 genBlastG: using BLAST searches to build homologous gene models
abstract
MOTIVATION: BLAST users frequently expect to obtain homologous genes with certain similarity to their query genes. But what they get from BLAST searches are often collections of local alignments called high-scoring segment pairs (HSPs). On the other hand, most homology-based gene finders have been built using computation-intensive algorithms, without taking full advantage of BLAST searches that have been perfected over the last decades. RESULTS: Here we report an efficient algorithm, genBlastG that directly uses the HSPs reported by BLAST to define high-quality gene models. AVAILABILITY: http://genome.sfu.ca/genblast/download.html
Rong She, Jeffrey Shih-Chieh Chu, Bora Uyar, Ke Wang 0001, Nansheng Chen
Bioinform.3