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

Huaichun Wang

dblp:65/2618 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 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
2 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
maximum likelihood estimation
0.011998
New phylogenetic venues opened by a novel implementation of the DNAml algorithm · Bioinform. 1998
Bioinformatics and computational biology
phylogenetics
0.011998
New phylogenetic venues opened by a novel implementation of the DNAml algorithm · Bioinform. 1998
Bioinformatics and computational biology › phylogenetics
phylogenetic inference
0.011998
New phylogenetic venues opened by a novel implementation of the DNAml algorithm · Bioinform. 1998
Bioinformatics and computational biology
protein sequence analysis
0.011998
Self-organizing tree growing network for classifying amino acids · Bioinform. 1998
Parallel and multicore computing › parallel algorithms
parallel algorithm design
0.011998
New phylogenetic venues opened by a novel implementation of the DNAml algorithm · Bioinform. 1998

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

parallelization · 0.0self-organizing tree growing neural network · 0.0runtime analysis · 0.0run-time analysis · 0.0
YearPublicationVenuePosition
1998 New phylogenetic venues opened by a novel implementation of the DNAml algorithm
abstract
SUMMARY: This note describes the parallelization of a key biological application, such as the construction of phylogenetic trees, using the DNAml program. A careful run-time analysis allowed us to propose an efficient parallelization that scaled very well to large problem sizes. AVAILABILITY: By anonymous ftp at ftp.ac.uma. es (/pub/ots/pDNAml) or from our web site http://www.cnb.uam. es/www/software/software_index.html CONTACT: [email protected]
Oswaldo Trelles, C. Ceron, Huaichun Wang, Joaquín Dopazo, José María Carazo
Bioinform.3
1998 Self-organizing tree growing network for classifying amino acids
abstract
UNLABELLED: A self-organizing tree growing neural network was applied to classify amino acids and amino acid exchange matrices. AVAILABILITY: SOTA, is freely available by anonymous FTP or at http://www.cnb.uam.es/bioinfo/Software/so ta. CONTACT: [email protected]
Huaichun Wang, Joaquín Dopazo, José María Carazo
Bioinform.1