A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an \(O(n \log g)\) time algorithm called splitMEM that constructs this graph di...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2016-02 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Beller, Timo Ohlebusch, Enno |
| description | Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an \(O(n \log g)\) time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where \(n\) is the total length of the genomes and \(g\) is the length of the longest genome. In this paper, we present a construction algorithm that outperforms their algorithm in theory and in practice. Moreover, we propose a new space-efficient representation of the compressed de Bruijn graph that adds the possibility to search for a pattern (e.g. an allele - a variant form of a gene) within the pan-genome. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2078178510</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2078178510</sourcerecordid><originalsourceid>FETCH-proquest_journals_20781785103</originalsourceid><addsrcrecordid>eNqNjEsKwjAUAIMgWLR3eOC6kCbWdquieACXQnm2rz_aJOalC2-vggdwNTAMsxCR0jpNip1SKxEzD1JKtc9VlulI3A_gyXliMgFDbw3YBhAqO30lUw01wdHP_WCg9eg6aKwHhyZpydiJAA2OL-4ZQocByOBjJAYm9FW3EcsGR6b4x7XYXs630zVx3j5n4lAOdvafAZdK5kWaF1kq9X_VG6qRQ0Y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2078178510</pqid></control><display><type>article</type><title>A representation of a compressed de Bruijn graph for pan-genome analysis that enables search</title><source>Free E- Journals</source><creator>Beller, Timo ; Ohlebusch, Enno</creator><creatorcontrib>Beller, Timo ; Ohlebusch, Enno</creatorcontrib><description>Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an \(O(n \log g)\) time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where \(n\) is the total length of the genomes and \(g\) is the length of the longest genome. In this paper, we present a construction algorithm that outperforms their algorithm in theory and in practice. Moreover, we propose a new space-efficient representation of the compressed de Bruijn graph that adds the possibility to search for a pattern (e.g. an allele - a variant form of a gene) within the pan-genome.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Bioinformatics ; Genomes ; Graphical representations ; Suffix trees</subject><ispartof>arXiv.org, 2016-02</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Beller, Timo</creatorcontrib><creatorcontrib>Ohlebusch, Enno</creatorcontrib><title>A representation of a compressed de Bruijn graph for pan-genome analysis that enables search</title><title>arXiv.org</title><description>Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an \(O(n \log g)\) time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where \(n\) is the total length of the genomes and \(g\) is the length of the longest genome. In this paper, we present a construction algorithm that outperforms their algorithm in theory and in practice. Moreover, we propose a new space-efficient representation of the compressed de Bruijn graph that adds the possibility to search for a pattern (e.g. an allele - a variant form of a gene) within the pan-genome.</description><subject>Algorithms</subject><subject>Bioinformatics</subject><subject>Genomes</subject><subject>Graphical representations</subject><subject>Suffix trees</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNjEsKwjAUAIMgWLR3eOC6kCbWdquieACXQnm2rz_aJOalC2-vggdwNTAMsxCR0jpNip1SKxEzD1JKtc9VlulI3A_gyXliMgFDbw3YBhAqO30lUw01wdHP_WCg9eg6aKwHhyZpydiJAA2OL-4ZQocByOBjJAYm9FW3EcsGR6b4x7XYXs630zVx3j5n4lAOdvafAZdK5kWaF1kq9X_VG6qRQ0Y</recordid><startdate>20160210</startdate><enddate>20160210</enddate><creator>Beller, Timo</creator><creator>Ohlebusch, Enno</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160210</creationdate><title>A representation of a compressed de Bruijn graph for pan-genome analysis that enables search</title><author>Beller, Timo ; Ohlebusch, Enno</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20781785103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Bioinformatics</topic><topic>Genomes</topic><topic>Graphical representations</topic><topic>Suffix trees</topic><toplevel>online_resources</toplevel><creatorcontrib>Beller, Timo</creatorcontrib><creatorcontrib>Ohlebusch, Enno</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beller, Timo</au><au>Ohlebusch, Enno</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>A representation of a compressed de Bruijn graph for pan-genome analysis that enables search</atitle><jtitle>arXiv.org</jtitle><date>2016-02-10</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an \(O(n \log g)\) time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where \(n\) is the total length of the genomes and \(g\) is the length of the longest genome. In this paper, we present a construction algorithm that outperforms their algorithm in theory and in practice. Moreover, we propose a new space-efficient representation of the compressed de Bruijn graph that adds the possibility to search for a pattern (e.g. an allele - a variant form of a gene) within the pan-genome.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2016-02 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2078178510 |
| source | Free E- Journals |
| subjects | Algorithms Bioinformatics Genomes Graphical representations Suffix trees |
| title | A representation of a compressed de Bruijn graph for pan-genome analysis that enables search |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T19%3A13%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=A%20representation%20of%20a%20compressed%20de%20Bruijn%20graph%20for%20pan-genome%20analysis%20that%20enables%20search&rft.jtitle=arXiv.org&rft.au=Beller,%20Timo&rft.date=2016-02-10&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2078178510%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2078178510&rft_id=info:pmid/&rfr_iscdi=true |