VARIANT CALLER

Processes and systems for reading variants from a genome sample relative to a reference genomic sequence are provided. An exemplary process includes collecting a set reads and generating a k-mer graph from the reads. For example, the k-mer graph can be constructed to represent all possible substring...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: HAQUE IMRAN SAEEDUL, MAGUIRE JARED ROBERT, GIBIANSKY ANDREW LEONIDOVICH, ROBERTSON ALEXANDER DE JONG
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator HAQUE IMRAN SAEEDUL
MAGUIRE JARED ROBERT
GIBIANSKY ANDREW LEONIDOVICH
ROBERTSON ALEXANDER DE JONG
description Processes and systems for reading variants from a genome sample relative to a reference genomic sequence are provided. An exemplary process includes collecting a set reads and generating a k-mer graph from the reads. For example, the k-mer graph can be constructed to represent all possible substrings of the collected reads. The k-mer graph may be reduced to a contiguous graph, and a set of possible haplotypes generated from the contiguous graph. The process may further generate, the error table providing a filter for common sequencer errors. The process may then generate a set of diplotypes based on the set of haplotypes and the generated error table and score the set of diplotypes to identify variants from the reference genome. Scoring the diplotypes may include determining a posterior probability for each of the diplotypes, with the highest scoring diplotype(s) reported as the result.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2016140289A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2016140289A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2016140289A13</originalsourceid><addsrcrecordid>eNrjZOALcwzydPQLUXB29PFxDeJhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhmaGJgZGFpaOhsbEqQIANxsd0w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>VARIANT CALLER</title><source>esp@cenet</source><creator>HAQUE IMRAN SAEEDUL ; MAGUIRE JARED ROBERT ; GIBIANSKY ANDREW LEONIDOVICH ; ROBERTSON ALEXANDER DE JONG</creator><creatorcontrib>HAQUE IMRAN SAEEDUL ; MAGUIRE JARED ROBERT ; GIBIANSKY ANDREW LEONIDOVICH ; ROBERTSON ALEXANDER DE JONG</creatorcontrib><description>Processes and systems for reading variants from a genome sample relative to a reference genomic sequence are provided. An exemplary process includes collecting a set reads and generating a k-mer graph from the reads. For example, the k-mer graph can be constructed to represent all possible substrings of the collected reads. The k-mer graph may be reduced to a contiguous graph, and a set of possible haplotypes generated from the contiguous graph. The process may further generate, the error table providing a filter for common sequencer errors. The process may then generate a set of diplotypes based on the set of haplotypes and the generated error table and score the set of diplotypes to identify variants from the reference genome. Scoring the diplotypes may include determining a posterior probability for each of the diplotypes, with the highest scoring diplotype(s) reported as the result.</description><language>eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS ; PHYSICS</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20160519&amp;DB=EPODOC&amp;CC=US&amp;NR=2016140289A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20160519&amp;DB=EPODOC&amp;CC=US&amp;NR=2016140289A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>HAQUE IMRAN SAEEDUL</creatorcontrib><creatorcontrib>MAGUIRE JARED ROBERT</creatorcontrib><creatorcontrib>GIBIANSKY ANDREW LEONIDOVICH</creatorcontrib><creatorcontrib>ROBERTSON ALEXANDER DE JONG</creatorcontrib><title>VARIANT CALLER</title><description>Processes and systems for reading variants from a genome sample relative to a reference genomic sequence are provided. An exemplary process includes collecting a set reads and generating a k-mer graph from the reads. For example, the k-mer graph can be constructed to represent all possible substrings of the collected reads. The k-mer graph may be reduced to a contiguous graph, and a set of possible haplotypes generated from the contiguous graph. The process may further generate, the error table providing a filter for common sequencer errors. The process may then generate a set of diplotypes based on the set of haplotypes and the generated error table and score the set of diplotypes to identify variants from the reference genome. Scoring the diplotypes may include determining a posterior probability for each of the diplotypes, with the highest scoring diplotype(s) reported as the result.</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZOALcwzydPQLUXB29PFxDeJhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhmaGJgZGFpaOhsbEqQIANxsd0w</recordid><startdate>20160519</startdate><enddate>20160519</enddate><creator>HAQUE IMRAN SAEEDUL</creator><creator>MAGUIRE JARED ROBERT</creator><creator>GIBIANSKY ANDREW LEONIDOVICH</creator><creator>ROBERTSON ALEXANDER DE JONG</creator><scope>EVB</scope></search><sort><creationdate>20160519</creationdate><title>VARIANT CALLER</title><author>HAQUE IMRAN SAEEDUL ; MAGUIRE JARED ROBERT ; GIBIANSKY ANDREW LEONIDOVICH ; ROBERTSON ALEXANDER DE JONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2016140289A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>HAQUE IMRAN SAEEDUL</creatorcontrib><creatorcontrib>MAGUIRE JARED ROBERT</creatorcontrib><creatorcontrib>GIBIANSKY ANDREW LEONIDOVICH</creatorcontrib><creatorcontrib>ROBERTSON ALEXANDER DE JONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>HAQUE IMRAN SAEEDUL</au><au>MAGUIRE JARED ROBERT</au><au>GIBIANSKY ANDREW LEONIDOVICH</au><au>ROBERTSON ALEXANDER DE JONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>VARIANT CALLER</title><date>2016-05-19</date><risdate>2016</risdate><abstract>Processes and systems for reading variants from a genome sample relative to a reference genomic sequence are provided. An exemplary process includes collecting a set reads and generating a k-mer graph from the reads. For example, the k-mer graph can be constructed to represent all possible substrings of the collected reads. The k-mer graph may be reduced to a contiguous graph, and a set of possible haplotypes generated from the contiguous graph. The process may further generate, the error table providing a filter for common sequencer errors. The process may then generate a set of diplotypes based on the set of haplotypes and the generated error table and score the set of diplotypes to identify variants from the reference genome. Scoring the diplotypes may include determining a posterior probability for each of the diplotypes, with the highest scoring diplotype(s) reported as the result.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2016140289A1
source esp@cenet
subjects CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTEDFOR SPECIFIC APPLICATION FIELDS
PHYSICS
title VARIANT CALLER
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T07%3A48%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=HAQUE%20IMRAN%20SAEEDUL&rft.date=2016-05-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2016140289A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true