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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Takaho A. Endo

dblp:73/5206 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · unresolved

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 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
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 › sequence analysis › sequence assembly
fragment assembly		 0.012004
Probabilistic nucleotide assembling method for sequencing by hybridization · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis
sequence assembly		 0.012004
Probabilistic nucleotide assembling method for sequencing by hybridization · Bioinform. 2004
Bioinformatics and computational biology › genomics › DNA sequencing
sequencing by hybridization		 0.012004
Probabilistic nucleotide assembling method for sequencing by hybridization · Bioinform. 2004

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

traveling salesman problem · 0.0genetic algorithm · 0.0error correction · 0.0
YearPublicationVenuePosition
2004 Probabilistic nucleotide assembling method for sequencing by hybridization
abstract
MOTIVATION: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process. RESULTS: The present method outperforms those described in previous studies, in terms of both time and accuracy. AVAILABILITY: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html
Takaho A. Endo
 Bioinform.1