IP Library › Granted Patent US 12,277,998
Granted Patent B2
US 12,277,998 · App. 18/163,794 · Granted Apr 15, 2025

Artificial intelligence-based base calling

Inventors: Kishore Jaganathan (San Francisco, CA); John Randall Gobbel (Brisbane, CA); Amirali Kia (San Mateo, CA)
Assignee: Illumina, Inc.
G16B40/20G06F16/907G06F18/214G06F18/217G06F18/23G06F18/23211G06F18/24G06F18/2415G06F18/2431G06N3/04G06N3/08G06N3/084G06N7/01G06V10/267G06V10/454G06V10/751G06V10/763G06V10/764G06V10/7715G06V10/7784G06V10/82G06V10/993G06V20/69G16B40/00G06N5/046G06V20/47
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,277,998
App. No.
18/163,794
Filed
Feb 2, 2023
Granted
Apr 15, 2025
Kind
B2
Art Unit
2669
USPC
706/20
Abstract

The technology disclosed processes input data through a neural network and produces an alternative representation of the input data. The input data includes per-cycle image data for each of one or more sequencing cycles of a sequencing run. The per-cycle image data depicts intensity emissions of one or more analytes and their surrounding background captured at a respective sequencing cycle. The technology disclosed processes the alternative representation through an output layer and producing an output and base calls one or more of the analytes at one or more of the sequencing cycles based on the output.

Claims (67)

1. A system comprising:

at least one processor; and

a non-transitory computer readable medium storing instructions that, when executed by the at least one processor, cause the system to:

receive a set of per-cycle images depicting intensity emissions from a target cluster and one or more adjacent clusters at different positions within a region of a flow cell and at different sequencing cycles;

receive supplemental input that provides information in addition to the intensity emissions depicted in the set of per-cycle images, the supplemental input comprising at least one of distance information indicating distances between pixels within the set of per-cycle images, scaling information indicating at least one of cluster sizes or illumination conditions, cluster center coordinate information, or pixel attribution information indicating classifications of pixels as background, cluster center, or cluster interior;

generate, utilizing convolutional layers of a neural network, an alternative representation of the set of per-cycle images and the supplemental input;

determine, utilizing an output layer of the neural network and based on the alternative representation, classification scores indicating likelihoods that the target cluster incorporated each of four bases at a target sequencing cycle; and

determine a base call for the target cluster at the target sequencing cycle based on the classification scores.

2. The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the system to receive the set of per-cycle images by:

receiving a first subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at a preceding sequencing cycle occurring before the target sequencing cycle;

receiving a second subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at the target sequencing cycle; and

receiving a third subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at a subsequent sequencing cycle occurring after the target sequencing cycle.

3. The system of claim 2 , wherein each of the first subset of per-cycle images, the second subset of per-cycle images, and the third subset of per-cycle images comprise:

a first per-cycle image patch capturing image data from a tile within the flow cell for a first intensity channel; and

a second per-cycle image patch capturing image data from the tile within the flow cell for a second intensity channel.

4. The system of claim 2 , further comprising instructions that, when executed by the at least one processor, cause the system to generate the alternative representation of at least the set of per-cycle images by generating the alternative representation of image data from the first subset of per-cycle images, the second subset of per-cycle images, and the third subset of per-cycle images.

5. The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the system to generate, utilizing one or more convolutional layers of the neural network, the alternative representation of at least the set of per-cycle images by generating, utilizing spatial convolution layers of the neural network:

a first subset of spatial feature maps representing image data for a preceding sequencing cycle occurring before the target sequencing cycle;

a second subset of spatial feature maps representing image data for the target sequencing cycle; and

a third subset of spatial feature maps representing image data for a subsequent sequencing cycle occurring after the target sequencing cycle.

6. The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the system to generate, utilizing convolutional layers of the neural network, the alternative representation of at least the set of per-cycle images by generating, utilizing one or more temporal convolution layers of the neural network, temporal feature maps representing image data for the target cluster and the one or more adjacent clusters from a preceding sequencing cycle occurring before the target sequencing cycle, the target sequencing cycle, and a subsequent sequencing cycle occurring after the target sequencing cycle.

7. The system of claim 6 , further comprising instructions that, when executed by the at least one processor, cause the system to:

generate, utilizing a flatten layer of the neural network, a flattened output from the temporal feature maps;

generate, utilizing a dense layer of the neural network, a dense output from the flattened output; and

determine, utilizing the output layer of the neural network, the classification scores from the dense output.

8. The system of claim 1 , wherein the instructions, when executed by the at least one processor, cause the system to:

receive the supplemental input that provides the information in addition to the intensity emissions depicted in the set of per-cycle images by receiving the distance information that identifies the distances between the pixels within the set of per-cycle images; and

generate the alternative representation of the set of per-cycle images and the supplemental input by generating the alternative representation of the set of per-cycle images and the distance information.

9. A non-transitory computer readable storage medium storing computer instructions that, when executed by at least one processor, cause a system to:

receive a set of per-cycle images depicting intensity emissions from a target cluster and one or more adjacent clusters at different positions within a region of a flow cell and at different sequencing cycles;

receive supplemental input that provides information in addition to the intensity emissions depicted in the set of per-cycle images, the supplemental input comprising at least one of distance information indicating distances between pixels within the set of per-cycle images, scaling information indicating at least one of cluster sizes or illumination conditions, cluster center coordinate information, or pixel attribution information indicating classifications of pixels as background, cluster center, or cluster interior;

generate, utilizing convolutional layers of a neural network, an alternative representation of the set of per-cycle images and the supplemental input;

determine, utilizing an output layer of the neural network and based on the alternative representation, classification scores indicating likelihoods that the target cluster incorporated each of four bases at a target sequencing cycle; and

determine a base call for the target cluster at the target sequencing cycle based on the classification scores.

10. The non-transitory computer readable storage medium of claim 9 , further storing computer instructions that, when executed by the at least one processor, cause the system to receive the set of per-cycle images by:

receiving a first subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at a preceding sequencing cycle occurring before the target sequencing cycle;

receiving a second subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at the target sequencing cycle; and

receiving a third subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at a subsequent sequencing cycle occurring after the target sequencing cycle.

11. The non-transitory computer readable storage medium of claim 10 , further storing computer instructions that, when executed by the at least one processor, cause the system to generate the alternative representation of at least the set of per-cycle images by generating the alternative representation of image data from the first subset of per-cycle images, the second subset of per-cycle images, and the third subset of per-cycle images.

12. The non-transitory computer readable storage medium of claim 9 , further storing computer instructions that, when executed by the at least one processor, cause the system to generate, utilizing one or more convolutional layers of the neural network, the alternative representation of at least the set of per-cycle images by generating, utilizing spatial convolution layers of the neural network:

