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

Haoyong Zhang

dblp:86/6299 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none

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

Theory of computation · 1Applied, 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
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › phylogenetics › computational phylogenetics
alignment-free phylogeny
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology
phylogenetics
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology
sequence analysis
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology › phylogenetics › phylogenomics
whole-genome phylogeny
0.012001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny · Bioinform. 2001
Bioinformatics and computational biology › phylogenetics
computational phylogenetics
0.012000
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) · SODA 2000
Bioinformatics and computational biology › phylogenetics
evolutionary tree
0.012000
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) · SODA 2000
Algorithms and data structures › computational biology
phylogenetic trees
0.012000
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) · SODA 2000
Algorithms and data structures › computational biology
phylogenetic tree inference
0.012000
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract) · SODA 2000

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

combinatorial optimization · 0.1kolmogorov complexity · 0.0compression-based distance estimation · 0.0
YearPublicationVenuePosition
2001 An information-based sequence distance and its application to whole mitochondrial genome phylogeny
abstract
MOTIVATION: Traditional sequence distances require an alignment and therefore are not directly applicable to the problem of whole genome phylogeny where events such as rearrangements make full length alignments impossible. We present a sequence distance that works on unaligned sequences using the information theoretical concept of Kolmogorov complexity and a program to estimate this distance. RESULTS: We establish the mathematical foundations of our distance and illustrate its use by constructing a phylogeny of the Eutherian orders using complete unaligned mitochondrial genomes. This phylogeny is consistent with the commonly accepted one for the Eutherians. A second, larger mammalian dataset is also analyzed, yielding a phylogeny generally consistent with the commonly accepted one for the mammals. AVAILABILITY: The program to estimate our sequence distance, is available at http://www.cs.cityu.edu.hk/~cssamk/gencomp/GenCompress1.htm. The distance matrices used to generate our phylogenies are available at http://www.math.uwaterloo.ca/~mli/distance.html.
Ming Li 0001, Jonathan H. Badger, Sam Kwong, Paul E. Kearney, Haoyong Zhang
Bioinform.6
2000 A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)
Vincent Berry, David Bryant, Tao Jiang 0001, Paul E. Kearney, Ming Li 0001, Todd Wareham, Haoyong Zhang
SODA7