IP Library › Granted Patent US 12,482,535
Granted Patent B2
US 12,482,535 · App. 17/670,380 · Granted Nov 25, 2025

Systems and methods for detecting recombination

Inventor: Devin Locke (Medford, MA)
Assignee: Seven Bridges Genomics Inc.
G16B20/20G16B20/00G16B30/00G16B30/10G16H50/50
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,482,535
App. No.
17/670,380
Granted
Nov 25, 2025
Kind
B2
Abstract

A method for screening for disease in a genomic sample is includes receiving a representation of a reference genome comprising a sequence of symbols. The presence of a predicted mutational event is identified in a location of the reference genome. An alternate path is created in the reference genome representing the predicted mutational event. A plurality of sequence reads are obtained from a genomic sample, wherein at least one sequence read comprises at least a portion of the predicted mutational event. The at least one sequence read is then mapped to the reference genome and a location is determined corresponding to the predicted mutational event. The predicted mutational event is then identified as present in the genomic sample. The method may be used to detect evidence of non-allelic homologous recombination (NAHR) occurring in genomic samples.

Claims (45)

1 . A method of screening for disease in a genomic sample, the method comprising:

using at least one computer hardware processor to perform:

accessing a reference genome from at least one non-transitory computer-readable storage medium, the reference genome comprising a plurality of nodes and edges, wherein the plurality of nodes and edges is stored as a plurality of objects in the at least one non-transitory computer-readable storage medium, each of at least some of the plurality of objects comprising one or more pointers to one or more objects representing other nodes;

identifying a predicted mutational event at a location in the reference genome at least in part by identifying, using the plurality of objects stored in the at least one non-transitory computer-readable storage medium, segments of the reference genome representing nucleotide sequences that are homologous to each other;

modifying the reference genome to include a new object representing the predicted mutational event, the modifying comprising storing the new object in the at least one non-transitory computer-readable storage medium, wherein the new object comprises a pointer representing a link between the new object and an object among the plurality of objects, the modifying comprising:

segmenting the reference genome at the location of the predicted mutational event, the segmented reference genome comprising at least two segments; and

modifying the segmented reference genome to include the new object connecting two segments of the at least two segments, the new object specifying at least part of a new path through the reference genome and indicating a nucleotide sequence that results from the predicted mutational event; and

aligning at least one sequence read of a plurality of sequence reads to the modified reference genome to determine whether the predicted mutational event is present in the genomic sample, the aligning comprising aligning the at least one sequence read to the modified reference genome using the plurality of objects representing the plurality of nodes and the new object.

2 . The method of claim 1 ,

wherein the at least two segments comprise a first segment, a second segment, and a third segment, the second segment being positioned between the first segment and the third segment, and

wherein modifying the segmented reference genome to include the new object connecting the two segments of the at least two segments comprises modifying the segmented reference genome to include the new object connecting the first segment and the third segment.

3 . The method of claim 2 , wherein the first segment and the third segment represent nucleotide sequences that are homologous to each other.

4 . The method of claim 2 , wherein the second segment represents a nucleotide sequence of between 5 kilobases and 100 kilobases.

5 . The method of claim 2 , wherein the new object comprises a first new object, the method further comprising:

modifying the reference genome at least in part by:

storing a second new object in the at least one non-transitory computer-readable storage medium, the second new object connecting the first segment and the second segment, and

storing a third new object in the at least one non-transitory computer-readable storage medium, the third new object connecting the second segment and the third segment.

6 . The method of claim 1 , wherein the new object represents a deletion of a nucleotide sequence represented by a segment of the at least two segments.

7 . The method of claim 1 , wherein the new object represents a structural variant at the location in the reference genome.

8 . The method of claim 1 , wherein the new object represents a recombination event at the location in the reference genome.

9 . The method of claim 1 , wherein identifying the predicted mutational event at the location in the reference genome comprises accessing information indicative of the predicted mutational event.

10 . The method of claim 1 , wherein the predicted mutational event is associated with a medical condition.

11 . The method of claim 1 , wherein the reference genome comprises a directed acyclic graph (DAG).

12 . The method of claim 1 , wherein two objects of the plurality of objects represent the two segments of the at least two segments.

13 . The method of claim 12 , wherein the pointer to the object is a pointer to one of the two objects representing one of the two segments of the at least two segments.

14 . The method of claim 13 , wherein the pointer is a pointer stored in a list of pointers in the new object and is a pointer to a physical location in the at least one non-transitory computer-readable storage medium at which the object of the two objects is stored.

15 . The method of claim 1 , wherein a first object in the plurality of objects stores a list of pointers specifying one or more locations in the at least one non-transitory computer-readable storage medium at which at least one other object in the plurality of objects is stored, wherein the at least one other object is adjacent to the first object in the reference genome.

16 . The method of claim 1 , further comprising outputting a report indicative of results of determining that the predicted mutational event is present in the genomic sample.

17 . The method of claim 16 , wherein the report indicates a medical condition associated with the predicted mutational event.

18 . A system, comprising:

at least one computer hardware processor; and

at least one non-transitory computer-readable storage medium storing processor executable instructions that, when executed by the at least one computer hardware processor, causes the at least one computer hardware processor to perform a method of screening for disease in a genomic sample, the method comprising:

accessing a reference genome from the at least one non-transitory computer-readable storage medium, the reference genome comprising a plurality of nodes and edges, wherein the plurality of nodes and edges is stored as a plurality of objects in the at least one non-transitory computer-readable storage medium, each of at least some of the plurality of objects comprising one or more pointers to one or more objects representing other nodes;

identifying a predicted mutational event at a location in the reference genome at least in part by identifying, using the plurality of objects stored in the at least one non-transitory computer-readable storage medium, segments of the reference genome representing nucleotide sequences that are homologous to each other;

modifying the reference genome to include a new object representing the predicted mutational event, the modifying comprising storing the new object in the at least one non-transitory computer-readable storage medium, wherein the new object comprises a pointer representing a link between the new object and an object among the plurality of objects, the modifying comprising:

segmenting the reference genome at the location of the predicted mutational event, the segmented reference genome comprising at least two segments; and

modifying the segmented reference genome to include the new object connecting two segments of the at least two segments, the new object specifying at least part of a new path through the reference genome and indicating a nucleotide sequence that results from the predicted mutational event; and

aligning at least one sequence read of a plurality of sequence reads to the modified reference genome to determine whether the predicted mutational event is present in the genomic sample, the aligning comprising aligning the at least one sequence read to the modified reference genome using the plurality of objects representing the plurality of nodes and the new object.

19 . At least one non-transitory computer-readable storage medium storing processor executable instructions that, when executed by at least one computer hardware processor, cause the at least one computer hardware processor to perform a method of screening for disease in a genomic sample, the method comprising:

accessing a reference genome from the at least one non-transitory computer-readable storage medium, the reference genome comprising a plurality of nodes and edges, wherein the plurality of nodes and edges is stored as a plurality of objects in the at least one non-transitory computer-readable storage medium, each of at least some of the plurality of objects comprising one or more pointers to one or more objects representing other nodes;

identifying a predicted mutational event at a location in the reference genome at least in part by identifying, using the plurality of objects stored in the at least one non-transitory computer-readable storage medium, segments of the reference genome representing nucleotide sequences that are homologous to each other;

modifying the reference genome to include a new object representing the predicted mutational event, the modifying comprising storing the new object in the at least one non-transitory computer-readable storage medium, wherein the new object comprises a pointer representing a link between the new object and an object among the plurality of objects, the modifying comprising:

segmenting the reference genome at the location of the predicted mutational event, the segmented reference genome comprising at least two segments; and

modifying the segmented reference genome to include the new object connecting two segments of the at least two segments, the new object specifying at least part of a new path through the reference genome and indicating a nucleotide sequence that results from the predicted mutational event; and

aligning at least one sequence read of a plurality of sequence reads to the modified reference genome to determine whether the predicted mutational event is present in the genomic sample, the aligning comprising aligning the at least one sequence read to the modified reference genome using the plurality of objects representing the plurality of nodes and the new object.