a first subset of spatial feature maps representing image data for a preceding sequencing cycle occurring before the target sequencing cycle;

a second subset of spatial feature maps representing image data for the target sequencing cycle; and

a third subset of spatial feature maps representing image data for a subsequent sequencing cycle occurring after the target sequencing cycle.

13. The non-transitory computer readable storage medium of claim 9 , further storing computer instructions that, when executed by the at least one processor, cause the system to generate, utilizing convolutional layers of the neural network, the alternative representation of at least the set of per-cycle images by generating, utilizing one or more temporal convolution layers of the neural network, temporal feature maps representing image data for the target cluster and the one or more adjacent clusters from a preceding sequencing cycle occurring before the target sequencing cycle, the target sequencing cycle, and a subsequent sequencing cycle occurring after the target sequencing cycle.

14. The non-transitory computer readable storage medium of claim 13 , further storing computer instructions that, when executed by the at least one processor, cause the system to:

generate, utilizing a flatten layer of the neural network, a flattened output from the temporal feature maps;

generate, utilizing a dense layer of the neural network, a dense output from the flattened output; and

determine, utilizing the output layer of the neural network, the classification scores from the dense output.

15. The non-transitory computer readable storage medium of claim 9 , wherein the computer instructions, when executed by the at least one processor, cause the system to:

receive the supplemental input that provides the information in addition to the intensity emissions depicted in the set of per-cycle images by receiving the distance information that identifies the distances between the pixels within the set of per-cycle images; and

generate the alternative representation of the set of per-cycle images and the supplemental input by generating the alternative representation of the set of per-cycle images and the distance information.

16. A computer-implemented method comprising:

receiving a set of per-cycle images depicting intensity emissions from a target cluster and one or more adjacent clusters at different positions within a region of a flow cell and at different sequencing cycles;

receive supplemental input that provides information in addition to the intensity emissions depicted in the set of per-cycle images, the supplemental input comprising at least one of distance information indicating distances between pixels within the set of per-cycle images, scaling information indicating at least one of cluster sizes or illumination conditions, cluster center coordinate information, or pixel attribution information indicating classifications of pixels as background, cluster center, or cluster interior;

generating, utilizing convolutional layers of a neural network, an alternative representation of the set of per-cycle images and the supplemental input;

determining, utilizing an output layer of the neural network and based on the alternative representation, classification scores indicating likelihoods that the target cluster incorporated each of four bases at a target sequencing cycle; and

determining a base call for the target cluster at the target sequencing cycle based on the classification scores.

17. The computer-implemented method of claim 16 , wherein receiving the set of per-cycle images comprises:

receiving a first subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at a preceding sequencing cycle occurring before the target sequencing cycle;

receiving a second subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at the target sequencing cycle; and

receiving a third subset of per-cycle images depicting intensity emissions from the target cluster and the one or more adjacent clusters at a subsequent sequencing cycle occurring after the target sequencing cycle.

18. The computer-implemented method of claim 17 , wherein generating the alternative representation of at least the set of per-cycle images comprises generating the alternative representation of image data from the first subset of per-cycle images, the second subset of per-cycle images, and the third subset of per-cycle images.

19. The computer-implemented method of claim 16 , wherein generating, utilizing one or more convolutional layers of the neural network, the alternative representation of at least the set of per-cycle images comprises generating, utilizing spatial convolution layers of the neural network:

a first subset of spatial feature maps representing image data for a preceding sequencing cycle occurring before the target sequencing cycle;

a second subset of spatial feature maps representing image data for the target sequencing cycle; and

a third subset of spatial feature maps representing image data for a subsequent sequencing cycle occurring after the target sequencing cycle.

