{"schema":"pith.reference-change-event.v1","doi":"10.1136/bmj.k1687","canonical_url":"https://pith.science/event/10.1136/bmj.k1687","json_url":"https://pith.science/event/10.1136/bmj.k1687.json","not_a_judgment":"This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.","primary":{"event_id":205352,"doi":"10.1136/bmj.k1687","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2018-05-02","title":"The 100 000 Genomes Project: bringing whole genome sequencing to the NHS","work_title":null,"work_doi":"10.1136/bmj.k1687","work_arxiv_id":null,"notice_doi":"10.1136/bmj.k1952","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1136/bmj.k1687","json_href":"/event/10.1136/bmj.k1687.json"},"events":[{"event_id":205352,"doi":"10.1136/bmj.k1687","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2018-05-02","title":"The 100 000 Genomes Project: bringing whole genome sequencing to the NHS","work_title":null,"work_doi":"10.1136/bmj.k1687","work_arxiv_id":null,"notice_doi":"10.1136/bmj.k1952","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1136/bmj.k1687","json_href":"/event/10.1136/bmj.k1687.json"}],"flags":[{"id":8878,"status":"open","status_label":"Open","citing_arxiv_id":"2506.08225","citing_title":"Testing Suffixient Sets","ref_index":13,"evidence_raw":"Turnbull, C., et al.: The 100,000 genomes project: bringing whole genome sequenc- ing to the NHS. Br. Med. J.361(2018). https://doi.org/10.1136/bmj.k1687 A Deferred material from Section 2 Givenα, β∈Σ ∗, the lexicographic order< lex is defined as follows:α <lex β if and only if there existsj∈Nsuch thatα[1, j] =β[1, j]andj=|α|or α[j+ 1]̸=β[j+ 1]. GivenT∈Σ n, the suffix arraySA(T)ofTis a permutation of[n]such that for any1≤i < j≤nholdsT[SA(T)[i], n]< lex T[SA(T)[j], n]. Thelongestcommonprefixlcp(α, β)betweenαandβisdefinedaslcp(α, β) = λif and only if for everyi∈[λ]it holdsα[i] =β[i]andλ= min(|α|,|β|)or α[λ+ 1]̸=β[λ+ 1]. 14 Davide Cenzato, Francisco Olivares and Nicola Prezza The Longest Common Prefix arrayLCP(T)ofTis defined asLCP(T)[i] = lcp(T[SA(T)[i−1], n], T[SA(T)[i], n]), ifi∈[2, n], andLCP(T)[i] = 0, otherwise. The Burrows-Wheeler TransformBWT(T)is a permutation of the characters ofTsuch thatBWT(T)[i]the character inTto the left of the starting position of thei-th suffix ofT, namelyBWT(T)[i] =T[SA[i]−1], ifi∈[2, n], and BWT(T)[i] =T[n], otherwise. For simplicity, whenTis clear from context, we denote bySA,LCP, and BWTtoSA(T),BWT(T), andLCP(T), respectively","evidence_cleaned":null,"evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2018-05-02","work_title":null,"work_doi":"10.1136/bmj.k1687","event_doi":"10.1136/bmj.k1687","flag_href":"/flags/8878","event_href":"/event/10.1136/bmj.k1687","paper_href":"/paper/2506.08225","created_at":"2026-08-07T06:19:11.850680Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":1,"flags_open":1,"flags_disputed":0,"desk_url":"https://pith.science/flags"}