On the public citation graph

Rapidly Computing the Phylogenetic Transfer Index

https://doi.org/10.1101/743948
0 signed · 20 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-21458-5_14openalex-snapshot
Fast Error-Tolerant Quartet Phylogeny Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-33122-0_2openalex-snapshot
Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing
inferredcites →https://doi.org/10.1007/bf01908061openalex-snapshot
Optimal algorithms for comparing trees with labeled leaves
inferredcites →https://doi.org/10.1007/s00285-019-01365-0openalex-snapshot
Distribution and asymptotic behavior of the phylogenetic transfer distance
inferredcites →https://doi.org/10.1007/s00453-003-1065-yopenalex-snapshot
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/s0304-3975(99)00028-6openalex-snapshot
A few logs suffice to build (almost) all trees: Part II
inferredcites →https://doi.org/10.1038/s41586-018-0043-0openalex-snapshot
Renewing Felsenstein’s phylogenetic bootstrap in the era of big data
inferredcites →https://doi.org/10.1093/bioinformatics/btq228openalex-snapshot
DendroPy: a Python library for phylogenetic computing
inferredcites →https://doi.org/10.1093/bioinformatics/btz874openalex-snapshot
A fast and memory-efficient implementation of the transfer bootstrap
inferredcites →https://doi.org/10.1093/molbev/msw038openalex-snapshot
Clustering Genes of Common Evolutionary History
inferredcites →https://doi.org/10.1109/tcbb.2011.157openalex-snapshot
A Metric for Phylogenetic Trees Based on Matching
inferredcites →https://doi.org/10.1109/tcbb.2011.48openalex-snapshot
Matching Split Distance for Unrooted Binary Phylogenetic Trees
inferredcites →https://doi.org/10.1111/j.1558-5646.1985.tb00420.xopenalex-snapshot
CONFIDENCE LIMITS ON PHYLOGENIES: AN APPROACH USING THE BOOTSTRAP
inferredcites →https://doi.org/10.1137/1.9781611974485openalex-snapshot
Phylogeny
inferredcites →https://doi.org/10.1371/journal.pone.0009490openalex-snapshot
FastTree 2 – Approximately Maximum-Likelihood Trees for Large Alignments
inferredcites →https://doi.org/10.14778/2095686.2095692openalex-snapshot
RTED
inferredcites →https://doi.org/10.5555/338219.338264openalex-snapshot
Computing the quartet distance between evolutionary trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1089/cmb.2023.0338openalex-snapshot
Asymmetric Cluster-Based Measures for Comparative Phylogenetics
inferred← citeshttps://doi.org/10.1093/bioinformatics/btz874openalex-snapshot
A fast and memory-efficient implementation of the transfer bootstrap
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.