US 11,699,504 B2
Hash-based efficient comparison of sequencing results
Geert Trooskens, Ghent (BE); and Wim Maria R. Van Criekinge, Waarloos (BE)
Assigned to SHARECARE AI, INC., Palo Alto, CA (US)
Filed by SHARECARE AI, INC., Palo Alto, CA (US)
Filed on Sep. 18, 2019, as Appl. No. 16/575,276.
Claims priority of provisional application 62/734,840, filed on Sep. 21, 2018.
Claims priority of provisional application 62/734,872, filed on Sep. 21, 2018.
Claims priority of provisional application 62/734,895, filed on Sep. 21, 2018.
Prior Publication US 2020/0098446 A1, Mar. 26, 2020
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/00 (2019.01); G16B 30/00 (2019.01); G16B 40/00 (2019.01); G16B 10/00 (2019.01); G06F 16/22 (2019.01); G16B 20/20 (2019.01); G16B 45/00 (2019.01); G16B 20/40 (2019.01); G16B 5/00 (2019.01); G16B 40/10 (2019.01); C12Q 1/6827 (2018.01); C12Q 1/6869 (2018.01); G06F 17/18 (2006.01); G16B 50/00 (2019.01)
CPC G16B 30/00 (2019.02) [C12Q 1/6827 (2013.01); C12Q 1/6869 (2013.01); G06F 16/2255 (2019.01); G06F 17/18 (2013.01); G16B 5/00 (2019.02); G16B 10/00 (2019.02); G16B 20/20 (2019.02); G16B 20/40 (2019.02); G16B 40/00 (2019.02); G16B 40/10 (2019.02); G16B 45/00 (2019.02); G16B 50/00 (2019.02)] 27 Claims
OG exemplary drawing
 
1. A computer-implemented method of efficiently comparing read results, the method including:
generating a reference array of variant data for locations shared between read results to be compared;
generating hashes over a selected pattern length of positions in the reference array to independently produce non-unique window hashes for base patterns in the read results;
selecting for comparison window hashes that occur less than a ceiling number of times;
comparing the selected window hashes to identify common window hashes between the read results; and
determining a similarity measure for the read results based on the common window hashes.