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
Genome Rearrangement Algorithms
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.

311 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.
311 works in the cohort · of 4,299,418page 1 of 7

Labels cover 0 of 311 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 311 of 311 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.

affno abstractunlabeled
A Unifying View of Genome Rearrangements
Anne Bergeron, Julia Mixtacki, Jens Stoye
2006· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
299
citations
affunlabeled
Perfect Phylogenetic Networks with Recombination
Lusheng Wang, Kaizhong Zhang, Louxin Zhang
2001· article· en· Journal of Computational Biology· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
216
citations
fundno affunlabeled
Bos taurus genome assembly
Yue Liu, Xiang Qin, Xingzhi Song, Huaiyang Jiang, Yufeng Shen, K. James Durbin +10 more
2009· article· en· BMC Genomics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
162
citations
affno abstractunlabeled
Advances on sorting by reversals
Éric Tannier, Anne Bergeron, Marie-France Sagot
2006· article· en· Discrete Applied Mathematics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
109
citations
affunlabeled
Tests for Gene Clustering
Dannie Durand, David Sankoff
2003· article· en· Journal of Computational Biology· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
77
citations
affunlabeled
ANGES: reconstructing ANcestral GEnomeS maps
Bradley R. Jones, Ashok Rajaraman, Éric Tannier, Cédric Chauve
2012· article· en· Bioinformatics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
70
citations
afffundunlabeled
Multiple spaced seeds for homology search
Lucian Ilie, Silvana Ilie
2007· article· en· Bioinformatics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
67
citations
affunlabeled
On Sorting by Translocations
Anne Bergeron, Julia Mixtacki, Jens Stoye
2006· article· en· Journal of Computational Biology· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
Reversal Distance without Hurdles and Fortresses
Anne Bergeron, Julia Mixtacki, Jens Stoye
2004· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
57
citations
affunlabeled
Perfect Sorting by Reversals Is Not Always Difficult
Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul
2007· article· en· IEEE/ACM Transactions on Computational Biology and Bioinformatics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
57
citations
affunlabeled
Detection and validation of single gene inversions
J Lefebvre, Nadia El-Mabrouk, Elisabeth R.M. Tillier, David Sankoff
2003· article· en· Bioinformatics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
56
citations
affunlabeled
Evolution of orthologous tandemly arrayed gene clusters
Olivier Tremblay Savard, Denis Bertrand, Nadia El-Mabrouk
2011· article· en· BMC Bioinformatics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
48
citations
afffundunlabeled
Secure approximation of edit distance on genomic data
Md Momin Al Aziz, Dima Alhadidi, Noman Mohammed
2017· article· en· BMC Medical Genomics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Strictly chordal graphs are leaf powers
W. Sean Kennedy, Guohui Lin, Guiying Yan
2005· article· en· Journal of Discrete Algorithms· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
38
citations
next →

How this was built: Screen · Findings · About