Assignments (2)
SECURITY INTEREST Recorded Aug 4, 2022
From: PIERIANDX, INC.; SEVEN BRIDGES GENOMICS INC.
To: ORBIMED ROYALTY & CREDIT OPPORTUNITIES III, LP
Reel/Frame 061084/0786 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 28, 2022
From: LOCKE, DEVIN
To: SEVEN BRIDGES GENOMICS INC.
Reel/Frame 059757/0671 →
Continuity (2)
Division 15254258 · Sep 1, 2016
Related Publication 20220254444A1 · Aug 11, 2022
References Cited (400)
US 4683195A · Mullis et al. · 1987 [cited by applicant]
US 4683202A · Mullis · 1987 [cited by applicant]
US 4988617A · Landegren et al. · 1991 [cited by applicant]
US 5234809A · Boom et al. · 1993 [cited by applicant]
US 5242794A · Whiteley et al. · 1993 [cited by applicant]
US 5494810A · Barany et al. · 1996 [cited by applicant]
US 5511158A · Sims · 1996 [cited by applicant]
US 5583024A · McElroy · 1996 [cited by applicant]
US 5674713A · McElroy · 1997 [cited by applicant]
US 5700673A · McElroy · 1997 [cited by applicant]
US 5701256A · Marr et al. · 1997 [cited by applicant]
US 6054278A · Dodge et al. · 2000 [cited by applicant]
US 6210891B1 · Nyren et al. · 2001 [cited by applicant]
US 6223128B1 · Allex et al. · 2001 [cited by applicant]
US 6306597B1 · Macevicz · 2001 [cited by applicant]
US 6582938B1 · Su et al. · 2003 [cited by applicant]
US 6818395B1 · Quake et al. · 2004 [cited by applicant]
US 6828100B1 · Ronaghi · 2004 [cited by applicant]
US 6833246B2 · Balasubramanian · 2004 [cited by applicant]
US 6890763B2 · Jackowski et al. · 2005 [cited by applicant]
US 6911345B2 · Quake et al. · 2005 [cited by applicant]
US 6925389B2 · Hitt et al. · 2005 [cited by applicant]
US 6989100B2 · Norton · 2006 [cited by applicant]
US 7169560B2 · Lapidus et al. · 2007 [cited by applicant]
US 7232656B2 · Balasubramanian et al. · 2007 [cited by applicant]
US 7282337B1 · Harris · 2007 [cited by applicant]
US 7321623B2 · Dambrackas · 2008 [cited by applicant]
US 7483585B2 · Brakus, Jr. · 2009 [cited by applicant]
US 7577554B2 · Lystad et al. · 2009 [cited by applicant]
US 7580918B2 · Chang et al. · 2009 [cited by applicant]
US 7598035B2 · Macevicz · 2009 [cited by applicant]
US 7620800B2 · Huppenthal et al. · 2009 [cited by applicant]
US 7776616B2 · Heath et al. · 2010 [cited by applicant]
US 7809509B2 · Milosavljevic · 2010 [cited by applicant]
US 7835871B2 · Kain et al. · 2010 [cited by applicant]
US 7885840B2 · Sadiq et al. · 2011 [cited by applicant]
US 7917302B2 · Rognes · 2011 [cited by applicant]
US 7957913B2 · Chinitz et al. · 2011 [cited by applicant]
US 7960120B2 · Rigatti et al. · 2011 [cited by applicant]
US 8146099B2 · Tkatch et al. · 2012 [cited by applicant]
US 8165821B2 · Zhang · 2012 [cited by applicant]
US 8209130B1 · Kennedy et al. · 2012 [cited by applicant]
US 8340914B2 · Gatewood et al. · 2012 [cited by applicant]
US 8370079B2 · Sorenson et al. · 2013 [cited by applicant]
US 8639847B2 · Blaszczak et al. · 2014 [cited by applicant]
US 8972201B2 · Mande et al. · 2015 [cited by applicant]
US 9063914B2 · Kural et al. · 2015 [cited by applicant]
US 9092402B2 · Kural et al. · 2015 [cited by applicant]
US 9116866B2 · Kural · 2015 [cited by applicant]
US 9390226B2 · Kural · 2016 [cited by applicant]
US 9817944B2 · Kural · 2017 [cited by applicant]
US 10364468B2 · Lee · 2019 [cited by examiner]
US 10584380B2 · Locke · 2020 [cited by examiner]
US 10724110B2 · Locke · 2020 [cited by examiner]
US 10793895B2 · Locke · 2020 [cited by examiner]
US 11250931B2 · Locke · 2022 [cited by examiner]
US 20020164629A1 · Quake et al. · 2002 [cited by applicant]
US 20020190663A1 · Rasmussen · 2002 [cited by applicant]
US 20040023209A1 · Jonasson · 2004 [cited by applicant]
US 20050089906A1 · Furuta et al. · 2005 [cited by applicant]
US 20060024681A1 · Smith et al. · 2006 [cited by applicant]
US 20060195269A1 · Yeatman et al. · 2006 [cited by applicant]
US 20060292611A1 · Berka et al. · 2006 [cited by applicant]
US 20070114362A1 · Feng et al. · 2007 [cited by applicant]
US 20070166707A1 · Schadt et al. · 2007 [cited by applicant]
US 20080003571A1 · McKernan et al. · 2008 [cited by applicant]
US 20080077607A1 · Gatawood et al. · 2008 [cited by applicant]
US 20080251711A1 · Reilly · 2008 [cited by applicant]
US 20080281463A1 · Suh et al. · 2008 [cited by applicant]
US 20080294403A1 · Zhu et al. · 2008 [cited by applicant]
US 20090026082A1 · Rothberg et al. · 2009 [cited by applicant]
US 20090119313A1 · Pearce · 2009 [cited by applicant]
US 20090127589A1 · Rothberg et al. · 2009 [cited by applicant]
US 20090164135A1 · Brodzik et al. · 2009 [cited by applicant]
US 20090191565A1 · Lapidus et al. · 2009 [cited by applicant]
US 20090233809A1 · Faham et al. · 2009 [cited by applicant]
US 20090300781A1 · Bancroft et al. · 2009 [cited by applicant]
US 20090318310A1 · Liu et al. · 2009 [cited by applicant]
US 20090325145A1 · Sablon et al. · 2009 [cited by applicant]
US 20100010992A1 · Morris · 2010 [cited by applicant]
US 20100035252A1 · Rothberg et al. · 2010 [cited by applicant]
US 20100041048A1 · Diehl et al. · 2010 [cited by applicant]
US 20100137143A1 · Rothberg et al. · 2010 [cited by applicant]
US 20100169026A1 · Sorenson et al. · 2010 [cited by applicant]
US 20100188073A1 · Rothberg et al. · 2010 [cited by applicant]
US 20100197507A1 · Rothberg et al. · 2010 [cited by applicant]
US 20100240046A1 · Palmer et al. · 2010 [cited by applicant]
US 20100282617A1 · Rothberg et al. · 2010 [cited by applicant]
US 20100285578A1 · Selden et al. · 2010 [cited by applicant]
US 20100300559A1 · Schultz et al. · 2010 [cited by applicant]
US 20100300895A1 · Nobile et al. · 2010 [cited by applicant]
US 20100301398A1 · Rothberg et al. · 2010 [cited by applicant]
US 20100304982A1 · Hinz et al. · 2010 [cited by applicant]
US 20110004413A1 · Carnevali et al. · 2011 [cited by applicant]
US 20110009278A1 · Kain et al. · 2011 [cited by applicant]
US 20110098193A1 · Kingsmore et al. · 2011 [cited by applicant]
US 20110207135A1 · Faham et al. · 2011 [cited by applicant]
US 20110257889A1 · Klammer et al. · 2011 [cited by applicant]
US 20120030566A1 · Victor · 2012 [cited by applicant]
US 20120040851A1 · Lieberman et al. · 2012 [cited by applicant]
US 20120041727A1 · Mishra et al. · 2012 [cited by applicant]
US 20120045771A1 · Beier et al. · 2012 [cited by applicant]
US 20120157322A1 · Myllykangas et al. · 2012 [cited by applicant]
US 20120239706A1 · Steinfadt · 2012 [cited by applicant]
US 20120330566A1 · Chaisson · 2012 [cited by applicant]
US 20130029879A1 · Shetty et al. · 2013 [cited by applicant]
US 20130035904A1 · Kuhn · 2013 [cited by applicant]
US 20130059738A1 · Leamon et al. · 2013 [cited by applicant]
US 20130059740A1 · Drmanac et al. · 2013 [cited by applicant]
US 20130073214A1 · Hyland et al. · 2013 [cited by applicant]
US 20130124100A1 · Drmanac et al. · 2013 [cited by applicant]
US 20130124573A1 · Seth et al. · 2013 [cited by applicant]
US 20130232480A1 · Winterfeldt et al. · 2013 [cited by applicant]
US 20130289099A1 · Goff et al. · 2013 [cited by applicant]
US 20130311106A1 · White et al. · 2013 [cited by applicant]
US 20130332081A1 · Reese et al. · 2013 [cited by applicant]
US 20130345066A1 · Brinza et al. · 2013 [cited by applicant]
US 20140012866A1 · Bowman et al. · 2014 [cited by applicant]
US 20140025312A1 · Chin et al. · 2014 [cited by applicant]
US 20140051588A9 · Drmanac et al. · 2014 [cited by applicant]
US 20140066317A1 · Talasaz · 2014 [cited by applicant]
US 20140129201A1 · Kennedy et al. · 2014 [cited by applicant]
US 20140136120A1 · Colwell et al. · 2014 [cited by applicant]
US 20140200147A1 · Bartha et al. · 2014 [cited by applicant]
US 20140278590A1 · Abbassi et al. · 2014 [cited by applicant]
US 20140280360A1 · Webber et al. · 2014 [cited by applicant]
US 20140281708A1 · Adam et al. · 2014 [cited by applicant]
US 20140323320A1 · Jia et al. · 2014 [cited by applicant]
US 20150020061A1 · Ravi · 2015 [cited by applicant]
US 20150056613A1 · Kural · 2015 [cited by applicant]
US 20150057946A1 · Kural · 2015 [cited by applicant]
US 20150066383A1 · Wernicke · 2015 [cited by applicant]
US 20150094212A1 · Gottimukkala et al. · 2015 [cited by applicant]
US 20150110754A1 · Bai et al. · 2015 [cited by applicant]
US 20150112602A1 · Kural et al. · 2015 [cited by applicant]
US 20150112658A1 · Kural et al. · 2015 [cited by applicant]
US 20150197815A1 · Kural · 2015 [cited by applicant]
US 20150199472A1 · Kural · 2015 [cited by applicant]
US 20150199473A1 · Kural · 2015 [cited by applicant]
US 20150199474A1 · Kural · 2015 [cited by applicant]
US 20150199475A1 · Kural · 2015 [cited by applicant]
US 20150227685A1 · Kural · 2015 [cited by examiner]
US 20150293994A1 · Kelly et al. · 2015 [cited by applicant]
US 20150302145A1 · Kural et al. · 2015 [cited by applicant]
US 20150310167A1 · Kural et al. · 2015 [cited by applicant]
US 20150344970A1 · Vogelstein et al. · 2015 [cited by applicant]
US 20150347678A1 · Kural · 2015 [cited by applicant]
US 20150356147A1 · Mishra et al. · 2015 [cited by applicant]
US 20160259880A1 · Semenyuk · 2016 [cited by applicant]
US 20160306921A1 · Kural · 2016 [cited by applicant]
US 20160364523A1 · Locke et al. · 2016 [cited by applicant]
US 20170058320A1 · Locke et al. · 2017 [cited by applicant]
US 20170058341A1 · Locke et al. · 2017 [cited by applicant]
US 20170058365A1 · Locke et al. · 2017 [cited by applicant]
US 20170198351A1 · Lee et al. · 2017 [cited by applicant]
US 20170199959A1 · Locke · 2017 [cited by applicant]
US 20170199960A1 · Ghose et al. · 2017 [cited by applicant]
US 20170242958A1 · Brown · 2017 [cited by applicant]
US 20180060480A1 · Locke · 2018 [cited by applicant]
KR 101282798 · 2013 [cited by applicant]
WO WO2007086935A1 · 2007 [cited by applicant]
WO WO2010010992A1 · 2010 [cited by applicant]
WO WO2012096579A1 · 2012 [cited by applicant]
WO WO2012098515A1 · 2012 [cited by applicant]
WO WO2012142531A1 · 2012 [cited by applicant]
WO WO2013035904A1 · 2013 [cited by applicant]
WO WO2013043909A1 · 2013 [cited by applicant]
WO WO2013106737A1 · 2013 [cited by applicant]
WO WO2013184643A1 · 2013 [cited by applicant]
WO WO2015027050A1 · 2015 [cited by applicant]
WO WO2015048753A1 · 2015 [cited by applicant]
WO WO2015058093A1 · 2015 [cited by applicant]
WO WO2015058095A1 · 2015 [cited by applicant]
WO WO2015058097A1 · 2015 [cited by applicant]
WO WO2015058120A1 · 2015 [cited by applicant]
WO WO2015061099A1 · 2015 [cited by applicant]
WO WO2015061103A1 · 2015 [cited by applicant]
WO WO2015105963A1 · 2015 [cited by applicant]
WO WO2015123269A1 · 2015 [cited by applicant]
WO WO2016141294A1 · 2016 [cited by applicant]
WO WO2016201215A1 · 2016 [cited by applicant]
WO WO2017120128A1 · 2017 [cited by applicant]
WO WO2017123864A1 · 2017 [cited by applicant]
WO WO2017147124A1 · 2017 [cited by applicant]
Communication pursuant to Article 94(3) EPC dated Apr. 21, 2017 for European Application No. 14803268.3. [cited by applicant]
Extended European Search Report for European Application No. 14837955.5 dated Mar. 29, 2017. [cited by applicant]
Extended European Search Report for European Application No. 14847490.1 dated May 9, 2017. [cited by applicant]
Extended European Search Report for European Application No. 14854801.9 dated Apr. 12, 2017. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2014/052065 mailed Feb. 23, 2016. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/060680 mailed Jan. 27, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/060690 mailed Feb. 10, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/061156 mailed Feb. 17, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/061158 mailed Feb. 4, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/061162 mailed Mar. 19, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/061198 mailed Feb. 4, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/152065 mailed Dec. 11, 2014. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/158328 mailed Dec. 30, 2014. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2014/58328 mailed Dec. 30, 2014. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2015/010604 mailed Mar. 31, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2015/015375 mailed May 11, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2015/048891 mailed Nov. 17, 2015. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2016/020899 mailed May 5, 2016. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2016/033201 mailed Sep. 2, 2016. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2016/036873 mailed Sep. 7, 2016. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2016/57324 mailed Jan. 10, 2017. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2017/012015 mailed Apr. 19, 2017. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2017/018830 mailed Aug. 31, 2017. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2017/13329 mailed Apr. 7, 2017. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2015/054461 mailed Jan. 5, 2016. [cited by applicant]
Written Opinion for Singapore Application No. 11201601124Y dated Dec. 21, 2016. [cited by applicant]
Written Opinion for Singapore Application No. 11201601124Y dated Mar. 1, 2018. [cited by applicant]
Written Opinion for Singapore Application No. 11201602903X dated May 29, 2017. [cited by applicant]
Written Opinion for Singapore Application No. 11201603039P dated Jun. 12, 2017. [cited by applicant]
Written Opinion for Singapore Application No. 11201603044S dated Jul. 10, 2017. [cited by applicant]
Written Opinion for Singapore Application No. 11201605506Q dated Jun. 15, 2017. [cited by applicant]
[No Author Listed], 1000 Genomes Project Consortium. A global reference for human genetic variation. Nature. Oct. 1, 2015;526(7571):68. [cited by applicant]
[No Author Listed], BCF2 Quick Reference (r198). 1 page. http://samtools.github.io/hts-specs/BCFv2_qref.pdf. [cited by applicant]
[No Author Listed], Rapid Exome Sequencing Using the Ion Proton System and Ion Ampliseq Technology. Life Technologies. 2013. 5 pages. [cited by applicant]
[No Author Listed], The International HapMap Consortium. A haplotype map of the human genome. Nature. 2005;437(7063):1299-320. [cited by applicant]
Abouelhoda et al., Tavaxy: Integrating Taverna and Galaxy workflows with cloud computing support. BMC Bioinformatics. 2012;13:77. [cited by applicant]
Agarwal et al., Sinnet: Social interaction network extractor from text. InThe Companion Volume of the Proceedings of IJCNLP 2013: System Demonstrations Oct. 2013;33-6. [cited by applicant]
Aguiar et al., HapCompass: a fast cycle basis algorithm for accurate haplotype assembly of sequence data. Journal of Computational Biology. Jun. 1, 2012;19(6):577-90. [cited by applicant]
Aguiar et al., Haplotype assembly in polyploid genomes and identical by descent shared tracts. Bioinformatics. Jul. 1, 2013;29(13):1352-60. [cited by applicant]
Airoldi et al., Mixed Membership Stochastic Blockmodels. The Journal of Machine Learning Research. Jun. 1, 2008;9:1981-2014. [cited by applicant]
Albers et al., Dindel: accurate indel calls from short-read data. Genome research. Jun. 1, 2011;21(6):961-73. [cited by applicant]
Alioto et al., A comprehensive assessment of somatic mutation detection in cancer using whole-genome sequencing. Nature communications. Dec. 9, 2015;6(1):1-3. [cited by applicant]
Altera, Implementation of the Smith-Waterman algorithm on reconfigurable supercomputing platform, White Paperver 1.0. 2007. 18 pages. [cited by applicant]
Altschul et al., Optimal sequence alignment using affine gap costs. Bulletin of mathematical biology. Sep. 1986;48(5):603-16. [cited by applicant]
Bansal et al., An MCMC algorithm for haplotype assembly from whole-genome sequence data. Genome research. Aug. 1, 2008;18(8):1336-46. [cited by applicant]
Bao et al., BRANCH: boosting RNA-Seq assemblies with partial or related genomic sequences. Bioinformatics. May 15, 2013;29(10):1250-9. [cited by applicant]
Barbieri et al., Exome sequencing identifies recurrent SPOP, FOXA1 and MED12 mutations in prostate cancer. Nature genetics. Jun. 2012;44(6):685-9. [cited by applicant]
Beerenwinkel et al., Conjunctive bayesian networks. Bernoulli. Nov. 2007;13(4):893-909. [cited by applicant]
Berlin et al., Assembling large genomes with single-molecule sequencing and locality sensitive hashing. bioRxiv, 008003. [cited by applicant]
Bertone et al., Global identification of human transcribed sequences with genome tiling arrays. Science. Dec. 24, 2004;306(5705):2242-6. [cited by applicant]
Bertrand et al., Genetic map refinement using a comparative genomic approach. Journal of Computational Biology. Oct. 1, 2009;16(10):1475-86. [cited by applicant]
Black, A simple answer for a splicing conundrum. Proceedings of the National Academy of Sciences. Apr. 5, 2005;102(14):4927-8. [cited by applicant]
Boyer et al., A fast string searching algorithm. Communications of the ACM. Oct. 1, 1977;20(10):762-72. [cited by applicant]
Browning et al., Haplotype phasing: existing methods and new developments. Nature Reviews Genetics. Oct. 2011;12(10):703-14. [cited by applicant]
Buhler, Search algorithms for biosequences using random projection. University of Washington; 2001. <http://www.mathcs.emory.edu/-cheung/papers/Matching/Search-Alg-for-Biosequences-Thesis.pdf>. [cited by applicant]
Caboche et al., Comparison of mapping algorithms used in high-throughput sequencing: application to Ion Torrent data. BMC genomics. Dec. 2014;15(1):1-6. [cited by applicant]
Carig et al., Ordering of cosmid clones covering the herpes simplex virus type I (HSV-I) genome: a test case for fingerprinting by hybridisation. Nucleic acids research. May 1, 1990;18(9):2653-60. [cited by applicant]
Carrington et al., Polypeptide ligation occurs during post-translational modification of concanavalin A. Nature. Jan. 1985;313(5997):64-7. [cited by applicant]
Cartwright, DNA assembly with gaps (Dawg): simulating sequence evolution. Bioinformatics. Nov. 1, 2005;21(Suppl_3):iii31-8. [cited by applicant]
Chang et al., The application of alternative splicing graphs in quantitative analysis of alternative splicing form from EST database. International journal of computer applications in technology. Jan. 1, 2005;22(1):14-2… [cited by applicant]
Chen et al., Genome architecture and its roles in human copy number variation. Genomics & Informatics. Dec. 2014;12(4): 136-44. [cited by applicant]
Chen et al., Transient hypermutability, chromothripsis and replication-based mechanisms in the generation of concurrent clustered mutations. Mutation Research/Reviews in Mutation Research. Jan. 1, 2012;750(1):52-9. [cited by applicant]
Chin et al., Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data. Nature methods. Jun. 2013;10(6):563-9. [cited by applicant]
Chuang et al., Gene recognition based on DAG shortest paths. Bioinformatics. Jun. 1, 2001;17(suppl_1):S56-64. [cited by applicant]
Clark, Illumina announces landmark $1,000 human genome sequencing. Wired UK. Jan. 2014. https://www.wired.co.uk/article/1000-dollar-genome. [cited by applicant]
Cock et al., Galaxy tools and workflows for sequence analysis with applications in molecular plant pathology. PeerJ. Sep. 17, 2013;1:e167. [cited by applicant]
Cohen-Boulakia et al., Distilling structure in Taverna scientific workflows: a refactoring approach. BMC Bioinformatics. 2014;15(Suppl 1):S12. [cited by applicant]
Compeau et al., How to apply de Bruijn graphs to genome assembly. Nature biotechnology. Nov. 2011;29(11):987-91. [cited by applicant]
Costa et al., Uncovering the complexity of transcriptomes with RNA-Seq. Journal of biomedicine & biotechnology. 2010;2010:853916. [cited by applicant]
Danecek et al., The variant call format and VCFtools. Bioinformatics. Aug. 1, 2011;27(15):2156-8. [cited by applicant]
Delcher et al., Alignment of whole genomes. Nucleic acids research. Jan. 1, 1999;27(11):2369-76. [cited by applicant]
Denoeud et al., Identification of polymorphic tandem repeats by direct comparison of genome sequence from different bacterial strains: a web-based resource. BMC bioinformatics. Dec. 2004;5(1):1-2. [cited by applicant]
Depristo et al., A framework for variation discovery and genotyping using next-generation DNA sequencing data. Nature genetics. May 2011;43(5):491-8. [cited by applicant]
Dinov et al., Applications of the pipeline environment for visual informatics and genomics computations. BMC Bioinformatics. 2011;12:304. [cited by applicant]
Duan et al., Optimizing de novo common wheat transcriptome assembly using short-read RNA-Seq data. BMC genomics. Dec. 2012;13(1):1-2. [cited by applicant]
Dudley et al., A quick guide for developing effective bioinformatics programming skills. PLOS computational biology. Dec. 24, 2009;5(12):e1000589. [cited by applicant]
Durbin, Efficient haplotype matching and storage using the positional Burrows—Wheeler transform (PBWT). Bioinformatics. May 1, 2014;30(9):1266-72. [cited by applicant]
Durham et al., EGene: a configurable pipeline generation system for automated sequence analysis. Bioinformatics. Jun. 15, 2005;21(12):2812-3. [cited by applicant]
Endelman, New algorithm improves fine structure of the barley consensus SNP map. BMC Genomics. 2011;12:407. [cited by applicant]
Farrar, Striped Smith-Waterman speeds database searches six times over other SIMD implementations. Bioinformatics. Jan. 15, 2007;23(2):156-61. [cited by applicant]
Fiers et al., High-throughput bioinformatics with the Cyrille2 pipeline system. BMC Bioinformatics. 2008;9:96. [cited by applicant]
Fitch, Distinguishing homologous from analogous proteins. Systematic zoology. Jun. 1, 1970;19(2):99-113. [cited by applicant]
Flicek et al., Sense from sequence reads: methods for alignment and assembly. Nature methods. Nov. 2009;6(11):S6-12. [cited by applicant]
Florea et al., Gene and alternative splicing annotation with AIR. Genome research. Jan. 1, 2005;15(1):54-66. [cited by applicant]
Florea et al., Genome-guided transcriptome assembly in the age of next-generation sequencing. IEEE/ACM transactions on computational biology and bioinformatics. Nov. 4, 2013;10(5):1234-40. [cited by applicant]
Garber et al., Computational methods for transcriptome annotation and quantification using RNA-seq. Nature methods. Jun. 2011;8(6):469-77. [cited by applicant]
Gerlinger et al., Intratumor heterogeneity and branched evolution revealed by multiregion sequencing. N Engl j Med. Mar. 8, 2012;366:883-92. [cited by applicant]
Glusman et al., Whole-genome haplotyping approaches and genomic medicine. Genome Medicine. 2014;6(9):73. [cited by applicant]
Golub et al., Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. science. Oct. 15, 1999;286(5439):531-7. [cited by applicant]
Goto et al., BioRuby: bioinformatics software for the Ruby programming language. Bioinformatics. Oct. 15, 2010;26(20):2617-9. [cited by applicant]
Gotoh, An improved algorithm for matching biological sequences. Journal of molecular biology. Dec. 15, 1982;162(3):705-8. [cited by applicant]
Gotoh, Multiple sequence alignment: algorithms and applications. Advances in biophysics. Jan. 1, 1999;36:159-206. [cited by applicant]
Grabherr et al., Full-length transcriptome assembly from RNA-Seq data without a reference genome. Nature biotechnology. Jul. 2011;29(7):644-52. [cited by applicant]
Grasso et al., Combining partial order alignment and progressive multiple sequence alignment increases alignment speed and scalability to very large alignment problems. Bioinformatics. Jul. 1, 2004;20(10):1546-56. [cited by applicant]
Guttman et al., Ab initio reconstruction of cell type-specific transcriptomes in mouse reveals the conserved multi-exonic structure of lincRNAs. Nature biotechnology. May 2010;28(5):503-10. [cited by applicant]
Haas et al., DAGchainer: a tool for mining segmental genome duplications and synteny. Bioinformatics. Dec. 12, 2004;20(18):3643-6. [cited by applicant]
Harenberg et al., Community detection in large-scale networks: a survey and empirical evaluation. Wiley Interdisciplinary Reviews: Computational Statistics. Nov. 2014;6(6):426-39. [cited by applicant]
Harrow et al., GENCODE: the reference human genome annotation for the ENCODE Project. Genome research. Sep. 1, 2012;22(9):1760-74. [cited by applicant]
He et al., Optimal algorithms for haplotype assembly from whole-genome sequence data. Bioinformatics. Jun. 15, 2010;26(12):i183-90. [cited by applicant]
Heber et al., Splicing graphs and EST assembly problem. Bioinformatics. Jul. 1, 2002;18(suppl_1):S181-8. [cited by applicant]
Hein, A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous sequences, when the phylogeny is given. Molecular Biology and Evolution. Nov. 1, 1989;6(6):649-68. [cited by applicant]
Hein, A tree reconstruction method that is economical in the number of pairwise comparisons used. Molecular biology and evolution. Nov. 1, 1989;6(6):669-84. [cited by applicant]
Hokamp et al., Wrapping up BLAST and other applications for use on Unix clusters. Bioinformatics. Feb. 12, 2003;19(3):441-2. [cited by applicant]
Holland et al., BioJava: an open-source framework for bioinformatics. Bioinformatics. Sep. 15, 2008;24(18):2096-7. [cited by applicant]
Homer et al., Improved variant discovery through local re-alignment of short-read next-generation sequencing data using SRMA. Genome Biology. Oct. 8, 2010;11:R99. [cited by applicant]
Hoon et al., Biopipe: a flexible framework for protocol-based bioinformatics analysis. Genome Research. Aug. 1, 2003;13(8):1904-15. [cited by applicant]
Horspool, Practical fast searching in strings. Software: Practice and Experience. Jun. 1980;10(6):501-6. [cited by applicant]
Huang, 3: Bio-Sequence Comparison and Alignment, ser. Curr Top Comp Mol Biol. Cambridge, Mass.: The MIT Press. 2002:45-69. [cited by applicant]
Hull et al., Taverna: a tool for building and running workflows of services. Nucleic acids research. Jul. 1, 2006;34(suppl_2):W729-32. [cited by applicant]
Hutchinson et al., Allele-specific methylation occurs at genetic variants associated with complex disease. PloS one. Jun. 9, 2014;9(6):e98464. [cited by applicant]
Kano et al., Text mining meets workflow: linking U-Compare with Taverna. Bioinformatics. Oct. 1, 2010;26(19):2486-7. [cited by applicant]
Katoh et al., MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic acids research. Jan. 1, 2005;33(2):511-8. [cited by applicant]
Kawas et al., BioMoby extensions to the Taverna workflow management and enactment software. BMC Bioinformatics. 2006;7:523. [cited by applicant]
Kehr et al., Genome alignment with graph data structures: a comparison. BMC bioinformatics. Apr. 9, 2014;15:99. [cited by applicant]
Kent, BLAT—the BLAST-like alignment tool. Genome research. Apr. 1, 2002;12(4):656-64. [cited by applicant]
Kim et al., A scaffold analysis tool using mate-pair information in genome sequencing. Journal of Biomedicine and Biotechnology. Jan. 1, 2008;195-97. [cited by applicant]
Kim et al., ECgene: genome-based EST clustering and gene modeling for alternative splicing. Genome research. Apr. 1, 2005;15(4):566-76. [cited by applicant]
Kim et al., TopHat2: accurate alignment of transcriptomes in the presence of insertions, deletions and gene fusions. Genome Biology. 2013;14(4):R36. [cited by applicant]
Koolen et al., Clinical and molecular delineation of the 17q21. 31 microdeletion syndrome. Journal of medical genetics. Nov. 1, 2008;45(11):710-20. [cited by applicant]
Krabbenhoft et al., Integrating ARC grid middleware with Taverna workflows. Bioinformatics. May 1, 2008;24(9):1221-2. [cited by applicant]
Kuhn et al., CDK-Taverna: an open workflow environment for cheminformatics. BMC Bioinformatics. Mar. 29, 2010;11:159. [cited by applicant]
Kumar et al., Comparing de novo assemblers for 454 transcriptome data. BMC genomics. Dec. 2010;11(1):571. [cited by applicant]
Kurtz et al., Versatile and open software for comparing large genomes. Genome biology. 2004;5(2):R12. [cited by applicant]
Laframboise, Single nucleotide polymorphism arrays: a decade of biological, computational and technological advances. Nucleic acids research. Jul. 1, 2009;37(13):4181-93. [cited by applicant]
Lam et al., Compressed indexing and local alignment of DNA. Bioinformatics. Mar. 15, 2008;24(6):791-7. [cited by applicant]
Langmead et al., Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology. 2009;10(3):R25. [cited by applicant]
Lanzén et al., The Taverna Interaction Service: enabling manual interaction in workflows. Bioinformatics. Apr. 15, 2008;24(8):1118-20. [cited by applicant]
Larkin et al., Clustal W and Clustal X version 2.0. bioinformatics. Nov. 1, 2007;23(21):2947-8. [cited by applicant]
Layer et al., Efficient genotype compression and analysis of large genetic variation datasets. bioRxiv. Jan. 1, 2015:018259. [cited by applicant]
Layer et al., Efficient genotype compression and analysis of large genetic-variation data sets. Nature methods. Jan. 2016;13(1):63-5. [cited by applicant]
Lecca et al., Defining order and timing of mutations during cancer progression: the TO-DAG probabilistic graphical model. Frontiers in genetics. Oct. 13, 2015;6:309. [cited by applicant]
Lee et al., Accurate read mapping using a graph-based human pan-genome. American Society of Genetics Annual Meeting Platform. Abstract 41. May 2015. [cited by applicant]
Lee et al., Bioinformatics analysis of alternative splicing. Briefings in bioinformatics. Mar. 1, 2005;6(1):23-33. [cited by applicant]
Lee et al., MOSAIK: a hash-based algorithm for accurate next-generation sequencing short-read mapping. PloS one. Mar. 5, 2014;9(3):e90581. [cited by applicant]
Lee et al., Multiple sequence alignment using partial order graphs. Bioinformatics. Mar. 1, 2002;18(3):452-64. [cited by applicant]
Lee, Generating consensus sequences from partial order multiple sequence alignment graphs. Bioinformatics. May 22, 2003;19(8):999-1008. [cited by applicant]
Legault et al., Inference of alternative splicing from RNA-Seq data with probabilistic splice graphs. Bioinformatics. Sep. 15, 2013;29(18):2300-10. [cited by applicant]
Legault et al., Learning Probabilistic Splice Graphs from RNA-Seq data. 2010. 8 pages. https://pages.cs.wisc.edu/˜legault/cs760_writeup.pdf. [cited by applicant]
Leipzig et al., The Alternative Splicing Gallery (ASG): bridging the gap between genome and transcriptome. Nucleic Acids Research. Jan. 1, 2004;32(13):3977-83. [cited by applicant]
Li et al., A survey of sequence alignment algorithms for next-generation sequencing. Briefings in bioinformatics. Sep. 1, 2010;11(5):473-83. [cited by applicant]
Li et al., Automated manipulation of systems biology models using libSBML within Taverna workflows. Bioinformatics. Jan. 15, 2008;24(2):287-9. [cited by applicant]
Li et al., Fast and accurate short read alignment with Burrows—Wheeler transform. bioinformatics. Jul. 15, 2009;25(14):1754-60. [cited by applicant]
Li et al., Performing statistical analyses on quantitative data in Taverna workflows: an example using R and maxdBrowse to identify differentially-expressed genes from microarray data. BMC Bioinformatics. 2008;9:334. [cited by applicant]
Li et al., SOAP: short oligonucleotide alignment program. Bioinformatics. Mar. 1, 2008;24(5):713-4. [cited by applicant]
Li et al., SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics. Aug. 1, 2009;25(15):1966-7. [cited by applicant]
Li et al., The sequence alignment/map format and SAMtools. Bioinformatics. Aug. 15, 2009;25(16):2078-9. [cited by applicant]
Li, BGT: efficient and flexible genotype query across many samples. arXiv preprint arXiv:1506.08452. Jun. 28, 2015. [cited by applicant]
Li, Towards Better Understanding of Artifacts in Variant Calling from High-Coverage Samples. arXiv. org q-bio. GN. 2014;2843:2851. [cited by applicant]
Lindgreen, AdapterRemoval: easy cleaning of next-generation sequencing reads. BMC Research Notes. Jul. 2, 2012;5:337. [cited by applicant]
Lipman et al., Rapid and sensitive protein similarity searches. Science. Mar. 22, 1985;227(4693):1435-41. [cited by applicant]
Lücking et al., PICS-Ord: unlimited coding of ambiguous regions by pairwise identity and cost scores ordination. BMC Bioinformatics. 2011;12:10. [cited by applicant]
Lupski et al., Genomic disorders: molecular mechanisms for rearrangements and conveyed phenotypes. PLoS genetics. Dec. 2005;1(6):e49. [cited by applicant]
Ma et al., Multiple genome alignment based on longest path in directed acyclic graphs. International Journal of Bioinformatics Research and Applications. Jan. 1, 2010;6(4):366-83. [cited by applicant]
Mamoulis et al., Non-contiguous Sequence Pattern Queries. Advances in Database Technology—EDBT 2004. 2004:569-70. [cited by applicant]
Manolio, Genomewide association studies and assessment of the risk of disease. New England journal of medicine. Jul. 8, 2010;363(2):166-76. [cited by applicant]
Mardis, The $1,000 genome, the $100,000 analysis?. Genome Medicine. 2010;2(11):84. [cited by applicant]
Margulies et al., Genome sequencing in microfabricated high-density picolitre reactors. Nature. Sep. 2005;437(7057):376-80. [cited by applicant]
Marth et al., A general approach to single-nucleotide polymorphism discovery. Nature genetics. Dec. 1999;23(4):452-6. [cited by applicant]
Mazrouee et al., FastHap: fast and accurate single individual haplotype reconstruction using fuzzy conflict graphs. Bioinformatics. Sep. 1, 2014;30(17):1371-8. [cited by applicant]
McKenna et al., The Genome Analysis Toolkit: a MapReduce framework for analyzing next- generation DNA sequencing data. Genome research. Sep. 1, 2010;20(9):1297-303. [cited by applicant]
McSherry, Spectral partitioning of random graphs. Proceedings 42nd IEEE Symposium on Foundations of Computer Science Oct. 8, 2001;529-37. [cited by applicant]
Miller et al., Assembly algorithms for next-generation sequencing data. Genomics. Jun. 1, 2010;95(6):315-27. [cited by applicant]
Misra et al., Anatomy of a hash-based long read sequence mapping algorithm for next generation DNA sequencing. Bioinformatics. Jan. 15, 2011;27(2):189-95. [cited by applicant]
Missier et al., Taverna, reloaded. International conference on scientific and statistical database management Jun. 30, 2010;471-81. [cited by applicant]
Moudrianakis et al., Base sequence determination in nucleic acids with the electron microscope, III. Chemistry and microscopy of guanine-labeled DNA. Proceedings of the National Academy of Sciences of the United States … [cited by applicant]
Mount, Multiple Sequence Alignment. Bioinformatics. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, New York. 2001:139-204. [cited by applicant]
Mourad et al., A hierarchical Bayesian network approach for linkage disequilibrium modeling and data-dimensionality reduction prior to genome-wide association studies. BMC bioinformatics. Dec. 2011;12(1):1-20. [cited by applicant]
Myers, The fragment assembly string graph. Bioinformatics. Jan. 1, 2005;21(suppl_2):ii79-85. [cited by applicant]
Nagalakshmi et al., RNA-Seq: a method for comprehensive transcriptome analysis. Current protocols in molecular biology. Jan. 2010;89(1):4-11. [cited by applicant]
Nagarajan et al., Sequence assembly demystified. Nature Reviews Genetics. Mar. 2013;14(3):157-67. [cited by applicant]
Najafi et al., Fundamental limits of pooled-DNA sequencing. arXiv preprint arXiv:1604.04735. Apr. 16, 2016. [cited by applicant]
Nakao et al., Large-scale analysis of human alternative protein isoforms: pattern classification and correlation with subcellular localization signals. Nucleic Acids Research. Jan. 1, 2005;33(8):2355-63. [cited by applicant]
Needleman et al., A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of molecular biology. Mar. 28, 1970;48(3):443-53. [cited by applicant]
Nenadic, 2010, Nested Workflows, The Taverna Knowledge Blog, Dec. 13, 2010. Retrieved on Feb. 25, 2016 from http://taverna.knowledgeblog.org/2010/12/13/nested-workflows/. [cited by applicant]
Newman et al., An ultrasensitive method for quantitating circulating tumor DNA with broad patient coverage. Nature medicine. May 2014;20(5):548-54. [cited by applicant]
Newman, Spectral methods for community detection and graph partitioning. Physical Review E. Oct. 30, 2013;88(4):042822. [cited by applicant]
Ning et al., SSAHA: a fast search method for large DNA databases. Genome research. Oct. 1, 2001;11(10):1725-9. [cited by applicant]
No Author Listed, The Variant Call Format (VCF) Version 4.2 Specification. Jan. 26, 2015. 28 pages. https://samtools.github.io/hts-specsVCFv4.2.pdf. [cited by applicant]
Oinn et al., Taverna: a tool for the composition and enactment of bioinformatics workflows. Bioinformatics. Nov. 22, 2004;20(17):3045-54. [cited by applicant]
Oinn et al., Taverna: lessons in creating a workflow environment for the life sciences, Concurrency and Computation: Practice and Experience. 2006. 18(10):1067-1100. [cited by applicant]
Olsson et al., Serial monitoring of circulating tumor DNA in patients with primary breast cancer for detection of occult metastatic disease. EMBO molecular medicine. Aug. 2015;7(8):1034-47. [cited by applicant]
O'Rawe et al., Low concordance of multiple variant-calling pipelines: practical implications for exome and genome sequencing. Genome medicine. Mar. 27, 2013;5(3):28. [cited by applicant]
Oshlack et al., From RNA-seq reads to differential expression results. Genome biology. Dec. 2010;11(12):1-0. [cited by applicant]
Pabinger et al., A survey of tools for variant analysis of next-generation genome sequencing data. Briefings in Bioinformatics. Feb. 21, 2013. [cited by applicant]
Parks et al., Detecting non-allelic homologous recombination from high-throughput sequencing data. Genome biology. Dec. 2015;16(1):1-9. [cited by applicant]
Paterson et al., An XML transfer schema for exchange of genomic and genetic mapping data: implementation as a web service in a Taverna workflow. BMC Bioinformatics. 2009;10:252. [cited by applicant]
Pearson et al., Improved tools for biological sequence comparison. Proceedings of the National Academy of Sciences. Apr. 1, 1988;85(8):2444-8. [cited by applicant]
Pe'Er et al., Evaluating and improving power in whole-genome association studies using fixed marker sets. Nature genetics. Jun. 2006;38(6):663-7. [cited by applicant]
Peixoto, Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Physical Review E. Jan. 13, 2014;89(1):012804. [cited by applicant]
Pop et al., Comparative genome assembly. Briefings in bioinformatics. Sep. 1, 2004;5(3):237-48. [cited by applicant]
Pope et al., Rover variant caller: read-pair overlap considerate variant—calling software applied to PCR-based massively parallel sequencing datasets. Source code for biology and medicine. Dec. 2014;9(1):1-5. [cited by applicant]
Popitsch et al., NGC: lossless and lossy compression of aligned high-throughput sequencing data. Nucleic acids research. Jan. 1, 2013;41(1):e27. [cited by applicant]
Posada et al., Modeltest: testing the model of DNA substitution. Bioinformatics (Oxford, England). Jan. 1, 1998;14(9):817-8. [cited by applicant]
Potter et al., ASC: an associative-computing paradigm. Computer. Nov. 1994;27(11):19-25. [cited by applicant]
Potter, The ensemble analysis pipeline. Genome Res 14:934-941. [cited by applicant]
Pruesse et al., SINA: accurate high-throughput multiple sequence alignment of ribosomal RNA genes. Bioinformatics. Jul. 15, 2012;28(14):1823-9. [cited by applicant]
Quail et al., A tale of three next generation sequencing platforms: comparison of Ion Torrent, Pacific Biosciences and Illumina MiSeq sequencers. BMC genomics. Jul. 24, 2012;13:341. [cited by applicant]
Rajaram et al., Pearl millet [Pennisetum glaucum (L.) R. Br.] consensus linkage map constructed using four RIL mapping populations and newly developed EST-SSRs. BMC genomics. Mar. 9, 2013;14:159. [cited by applicant]
Ramirez-Gonzalez et al., Gee Fu: a sequence version and web-services database tool for genomic assembly, genome feature and NGS data. Bioinformatics. Oct. 1, 2011;27(19):2754-5. [cited by applicant]
Raphael et al., A novel method for multiple alignment of sequences with repeated and shuffled elements. Genome Research. Nov. 1, 2004;14(11):2336-46. [cited by applicant]
Robertson et al., De novo assembly and analysis of RNA-seq data. Nature methods. Nov. 2010;7(11):909-12. [cited by applicant]
Rödelsperger et al., Syntenator: Multiple gene order alignments with a gene-specific scoring function. Algorithms for Molecular Biology. 2008;3:14. [cited by applicant]
Rognes et al., Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors. Bioinformatics. Aug. 1, 2000;16(8):699-706. [cited by applicant]
Rognes, ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searches. Nucleic acids research. Apr. 1, 2001;29(7):1647-52. [cited by applicant]
Ronquist et al., MrBayes 3.2: efficient Bayesian phylogenetic inference and model choice across a large model space. Systematic biology. May 1, 2012;61(3):539-42. [cited by applicant]
Rothberg et al., An integrated semiconductor device enabling non-optical genome sequencing. Nature. Jul. 2011;475(7356):348-52. [cited by applicant]
Saebo et al., Paralign: rapid and sensitive sequence similarity searches powered by parallel computing technology. Nucleic acids research. Jul. 1, 2005;33(suppl_2):W535-9. [cited by applicant]
Schenk et al., A pipeline for comprehensive and automated processing of electron diffraction data in IPLT. Journal of structural biology. May 1, 2013;182(2):173-85. [cited by applicant]
Schwikowski et al., Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions. Discrete Applied Mathematics. Apr. 1, 2003;127(1):95-117. [cited by applicant]
Shao et al., Bioinformatic analysis of exon repetition, exon scrambling and trans-splicing in humans. Bioinformatics. Mar. 15, 2006;22(6):692-8. [cited by applicant]
Sievers et al., Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Molecular systems biology. 2011;7(1):539. [cited by applicant]
Slater et al., Automated generation of heuristics for biological sequence comparison. BMC bioinformatics. Feb. 15, 2005;6:31. [cited by applicant]
Smith et al., Identification of common molecular subsequences. Journal of molecular biology. Mar. 25, 1981;147(1):195-7. [cited by applicant]
Smith et al., Multiple insert size paired-end sequencing for deconvolution of complex transcriptomes. RNA biology. May 1, 2012;9(5):596-609. [cited by applicant]
Soni et al., Progress toward ultrafast DNA sequencing using solid-state nanopores. Clinical chemistry. Nov. 1, 2007;53(11):1996-2001. [cited by applicant]
Sosa et al., Next-generation sequencing of human mitochondrial reference genomes uncovers high heteroplasmy frequency. PLoS computational biology. Oct. 25, 2012;8(10):e1002737. [cited by applicant]