MétaCan
Menu
← Back to cohort
Record W2951946877 · doi:10.1371/journal.pone.0128026

UniqTag: Content-Derived Unique and Stable Identifiers for Gene Annotation

2015· article· en· W2951946877 on OpenAlexaff
Shaun D. Jackman, Jöerg Bohlmann, İnanç Birol

Bibliographic record

VenuePLoS ONE · 2015
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Phylogenetic Studies
Canadian institutionsCanada's Michael Smith Genome Sciences CentreUniversity of British ColumbiaBC Cancer Agency
Fundersnot available
KeywordsEnsemblIdentifierUnique identifierComputer scienceAnnotationGene AnnotationGenomeGenome projectGene nomenclatureSequence (biology)Computational biologyReference genomeGeneGeneticsGenomicsBiologyProgramming languageArtificial intelligence

Abstract

fetched live from OpenAlex

When working on an ongoing genome sequencing and assembly project, it is rather inconvenient when gene identifiers change from one build of the assembly to the next. The gene labelling system described here, UniqTag, addresses this common challenge. UniqTag assigns a unique identifier to each gene that is a representative k-mer, a string of length k, selected from the sequence of that gene. Unlike serial numbers, these identifiers are stable between different assemblies and annotations of the same data without requiring that previous annotations be lifted over by sequence alignment. We assign UniqTag identifiers to ten builds of the Ensembl human genome spanning eight years to demonstrate this stability. The implementation of UniqTag in Ruby and an R package are available at https://github.com/sjackman/uniqtag sjackman/uniqtag. The R package is also available from CRAN: install.packages ("uniqtag"). Supplementary material and code to reproduce it is available at https://github.com/sjackman/uniqtag-paper.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.038
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.041
Threshold uncertainty score0.136

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.038
Meta-epidemiology (narrow)0.0030.003
Meta-epidemiology (broad)0.0030.003
Bibliometrics0.0060.007
Science and technology studies0.0030.001
Scholarly communication0.0050.005
Open science0.0050.007
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0410.056

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.112
GPT teacher head0.244
Teacher spread0.132 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2015
Admission routes1
Has abstractyes

Explore more

Same venuePLoS ONE→Same topicGenomics and Phylogenetic Studies→French-language works237,207→