MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Algorithms and Data Compression
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,336 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,336 works in the cohort · of 4,299,418page 1 of 27

Labels cover 0 of 1,336 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,336 of 1,336 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Array programming with NumPy
2020· review· en· TUScholarShare (Temple University)· Computer Science
machine prediction:candidate · noneconsensus · none
18,805
citations
affno abstractunlabeled
NP-hardness of Euclidean sum-of-squares clustering
Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat
2009· article· en· Machine Learning· Computer Science
machine prediction:candidate · noneconsensus · none
863
citations
affunlabeled
JBrowse: A next-generation genome browser
Mitchell E. Skinner, Andrew Uzilov, Lincoln Stein, Chris Mungall, Ian Holmes
2009· article· en· Genome Research· Computer Science
machine prediction:candidate · noneconsensus · none
776
citations
affunlabeled
A brief survey on sequence classification
Zhengzheng Xing, Jian Pei, Eamonn Keogh
2010· article· en· ACM SIGKDD Explorations Newsletter· Computer Science
machine prediction:candidate · noneconsensus · none
552
citations
affno abstractunlabeled
Distinguishing string selection problems
J. Kevin Lanctot, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang
2003· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
236
citations
afffundunlabeled
Better bitmap performance with Roaring bitmaps
Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
2015· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
159
citations
affno abstractunlabeled
On spaced seeds for similarity search
Uri Keich, Ming Li, Bin Ma, John Tromp
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
142
citations
affno abstractunlabeled
Finding Similar Regions in Many Sequences
Ming Li, Bin Ma, Lusheng Wang
2002· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
139
citations
affunlabeled
Multi-Exemplar Affinity Propagation
Changdong Wang, Jian-Huang Lai, Ching Y. Suen, Junyong Zhu
2013· article· en· IEEE Transactions on Pattern Analysis and Machine Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
122
citations
affno abstractunlabeled
Solving large FPT problems on coarse-grained parallel machines
James J. Cheetham, Frank Dehne, Andrew Rau‐Chaplin, Ulrike Stege, Peter J. Taillon
2003· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
114
citations
affunlabeled
Efficient diversity-aware search
Albert Angel, Nick Koudas
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
110
citations
affunlabeled
Single parity check product codes
David M. Rankin, T. Aaron Gulliver
2001· article· en· IEEE Transactions on Communications· Computer Science
machine prediction:candidate · noneconsensus · none
110
citations
affno abstractunlabeled
Space Efficient Suffix Trees
Venkatesh Raman
2001· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
103
citations
affunlabeled
Fast and Compact Web Graph Representations
Francisco Claude, Gonzalo Navarro
2010· article· en· ACM Transactions on the Web· Computer Science
machine prediction:candidate · noneconsensus · none
103
citations
affunlabeled
ntHash: recursive nucleotide hashing
Hamid Mohamadi, Justin Chu, Benjamin P. Vandervalk, İnanç Birol
2016· article· en· Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
98
citations
affunlabeled
Self-Indexed Grammar-Based Compression
Francisco Claude, Gonzalo Navarro
2011· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
96
citations
afffundunlabeled
A compression algorithm for DNA sequences
Xin Chen, Sam Kwong, Ming Li
2001· article· en· IEEE Engineering in Medicine and Biology Magazine· Computer Science
machine prediction:candidate · noneconsensus · none
93
citations
fundno affunlabeled
SPRING: a next-generation compressor for FASTQ data
Shubham Chandak, Kedar Tatwawadi, Idoia Ochoa, Mikel Hernáez, Tsachy Weissman
2018· article· en· Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
91
citations
fundno affunlabeled
Optimal phylogenetic reconstruction
Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
90
citations
affno abstractunlabeled
Cuckoo hashing: Further analysis
Luc Devroye, Pat Morin
2003· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
89
citations
affunlabeled
Rank/select operations on large alphabets
Alexander Golynski, J. Ian Munro
2006· article· en· Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06· Computer Science
machine prediction:candidate · noneconsensus · none
86
citations
next →

How this was built: Screen · Findings · About