20. The computer-implemented method of claim 16 , wherein generating, utilizing convolutional layers of the neural network, the alternative representation of at least the set of per-cycle images comprises generating, utilizing one or more temporal convolution layers of the neural network, temporal feature maps representing image data for the target cluster and the one or more adjacent clusters from a preceding sequencing cycle occurring before the target sequencing cycle, the target sequencing cycle, and a subsequent sequencing cycle occurring after the target sequencing cycle.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 7, 2023
From: KIA, AMIRALI
To: ILLUMINA, INC.
Reel/Frame 062615/0558 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 7, 2023
From: KIA, AMIRALI
To: ILLUMINA, INC.
Reel/Frame 062615/0619 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 7, 2023
From: JAGANATHAN, KISHORE; KIA, AMIRALI; GOBBEL, JOHN RANDALL
To: ILLUMINA, INC.
Reel/Frame 062615/0776 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 7, 2023
From: JAGANATHAN, KISHORE; GOBBEL, JOHN RANDALL; KIA, AMIRALI
To: ILLUMINA, INC.
Reel/Frame 062615/0897 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 7, 2023
From: JAGANATHAN, KISHORE; KIA, AMIRALI; GOBBEL, JOHN RANDALL
To: ILLUMINA, INC.
Reel/Frame 062615/0963 →
Continuity (7)
Continuation 16826126 · Mar 20, 2020
Provisional Application 62821681 · Mar 21, 2019
Provisional Application 62821602 · Mar 21, 2019
Provisional Application 62821618 · Mar 21, 2019
Provisional Application 62821766 · Mar 21, 2019
Provisional Application 62821724 · Mar 21, 2019
Related Publication 20230268033A1 · Aug 24, 2023
References Cited (400)
US 5502773A · Tibbetts et al. · 1996 [cited by applicant]
US 5641658A · Adams et al. · 1997 [cited by applicant]
US 6090592A · Adams et al. · 2000 [cited by applicant]
US 7057026B2 · Barnes et al. · 2006 [cited by applicant]
US 7115400B1 · Adessi et al. · 2006 [cited by applicant]
US 7211414B2 · Hardin et al. · 2007 [cited by applicant]
US 7315019B2 · Turner et al. · 2008 [cited by applicant]
US 7329492B2 · Hardin et al. · 2008 [cited by applicant]
US 7405281B2 · Xu et al. · 2008 [cited by applicant]
US 7427673B2 · Balasubramanian et al. · 2008 [cited by applicant]
US 7541444B2 · Milton et al. · 2009 [cited by applicant]
US 7566537B2 · Balasubramanian et al. · 2009 [cited by applicant]
US 7592435B2 · Milton et al. · 2009 [cited by applicant]
US 8182993B2 · Tomaney et al. · 2012 [cited by applicant]
US 8241573B2 · Banerjee et al. · 2012 [cited by applicant]
US 8392126B2 · Mann · 2013 [cited by applicant]
US 8401258B2 · Hargrove et al. · 2013 [cited by applicant]
US 8407012B2 · Erlich et al. · 2013 [cited by applicant]
US 8594439B2 · Staelin et al. · 2013 [cited by applicant]
US 8703422B2 · Tomaney et al. · 2014 [cited by applicant]
US 8725425B2 · Heiner et al. · 2014 [cited by applicant]
US 8795971B2 · Kersey et al. · 2014 [cited by applicant]
US 8965076B2 · Garcia et al. · 2015 [cited by applicant]
US 9175343B2 · Tomaney et al. · 2015 [cited by applicant]
US 9279154B2 · Previte et al. · 2016 [cited by applicant]
US 9453258B2 · Kain et al. · 2016 [cited by applicant]
US 9708656B2 · Turner et al. · 2017 [cited by applicant]
US 10023911B2 · Tomaney et al. · 2018 [cited by applicant]
US 10068053B2 · Kermani et al. · 2018 [cited by applicant]
US 10068054B2 · Van Rooyen et al. · 2018 [cited by applicant]
US 10152776B2 · Langlois et al. · 2018 [cited by applicant]
US 10168438B2 · Dennis et al. · 2019 [cited by applicant]
US 10241075B2 · Davey et al. · 2019 [cited by applicant]
US 10354747B1 · DePristo et al. · 2019 [cited by applicant]
US 10423861B2 · Gao et al. · 2019 [cited by applicant]
US 10491239B1 · Hubara · 2019 [cited by applicant]
US 10527549B2 · Rebetez et al. · 2020 [cited by applicant]
US 10540591B2 · Gao et al. · 2020 [cited by applicant]
US 10619195B2 · Lamb et al. · 2020 [cited by applicant]
US 10648027B2 · Mannion et al. · 2020 [cited by applicant]
US 10711299B2 · Rothberg et al. · 2020 [cited by applicant]
US 10713794B1 · He et al. · 2020 [cited by applicant]
US 10740880B2 · Paik et al. · 2020 [cited by applicant]
US 10740883B2 · Zerfass et al. · 2020 [cited by applicant]
US 10755810B2 · Buckler et al. · 2020 [cited by applicant]
US 10943255B1 · Andreou · 2021 [cited by applicant]
US 10963673B2 · Schaumberg et al. · 2021 [cited by applicant]
US 11056220B2 · Lyman et al. · 2021 [cited by applicant]
US 11107554B2 · Pratt et al. · 2021 [cited by applicant]
US 11138496B2 · Seth · 2021 [cited by applicant]
US 11210554B2 · Dutta et al. · 2021 [cited by applicant]
US 11276480B2 · Pratt et al. · 2022 [cited by applicant]
US 11347965B2 · Dutta et al. · 2022 [cited by applicant]
US 11436429B2 · Jaganathan et al. · 2022 [cited by applicant]
US 11462300B2 · Bartov et al. · 2022 [cited by applicant]
US 11538556B2 · Rothberg et al. · 2022 [cited by applicant]
US 20020055100A1 · Kawashima et al. · 2002 [cited by applicant]
US 20020147548A1 · Walther et al. · 2002 [cited by applicant]
US 20030062485A1 · Fernandez et al. · 2003 [cited by applicant]
US 20040002090A1 · Mayer et al. · 2004 [cited by applicant]
US 20040062360A1 · Holeva · 2004 [cited by applicant]
US 20040096853A1 · Mayer · 2004 [cited by applicant]
US 20060014151A1 · Ogura et al. · 2006 [cited by applicant]
US 20060040297A1 · Leamon et al. · 2006 [cited by applicant]
US 20060064248A1 · Saidi et al. · 2006 [cited by applicant]
US 20060188901A1 · Barnes et al. · 2006 [cited by applicant]
US 20060224529A1 · Kermani · 2006 [cited by applicant]
US 20060240439A1 · Smith et al. · 2006 [cited by applicant]
US 20060269130A1 · Maroy et al. · 2006 [cited by applicant]
US 20070118490A1 · Soderman et al. · 2007 [cited by applicant]
US 20070128624A1 · Gormley et al. · 2007 [cited by applicant]
US 20070166705A1 · Milton et al. · 2007 [cited by applicant]
US 20070250274A1 · Volkov et al. · 2007 [cited by applicant]
US 20080009420A1 · Schroth et al. · 2008 [cited by applicant]
US 20080234136A1 · Drmanac et al. · 2008 [cited by applicant]
US 20080242560A1 · Gunderson et al. · 2008 [cited by applicant]
US 20090024331A1 · Tomaney et al. · 2009 [cited by applicant]
US 20090081775A1 · Hodneland et al. · 2009 [cited by applicant]
US 20100046830A1 · Wang et al. · 2010 [cited by applicant]
US 20100088255A1 · Mann · 2010 [cited by applicant]
US 20100111370A1 · Black et al. · 2010 [cited by applicant]
US 20100157086A1 · Segale et al. · 2010 [cited by applicant]
US 20110007981A1 · Osher et al. · 2011 [cited by applicant]
US 20110059865A1 · Smith et al. · 2011 [cited by applicant]
US 20110065607A1 · Kersey et al. · 2011 [cited by applicant]
US 20110281736A1 · Drmanac et al. · 2011 [cited by applicant]
US 20110286628A1 · Goncalves et al. · 2011 [cited by applicant]
US 20110295902A1 · Mande et al. · 2011 [cited by applicant]
US 20120015825A1 · Zhong et al. · 2012 [cited by applicant]
US 20120020537A1 · Garcia et al. · 2012 [cited by applicant]
US 20130059740A1 · Drmanac et al. · 2013 [cited by applicant]
US 20130079232A1 · Kain et al. · 2013 [cited by applicant]
US 20130090860A1 · Sikora et al. · 2013 [cited by applicant]
US 20130124100A1 · Drmanac et al. · 2013 [cited by applicant]
US 20130188866A1 · Obrador et al. · 2013 [cited by applicant]
US 20130250407A1 · Schaffer et al. · 2013 [cited by applicant]
US 20140051588A9 · Drmanac et al. · 2014 [cited by applicant]
US 20140152801A1 · Fine et al. · 2014 [cited by applicant]
US 20150079596A1 · Eltoukhy et al. · 2015 [cited by applicant]
US 20150117784A1 · Lin et al. · 2015 [cited by applicant]
US 20150169824A1 · Kermani et al. · 2015 [cited by applicant]
US 20160042511A1 · Chukka et al. · 2016 [cited by applicant]
US 20160078272A1 · Hammoud · 2016 [cited by applicant]
US 20160102348A1 · Donnet · 2016 [cited by applicant]
US 20160110498A1 · Bruand et al. · 2016 [cited by applicant]
US 20160196479A1 · Chertok et al. · 2016 [cited by applicant]
US 20160247034A1 · Lee et al. · 2016 [cited by applicant]
US 20160350914A1 · Champlin et al. · 2016 [cited by applicant]
US 20160356715A1 · Zhong et al. · 2016 [cited by applicant]
US 20160357903A1 · Shendure et al. · 2016 [cited by applicant]
US 20160371431A1 · Haque et al. · 2016 [cited by applicant]
US 20170044601A1 · Crnogorac et al. · 2017 [cited by applicant]
US 20170098032A1 · Desai et al. · 2017 [cited by applicant]
US 20170116520A1 · Min et al. · 2017 [cited by applicant]
US 20170161545A1 · Champlin et al. · 2017 [cited by applicant]
US 20170169313A1 · Choi et al. · 2017 [cited by applicant]
US 20170228496A1 · Boutros et al. · 2017 [cited by applicant]
US 20170249421A1 · Eberle et al. · 2017 [cited by applicant]
US 20170249744A1 · Wang et al. · 2017 [cited by applicant]
US 20170362634A1 · Ota et al. · 2017 [cited by applicant]
US 20180075279A1 · Gertych et al. · 2018 [cited by applicant]
US 20180107927A1 · Frey · 2018 [cited by applicant]
US 20180114337A1 · Li et al. · 2018 [cited by applicant]
US 20180165412A1 · Frey et al. · 2018 [cited by applicant]
US 20180189613A1 · Wolf et al. · 2018 [cited by applicant]
US 20180195953A1 · Langlois et al. · 2018 [cited by applicant]
US 20180201992A1 · Wu et al. · 2018 [cited by applicant]
US 20180204048A1 · Chefd'Hotel et al. · 2018 [cited by applicant]
US 20180211001A1 · Gopalan et al. · 2018 [cited by applicant]
US 20180253528A1 · Strauss et al. · 2018 [cited by applicant]
US 20180274023A1 · Belitz et al. · 2018 [cited by applicant]
US 20180276333A1 · Njie et al. · 2018 [cited by applicant]
US 20180286040A1 · Sashida · 2018 [cited by applicant]
US 20180305751A1 · Vermaas et al. · 2018 [cited by applicant]
US 20180322327A1 · Smith et al. · 2018 [cited by applicant]
US 20180330824A1 · Athey · 2018 [cited by applicant]
US 20180334711A1 · Kelley et al. · 2018 [cited by applicant]
US 20180334712A1 · Singer et al. · 2018 [cited by applicant]
US 20180340234A1 · Scafe et al. · 2018 [cited by applicant]
US 20190034586A1 · Pirrotte et al. · 2019 [cited by applicant]
US 20190080450A1 · Arar et al. · 2019 [cited by applicant]
US 20190107642A1 · Farhadi Nia et al. · 2019 [cited by applicant]
US 20190114464A1 · Nicolle et al. · 2019 [cited by applicant]
US 20190114544A1 · Sundaram et al. · 2019 [cited by applicant]
US 20190128869A1 · Chou et al. · 2019 [cited by applicant]
US 20190156915A1 · Zhang et al. · 2019 [cited by applicant]
US 20190164010A1 · Ma et al. · 2019 [cited by applicant]
US 20190170680A1 · Sikora et al. · 2019 [cited by applicant]
US 20190180153A1 · Buckler et al. · 2019 [cited by applicant]
US 20190213473A1 · Dutta et al. · 2019 [cited by applicant]
US 20190237160A1 · Rothberg et al. · 2019 [cited by applicant]
US 20190237163A1 · Wang et al. · 2019 [cited by applicant]
US 20190244348A1 · Buckler et al. · 2019 [cited by applicant]
US 20190252041A1 · Frey et al. · 2019 [cited by applicant]
US 20190266491A1 · Gao et al. · 2019 [cited by applicant]
US 20190272638A1 · Mouton et al. · 2019 [cited by applicant]
US 20190332118A1 · Wang et al. · 2019 [cited by applicant]
US 20190378248A1 · Ida · 2019 [cited by examiner]
US 20190392578A1 · Chukka et al. · 2019 [cited by applicant]
US 20200027002A1 · Hickson et al. · 2020 [cited by applicant]
US 20200054306A1 · Mehanian et al. · 2020 [cited by applicant]
US 20200057838A1 · Yekhanin et al. · 2020 [cited by applicant]
US 20200065675A1 · Sundaram et al. · 2020 [cited by applicant]
US 20200123552A1 · Lee et al. · 2020 [cited by applicant]
US 20200125947A1 · Park et al. · 2020 [cited by applicant]
US 20200176082A1 · Massingham · 2020 [cited by applicant]
US 20200185055A1 · Debourg-Felonneau et al. · 2020 [cited by applicant]
US 20200193597A1 · Fan et al. · 2020 [cited by applicant]
US 20200226368A1 · Bakalo et al. · 2020 [cited by applicant]
US 20200256856A1 · Chou et al. · 2020 [cited by applicant]
US 20200302223A1 · Dutta et al. · 2020 [cited by applicant]
US 20200302224A1 · Jaganathan et al. · 2020 [cited by applicant]
US 20200302297A1 · Jaganathan et al. · 2020 [cited by applicant]
US 20200302603A1 · Barnes et al. · 2020 [cited by applicant]
US 20200320294A1 · Mangal et al. · 2020 [cited by applicant]
US 20200327377A1 · Jaganathan et al. · 2020 [cited by applicant]
US 20200342955A1 · Guo et al. · 2020 [cited by applicant]
US 20200364565A1 · Kostem · 2020 [cited by applicant]
US 20200388029A1 · Saltz et al. · 2020 [cited by applicant]
US 20210020314A1 · Ehrich et al. · 2021 [cited by applicant]
US 20210027462A1 · Bredno et al. · 2021 [cited by applicant]
US 20210056287A1 · Schaumburg et al. · 2021 [cited by applicant]
US 20210072391A1 · Li et al. · 2021 [cited by applicant]
US 20210089827A1 · Kumagai et al. · 2021 [cited by applicant]
US 20210115490A1 · Embree et al. · 2021 [cited by applicant]
US 20210183053A1 · Zink et al. · 2021 [cited by applicant]
US 20210257050A1 · Lam et al. · 2021 [cited by applicant]
US 20210264266A1 · Dutta et al. · 2021 [cited by applicant]
US 20210264267A1 · Dutta et al. · 2021 [cited by applicant]
US 20210265009A1 · Jaganathan et al. · 2021 [cited by applicant]
US 20210265015A1 · Parnaby et al. · 2021 [cited by applicant]
US 20210265016A1 · Vessere et al. · 2021 [cited by applicant]
US 20210265017A1 · Dutta et al. · 2021 [cited by applicant]
US 20210265018A1 · Dutta et al. · 2021 [cited by applicant]
US 20210324374A1 · Feagin · 2021 [cited by examiner]
US 20210390278A1 · Van Leeuwen et al. · 2021 [cited by applicant]
US 20220067489A1 · Kashefhaghighi et al. · 2022 [cited by applicant]
US 20220121884A1 · Zadeh et al. · 2022 [cited by applicant]
US 20220147760A1 · Dutta et al. · 2022 [cited by applicant]
US 20230154208A1 · Desroziers et al. · 2023 [cited by applicant]
CA 2894317A1 · 2016 [cited by applicant]
CA 3065927A1 · 2019 [cited by applicant]
CA 3104851A1 · 2020 [cited by applicant]
CN 105980578A · 2016 [cited by applicant]
CN 105989248A · 2016 [cited by applicant]
CN 108203847A · 2018 [cited by applicant]
CN 108319817A · 2018 [cited by applicant]
CN 106770114A · 2019 [cited by applicant]
CN 109416928A · 2019 [cited by applicant]
CN 110245685A · 2019 [cited by applicant]
EP 3130681A1 · 2017 [cited by applicant]
EP 3373238A1 · 2018 [cited by applicant]
JP 2007199397A · 2007 [cited by applicant]
JP 2018173943A · 2018 [cited by applicant]
JP 2019537157A · 2019 [cited by applicant]
NL 2023310A · 2020 [cited by applicant]
NL 2023311A · 2020 [cited by applicant]
NL 2023312A · 2020 [cited by applicant]
NL 2023314A · 2020 [cited by applicant]
NL 2023316A · 2020 [cited by applicant]
RU 2580425C1 · 2016 [cited by applicant]
RU 2750706C2 · 2021 [cited by applicant]
SG 10201913208 · 2020 [cited by applicant]
WO 9106678A1 · 1991 [cited by applicant]
WO 9727317Z1 · 1997 [cited by applicant]
WO 2004018497A2 · 2004 [cited by applicant]
WO 2005065814A1 · 2005 [cited by applicant]
WO 2006064199A1 · 2006 [cited by applicant]
WO 2007010251A2 · 2007 [cited by applicant]
WO 2007123744A2 · 2007 [cited by applicant]
WO 2008154317A1 · 2008 [cited by applicant]
WO 2012058096A1 · 2012 [cited by applicant]
WO 2014142921A1 · 2014 [cited by applicant]
WO 2015084985A2 · 2015 [cited by applicant]
WO 2016145516A1 · 2016 [cited by applicant]
WO 2016201564A1 · 2016 [cited by applicant]
WO 2017184997A1 · 2017 [cited by applicant]
WO 2018068014A1 · 2018 [cited by applicant]
WO 2018102748A1 · 2018 [cited by applicant]
WO 2018129314A1 · 2018 [cited by applicant]
WO 2018165099A1 · 2018 [cited by applicant]
WO 2018203084A1 · 2018 [cited by applicant]
WO 2019027767A1 · 2019 [cited by applicant]
WO 2019028047A1 · 2019 [cited by applicant]
WO 2019036388A1 · 2019 [cited by applicant]
WO 2019055856A1 · 2019 [cited by applicant]
WO 2019079182A1 · 2019 [cited by applicant]
WO 2019079202A1 · 2019 [cited by applicant]
WO 2019084515Z1 · 2019 [cited by applicant]
WO 2019090251A2 · 2019 [cited by applicant]
WO 2019136284A1 · 2019 [cited by applicant]
WO 2019136388A1 · 2019 [cited by applicant]
WO 2019140402A1 · 2019 [cited by applicant]
WO 2019147904A1 · 2019 [cited by applicant]
WO 2020014280A1 · 2020 [cited by applicant]
WO 2020123552A1 · 2020 [cited by applicant]
WO 2020191387A1 · 2020 [cited by applicant]
WO 2020191389A1 · 2020 [cited by applicant]
WO 2020191390A1 · 2020 [cited by applicant]
WO 2020191391A1 · 2020 [cited by applicant]
WO 2020205296A1 · 2020 [cited by applicant]
WO 2020232409A1 · 2020 [cited by applicant]
WO 2020232410A1 · 2020 [cited by applicant]
WO 2020243185A1 · 2020 [cited by applicant]
WO 2022056296A1 · 2022 [cited by applicant]
Sifre et al., Rigid-motion Scattering for Texture Classification, Ph.D. thesis submitted for publishing. [cited by applicant]
Wang et. al., An adaptive decorrelation method removes Illumina DNA base-calling errors caused by crosstalk between adjacent clusters—with Supplemental Materials, Scientific Reports, published Feb. 20, 2017, 17 pages. [cited by applicant]
3.3.9.11.Watershed and random walker for segmentation, Scipy lecture notes, 2 pages. [retrieved on Jun. 8, 2021] Retrieved from the internet <URL: http:scipy-lectures.org/packages/scikil-image/auto_examples/plot_segment… [cited by applicant]
Adam, “Deep learning, 3D technology to improve structure modeling for protein interactions, create better drugs”, dated Jan. 9, 2020, 4 pages. [cited by applicant]
Adriana Romero et al., FitNets: Hints for Thin Deep Nets, published Mar. 27, 2015, 13 pages. (ILLM 1017-3). [cited by applicant]
Adzhubei, I. A. et al. A method and server for predicting damaging missense mutations. Nat. Methods 7, 248-249 (2010). [cited by applicant]
Aggarwal, Neural Networks and Deep Learning: A Textbook, Springer, dated Aug. 26, 2018, 512 pages. [cited by applicant]
Ahmed, Signet: A Neural Network Architecture for Predicting Protein-Protein Interactions, The University of Western Ontario, dated May 7, 2017, 84 pages. [cited by applicant]
Alberts, Bruce, et al., “Molecular biology of the cell”, Sixth Edition, 2015, 3 pages. [cited by applicant]
Albrecht et. al., Deep learning for single-molecule science, Nanotechnology (28), dated 2017, 423001, 11 pages. (ILLM.1008-21). [cited by applicant]
Alipanahi, et. al., “Predicting the Sequence Specificities of DNA and RNA Binding Proteins by Deep Learning”, Aug. 2015, 9pgs. [cited by applicant]
Amidi et. al., “EnzyNet: enzyme classification using 3D convolutional neural networks on spatial representation”, dated Jul. 25, 2017, 18 pages. [cited by applicant]
Angermueller, Christof, et. al., “Deep learning for computational biology”, Jun. 6, 2016, 16 pages. [cited by applicant]
Angermueller, et. al., “Accurate Prediction of Single Cell DNA Methylation States Using Deep Learning”, Apr. 11, 2017, 13pgs. [cited by applicant]
Anonymous, “Transferrable end-to-end learning for protein interface prediction”, dated 2019, 12 pages. [cited by applicant]
Anonymous, Vanishing Gradient Problem, Wikipedia, dated Jun. 16, 2018, retrieved on Jan. 12, 2020. Retrieved from [URL: hllps://en.wikipedia.org/w/index.php?tille=Vanishing_gradient_problem&oldid=846115335]. [cited by applicant]
Arik et. al., Deep Voice: Real-time Neural Text-to-Speech, 2017. [cited by applicant]
Aritake et. al., “Single-molecule localization by voxel-wise regression using convolutional neural network”, dated Nov. 3, 2020, 11 pages. [cited by applicant]
Arpali et. al., High-throughput screening of large volumes of whole blood using structured illumination and fluorescent on-chip imaging, Lab on a Chip, United Kingdom, Royal Society of Chemistry, Sep. 12, 2012, vol. 12,… [cited by applicant]
Assem, Predicting periodic and chaotic signals using Wavenets, Master of Science thesis, Delft University of Technology, Aug. 18, 2017, pp. 3-38. [cited by applicant]
Assfalg et. al., “3DString, A Feature String Kernel for 3D Object Classification on Voxelized Data”, dated Nov. 6, 2006, 10 pages. [cited by applicant]
Asthana, S., Schmidt, S., & Sunyaev, S. A limited role for balancing selection. Trends Genet. 21, 30-32 (2005). [cited by applicant]
Badrinarayanan et. al., SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation, dated Oct. 10, 2016, 14 pages. [cited by applicant]
Baek el. al., LncRNAnet: long non-coding RNA identification using deep learning, Bioinformatics, vol. 34 (22), 2018, pp. 3889-3897, 9 pages. [cited by applicant]
Bahar, Protein Actions Principles and Modeling, Chapter 7, 2017 pp. 165-166. [cited by applicant]
Bamshad, M. J. et al. Exome sequencing as a tool for Mendelian disease gene discovery. Nat. Rev. Genet. 12, 745-755 (2011). [cited by applicant]
Bazykin, G. A. et al. Extensive parallelism in protein evolution. Biol. Direct 2, 20, 13 pages (2007). [cited by applicant]
Belanovic, Library of Parameterized Hardware Modules for Floating-Point Arithmetic with an Example Application, Northeastern University, Boston, MA, May 2002, 83 pages. [cited by applicant]
Bell, C. J. et al. Comprehensive carrier testing for severe childhood recessive diseases by next generation sequencing Sci. Transl. Med. 3, Jan. 12, 2011, 28 pages. [cited by applicant]
Bentley et. al., Accurate Whole Human Genome Sequencing using Reversible Terminator Chemistry, Nature, Nov. 2008, 21 pages. [cited by applicant]
Bentley et al., Accurate Whole Human Genome Sequencing using Reversible Terminator Chemistry, Supplemental Information, Nature, dated Nov. 6, 2008, 55 pages, [retrieved on Jul. 21, 2021], retrieved from the internet [UR… [cited by applicant]
Bhande, Anup What is underfitting and overfitting in machine learning and how to deal with it, Mar. 11, 2018, 10pages. [cited by applicant]
Bi, Yingtao, et al. “Tree-based position weight matrix approach to model transcription factor binding site profiles.” PloS one6.9 (2011) e24210. [cited by applicant]
Bowen, Nanotechnology for a Genomic Revolution, Illumina, dated Dec. 14, 2016, 40 pages. [cited by applicant]
Boza et. al., Deep Recurrent Neural Networks for Base Calling in MinION Nanopore Reads, dated Mar. 30, 2016, 12 pages. [cited by applicant]
Boza et. al., DeepNano: Deep recurrent neural networks for base calling in MinION nanopore reads, PLOS One, dated Jun. 5, 2017, 13 pages. [cited by applicant]
Brandon, E. P., Idzerda, R. L. & McKnight, G. S. Targeting the mouse genome—a compendium of knockouts {Part II). Curr. Biol. 5, 758-765 (1995). [cited by applicant]
Bravo et. al., Model-Based Quality Assessment and Base-Calling for Second-Generation Sequencing Data, Biometrics, 2009, 10 pages. [cited by applicant]
Brookes, Anthony J., “The essence of SNPs”, 1999, pp. 177-186. [cited by applicant]
Cacho et. al., A comparison of Base Calling Algorithms for Illumina Sequencing Technology, dated Oct. 5, 2015, Briefings in Bioinformatics 2016 (17), 786-795. [cited by applicant]
Cacho, Base-Calling of High-throughput Sequencing Data Using a Random Effects Mixture Model, UC Riverside, Dec. 2016, 102 pages. [cited by applicant]
Carter et al., “Cancer-specific high-throughput annotation of somatic mutations—computational prediction of driver missense mutations,” Cancer research 69, No. 16 (2009) pp. 6660-6667. [cited by applicant]
Carter, H., Douville, C., Stenson, P. D., Cooper, D. N., & Karchin, R. Identifying Mendelian disease genes with the variant effect scoring tool. BMC Genom, (2013), 13 pages. [cited by applicant]
Chang, Chia-Yun, et al. “Oversampling to overcome overfitting—exploring the relationship between data set composition, molecular descriptors, and predictive modeling methods.” Journal of chemical information and modelin… [cited by applicant]
Chen et. al., Rethinking atrous convolution for semantic image segmentation, 2017. [cited by applicant]
Chen, Kathleen M., et. al., “Selene—a Py Torch based deep learning library for sequence level data”, Oct. 10, 2018, 15pages. [cited by applicant]
Chimpanzee Sequencing Analysis Consortium. Initial sequence of the chimpanzee genome and comparison with the human genome. Nature 437, 69-87(2 005). [cited by applicant]
Ching, et. al., “Opportunities and Obstacles for Deep Learning in Biology and Medicine”, Jan. 19, 2018, 123pgs. [cited by applicant]
Ching, et. al., “Opportunities and Obstacles for Deep Learning in Biology and Medicine”, May 26, 2017, 47pgs. [cited by applicant]
Choi, Y., Sims, G. E., Murphy, S., Miller, J. R., & Chan, A. P. Predicting the functional effect of amino acid substitutions and indels. PLoS One 7, e46688 (2012). [cited by applicant]
Chollet, Xception: Deep Learning with Depthwise Separable Convolutions, in Proc. of CVPR, 2017. 8 pages. [cited by applicant]
Chun, S. & Fay, J. C. Identification of deleterious mutations within three human genomes. Genome Res. 19, 1553-1561 (2009). [cited by applicant]
Das et. al., Model-based sequential base calling for Illumina sequencing, IEEE, 2010, 4 pages. [cited by applicant]
Dash et. al., Artificial Intelligence and Evolutionary Computations in Engineering Systems, Advances in Intelligent Systems and Computing, vol. 1056, Springer 2020, 781 pages. [cited by applicant]
Datta et. al., Statistical Analyses of Next Generation Sequence Data: A Partial Overview, Journal of Proteomics and Bioinformatics, vol. 3, Issue 6, 2010, 8 pages. [cited by applicant]
Davydov, E. V. et al. Identifying a high fraction of the human genome to be under selective constraint using Gerp++ PLoS Comput. Biol. 6, Dec. 2, 2010, 13 pages. [cited by applicant]
DbSNP rs2241788 [Retrieved on Mar. 13, 2019], Retrieved from the Internet<www.ncbi.nlm.nih.gov/snp/rs2241788>, 5 pages. [cited by applicant]
De Ligt, J. et al. Diagnostic exome sequencing in persons with severe intellectual disability. N. Engl. J. Med. 367, 1921-1929 (2012). [cited by applicant]
De Manuel, M. et al. Chimpanzee genomic diversity reveals ancient admixture with bonobos. Science 354, 477-481 (2016). [cited by applicant]
De Rubeis, S. et al. Synaptic, transcriptional and chromatin genes disrupted in autism. Nature 515, 209-215 (2014). [cited by applicant]
Deciphering Developmental Disorders Study. Large-scale discovery of novel genetic causes of developmental disorders. Nature 519, 223-228 (2015). [cited by applicant]
Deciphering Developmental Disorders Study. Prevalence and architecture of de nova mutations in developmental disorders. Nature 542, 433-438 (2017). [cited by applicant]
Deepa J, Development of Fully Automated Image Analysis Method for High Density cDNA and array CGH Microarray based genomic studies, Cochin University of Science and Technology, Mar. 2013, 232 pages. [cited by applicant]
Despois, Julien, “Memorizing is not learning!—6 tricks to prevent overfilling in machine learning”, Mar. 20, 2018, 17 pages. [cited by applicant]
Dias et. al., “Artificial intelligence in clinical and genomic diagnostics”, dated 2019, 12 pages. [cited by applicant]
Dong, C. et al. Comparison and integration of deleteriousness prediction methods for nonsynonymous SNVs in whole exome sequencing studies. Hum. Mol. Genet. 24, 2125-2137 (2015). [cited by applicant]
Duggirala, Ravindranalh, et.al., “Genome Mapping and Genomics in Human and Non Human Primate”, 2015, 306pgs. [cited by applicant]
Dunbrack, Roland L., Re Question about your Paper titled “The Role of Balanced Training and Testing Data Sets for Binary Classifiers in Bioinformatics”, Message to Sikander Mohammed Khan, Feb. 3, 2019, E-mailm, 3pgs. [cited by applicant]
Epi, K. C. et al. De novo mutations in epileptic encephalopathies. Nature 501, 217-221 (2013). [cited by applicant]
Eraslan et. al., “Deep Learning: New computational modelling techniques for genomics”, dated Jul. 2019, 15 pages. [cited by applicant]
Erlich et. al., Alta-Cyclic: a self-optimizing base-caller for next generation sequencing, Nature Methods, Aug. 2008, 7 pages. [cited by applicant]
Estrada, A. et al. Impending extinction crisis of the world's primates—why primates matter. Sc. Adv. 3, e1600946 (2017), 17 pages. [cited by applicant]
EuroEPINOMICS-RES Consortium, Epilepsy Phenome/Genome Project, Epi4K Consortium. De novo mutations in synaptic transmission genes including DNM1 cause epileptic encephalopathies. Am. J. Hum. Genet. 95, 360-370 (2014). [cited by applicant]
Evans et. al., Estimating Change-Points in Biological Sequences via the Cross-Entropy Method, dated Sep. 20, 2010, 17 pages. [cited by applicant]
Famiglielli, M. L. et al. Genetic variations and diseases in UniProtKB Swiss-Prot—the ins and outs of expert manual curation. Human. Mutat. 35, 927-935 (2014). [cited by applicant]
Forghani et al., Convolutional Neural Network Based Approach to In Silica Non-Anticipating Prediction of Antigenic Distance for Influenza Virus, Viruses, published Sep. 12, 2020, vol. 12, 20 pages. [cited by applicant]
Fritzilas, An Overview of Illumina's Sequencing Technology and its Applications, University of Primorska, dated Mar. 4, 2011, 47 pages. [cited by applicant]
Gao et al., Deep Learning in Protein Structural Modeling and Design, Patterns—CelPress, dated Dec. 11, 2020, 13 pages. [cited by applicant]
Gao, Tingting, et al. “Identifying translation initiation sites in prokaryotes using support vector machine.” Journal of theoretical biology 262.4 (2010) 644-649. {Year 2010). [cited by applicant]
Geeks for Geeks, “Underfitting and Overfilling in Machine Learning”, [retrieved on Aug. 26, 2019]. Retrieved from the internet <www.geeksforgeeks.org/underfilling-and-overfitting-in-machine--learning/>, 2 pages. [cited by applicant]
Genomes Project Consortium. et al. A global reference for human genetic variation. Nature 526, 68-74 (2015). [cited by applicant]
Gilissen, C. et al. Genome sequencing identifies major causes of severe intellectual disability. Nature 511, 344-347 (2014). [cited by applicant]
Goodfellow et. al., Convolutional Networks, Deep Learning, MIT Press, 2016. [cited by applicant]
Grange, NGS: the basics, Institut Jacques Monad, 59 pages. [cited by applicant]
Grantham, R. Amino acid difference formula to help explain protein evolution. Science 185, 862-864 (1974). [cited by applicant]
Grimm, D. G. The evaluation of tools used to predict the impact of missense variants is hindered by two types of circularity. Human. Mutat. 36, 513-523 (2015). [cited by applicant]
Grob, C., et. al., “Predicting variant deleteriousness in non human species Applying the GADD approach in mouse”, 2018, 11 pages. [cited by applicant]
Gu, et. al., “Recent Advances in Convolutional Neural Networks”, Jan. 5, 2017, 37pgs. [cited by applicant]
Gulko, B., Hubisz, M. J., Gronau, I., & Siepel, A. A method for calculating probabilities of fitness consequences for point mutations across the human genome. Nat. Genet. 47, 276-283 (2015). [cited by applicant]
Hacteria Wiki, HiSeq2000—Next Level Hacking—Hackteria Wiki, retrieved on Apr. 12, 2021, retrieved from the internet URL: https://www.hackteria.org/wiki/HiSeq2000_-_Next_Level_Hacking], 42 pages. [cited by applicant]
Han, Deconvolutions in Convolutional Neural Networks, Postech Computer Vision Lab, 2015, 20 pages. [cited by applicant]
Harpak, A., Bhaskar, A., & Pritchard, J. K. Mutation rate variation is a primary determinant of the distribution of allele frequencies in humans. PLoS Genet. Dec. 15, 2016, 22pgs. [cited by applicant]
He et. al., Deep Residual Learning for Image Recognition, 2015. [cited by applicant]
He et. al., Deep Residual Learning for Image Recognition, in Proc. of CVPR, 2016. [cited by applicant]
He, K, Zhang, X., Ren, S., & Sun, J. Identity mappings in deep residual networks. in 14th European Conference on Computer Vision—ECCV 2016. ECCV 2016. Lecture Notes in Computer Science, vol. 9908; 630 6, 15 (Springer, C… [cited by applicant]
Hedegaard, An introduction to “Next Generation” DNA Sequencing, dated Nov. 26, 2017, 63 pages. [cited by applicant]
Hefferman, R. et al. Improving prediction of secondary structure, local backbone angles, and solvent accessible surface area of proteins by iterative deep learning. Sci. Rep. 5, 11476 (2015) 11 pages. [cited by applicant]
Henikoff, S. & Henikoff, J.G. Amino acid substitution matrices from protein blocks. Proc. Nall. Acad. Sci. USA 89, 10915-10919 (1992). [cited by applicant]
Horaitis, 0., Talbot, C. C.Jr., Phommarinh, M., Phillips, K. M., & Cotton, R. G. A database of locus-specific databases. Nat. Genet. 39, 425 (2007). [cited by applicant]
Howard et. al., Mobilenets: Efficient Convolutional Neural Networks for Mobile Vision Applications, 2017. [cited by applicant]
Huang et. al., Densely Connected Convolutional Networks, 2017. [cited by applicant]
Huang et. al., Speed/accuracy trade-offs for modern convolutional detectors, 2016. [cited by applicant]
Illumina CMOS Chip and One-Channel SBS Chemistry, Illumina Inc, 2018, 4 pages. [cited by applicant]
Illumina, “Indexed Sequencing Overview Guide”, Document No. 15057455, v. 5, Mar. 2019 {ILLM 1015-1). [cited by applicant]
Illumina, An Introduction to Next-Generation Sequencing Technology, 2017, 16 pages. [cited by applicant]
Illumina, Calculating Percent Passing Filter for Patterned and Non patterned Flow Cells, 2017, 2 pages. [cited by applicant]
Illumina, GA Bootcamp, Sequencing Module 3: Overview, Broad Institute, 73 pages. [cited by applicant]
Illumina, HCS 1.4/RTA 1.12 Theory of Operation, 2010, 32 pages. [cited by applicant]
Illumina, Illumina's Genotyping Data Normalization Methods, 2006, 6 pages. [cited by applicant]
Illumina, Low-diversity sequencing on the Illumina HiSeq Platform, 2014, 2 pages. [cited by applicant]
Illumina, Optimizing Cluster Density on Illumina Sequencing Systems, 2016, 12 pages. [cited by applicant]
Illumina, Quality Score Encoding, 2 pages, retrieved on Jul. 23, 2021. Retrieved from [URL: hllps://support.illumina.com/help/BaseSpace_OLH_009008/Contenl/Source/Informatics/BS/QualityScoreEncoding_swBS.htm]. [cited by applicant]
Illumina, Quality Scores for Next-Generation Sequencing—Assessing sequencing accuracy using Phred quality scoring 2011, 2 pages. [cited by applicant]
Illumina, Reducing Whole-Genome Data Storage Footprint, Illumina Whitepaper, 2010-2014, 4 pages. [cited by applicant]
Illumina, RTA Theory of Operation, 2009, 8 pages. [cited by applicant]
Illumina, Two-Channel SBS Sequencing Technology, 2016, 2 pages. [cited by applicant]
Illumina, Understanding Illumina Quality Scores, dated Apr. 23, 2014, 2 pages. [cited by applicant]
Ioannidis, Nilah M., et al., “REVEL—An Ensemble Method for Predicting the Pathogenicity of Rare Missense Variants”, Oct. 5, 2016, 9 pages. [cited by applicant]
Ioffe et. al., Batch Normalization Accelerating Deep Network Training by Reducing Internal Covariate Shift, 2015. [cited by applicant]
Ionita-Laza, I., Mccallum, K., Xu, B., & Buxbaum, J.D. A spectral approach integrating functional genomic annotations or coding and noncoding variants. Nat. Genet. 48, 214-220 (2016). [cited by applicant]
Iossifov, I. et al. De novo gene disruptions in children on the autistic spectrum. Neuron 74, 285-299 (2012). [cited by applicant]
Iossifov, I. et al. The contribution of de novo coding mutations to autism spectrum disorder. Nature 515, 216-221 (2014). [cited by applicant]
Iqbal et al., Comprehensive characterization of amino acid positions in protein structures reveals molecular effects of missense variants, and supplemental information, PNAS, vol. 117, No. 45, dated Nov. 10, 2020, 35 pa… [cited by applicant]
Jagadeesh, K. A. et al. M-CAP eliminates a majority of variants of uncertain significance in clinical exomes at high sensitivity. Nat. Genet. 48, 1581-1586 (2016). [cited by applicant]
Jaganathan, K. et. al., “Predicting splicing from primary sequence with deep learning”, Cell 176, 535-548, (2019). [cited by applicant]
Jain, S., While, M., Radivojac, P. Recovering true classifier performance in positive-unlabeled learning. in Proceedings Thirty-First AAAI Conference on Artificial Intelligence. 2066-2072 (AAAI Press, San Francisco; 201… [cited by applicant]
James Le, How to do Semantic Segmentation using Deep Learning, dated May 3, 2018, 17 pages, retrieved on Jul. 21, 2021. Retrieved from [URL: hllps://medium.com/nanonets/how-to-do-image-segmentation-using-deep-learning- … [cited by applicant]
Jiminez et. al., DeepSite—protein binding site predictor using 3D CNNs, dated Oct. 1, 2017, 7 pages. [cited by applicant]
Jing et al., Learning from protein structure with geometric vector perceptrons, Arxiv: 2009: 01411v2, dated Dec. 31, 2020, 18 pages. [cited by applicant]
Joosten, R. P. et al. A series of PDB related databases for everyday needs. Nucleic Acids Res. 39, 411-419 (2011). [cited by applicant]
Jordan, An overview of semantic image segmentation, dated May 21, 2018, 28 pages retrieved on Jul. 21, 2021. Retrieved from the internet [URL: https://www.jeremyjordan.me/semantic-segmentation/ ]. [cited by applicant]
Kabsch, W., & Sander, C. Dictionary of protein secondary structure—pattern recognition of hydrogen-bonded and geometrical features. Biopolymers 22, 2577-2637 (1983). [cited by applicant]
Kao et. al., Algorithms for Next-Generation High-Throughput Sequencing Technologies, University of California, Berkeley, 2011, 106 pages. [cited by applicant]
Kao et. al., BayesCall: A model-based base-calling algorithm for high-throughput short-read sequencing, Genome Research (19), pp. 1884-1895, dated 2009. [cited by applicant]
Kao et. al., naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing, Journal of Computational Biology, dated Mar. 2011, 16 pages. [cited by applicant]