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

Martin R. Smith

dblp:276/0258 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
1since 2021 · last 2021
0000-0001-5660-1727ORCID · corroborated

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

Security and privacy · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021

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%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
phylogenetics
0.412020
Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees · Bioinform. 2020
Bioinformatics and computational biology › phylogenetics
phylogenetic tree comparison
0.412020
Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees · Bioinform. 2020
Information theory
information measures
0.412020
Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees · Bioinform. 2020

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

robinson-foulds metric · 0.9mutual clustering information · 0.9
YearPublicationVenuePosition
2021 Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees
abstract
Bioinformatics (2020) doi: 10.1093/bioinformatics/btaa614 In the above article, Figure 1 has been updated as follows online: Previous version Corrected version
Martin R. Smith
Bioinform.1
2020 Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees
abstract
MOTIVATION: The Robinson-Foulds (RF) metric is widely used by biologists, linguists and chemists to quantify similarity between pairs of phylogenetic trees. The measure tallies the number of bipartition splits that occur in both trees-but this conservative approach ignores potential similarities between almost-identical splits, with undesirable consequences. 'Generalized' RF metrics address this shortcoming by pairing splits in one tree with similar splits in the other. Each pair is assigned a similarity score, the sum of which enumerates the similarity between two trees. The challenge lies in quantifying split similarity: existing definitions lack a principled statistical underpinning, resulting in misleading tree distances that are difficult to interpret. Here, I propose probabilistic measures of split similarity, which allow tree similarity to be measured in natural units (bits). RESULTS: My new information-theoretic metrics outperform alternative measures of tree similarity when evaluated against a broad suite of criteria, even though they do not account for the non-independence of splits within a single tree. Mutual clustering information exhibits none of the undesirable properties that characterize other tree comparison metrics, and should be preferred to the RF metric. AVAILABILITY AND IMPLEMENTATION: The methods discussed in this article are implemented in the R package 'TreeDist', archived at https://dx.doi.org/10.5281/zenodo.3528123. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Martin R. Smith
Bioinform.1
1990 Part 2 Personnel security measures within a computer installation
Martin R. Smith
Comput. Law Secur. Rev.1
1989 The people risks
Martin R. Smith
Comput. Law Secur. Rev.1
1989 Computer versus security staff?
Martin R. Smith
Comput. Law Secur. Rev.1