🏆 Finalist — NIH Data Sharing Index (“S-Index”) Challenge

Ran Libeskind-Hadas

Claremont McKenna College

ORCID: 0000-0001-9120-1948

Biochemistry, Genetics and Molecular BiologyComputer ScienceEngineering

Pilot corpus only

This score is computed over theSindex pilot corpus and does not cover the full scientific literature. Scores are relative to papers we have ingested — papers, authors, and institutions outside the pilot are not represented. Methodology.

Top 100%percentile

0Author DataRank

Indexed papers

3in pilot corpus

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Why this DataRank?

An author's DataRank is the sum of the DataRanks of all 3 indexed papers attributed to them. A prolific author with many moderate-impact papers can outrank one with a single high-impact paper.

Author scores recompute whenever paper DataRanks are refreshed, so this number lags the underlying paper scores by at most one batch run.

Read the full methodology →

Papers

Driven by 4 papers. Top paper: “Pareto-optimal phylogenetic tree reconciliation”.

Pareto-optimal phylogenetic tree reconciliation

Bioinformatics(2014)10.1093/bioinformatics/btu289

N/A

0.624DataRank · unranked

63 citations

Yi-Chieh Wu, Mukul S. Bansal, Sharon L. R. Kardia, Ran Libeskind-Hadas

Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model

BMC Bioinformatics(2019)10.1186/s12859-019-3206-6

N/A

0.539DataRank · unranked

9 citations

Nuo Liu, Ran Libeskind-Hadas, Yi-Chieh Wu, Ross Mawhorter

DTL reconciliation repair

BMC Bioinformatics(2017)10.1186/s12859-017-1463-9

N/A

0.499DataRank · unranked

12 citations

Dmitriy Smirnov, Ran Libeskind-Hadas, Weiyun Ma

An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model

BMC Bioinformatics(2019)10.1186/s12859-019-3203-9

N/A

0.494DataRank · unranked

12 citations

Ross Mawhorter, Ran Libeskind-Hadas, Santi Santichaivekin