A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Recently, Marcus et al. (Bioinformatics 30:3476-83, 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 [Formula: see text] time algorithm called splitMEM that construc...
Gespeichert in:
| Veröffentlicht in: | Algorithms for molecular biology 2016-07, Vol.11 (1), p.20-20, Article 20 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 20 |
|---|---|
| container_issue | 1 |
| container_start_page | 20 |
| container_title | Algorithms for molecular biology |
| container_volume | 11 |
| creator | Beller, Timo Ohlebusch, Enno |
| description | Recently, Marcus et al. (Bioinformatics 30:3476-83, 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 [Formula: see text] 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. Baier et al. (Bioinformatics 32:497-504, 2016) improved their result.
In this paper, 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. The ability to search within the pan-genome graph is of utmost importance and is a design goal of pan-genome data structures. |
| doi_str_mv | 10.1186/s13015-016-0083-7 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pubme</sourceid><recordid>TN_cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_4950428</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1806077743</sourcerecordid><originalsourceid>FETCH-LOGICAL-c427t-3d2567c5d44107ded8ebd9304c3fdfbec828899622d4e86807d6fa6e34a0d1ed3</originalsourceid><addsrcrecordid>eNpdkU1LAzEQhoMotn78AC8S8OJlNdlkN-lFqMUvELzoTQhpMttu2U3WZFfw35taleopIXnmZWYehE4ouaBUlpeRMkKLjNAyI0SyTOygMRVcZoJKubt1H6GDGFeE8IIRto9GueBMkFyO0esUB-gCRHC97mvvsK-wxsa368cIFlvA12GoVw4vgu6WuPIBd9plC3C-Baydbj5iHXG_1D0Gp-cNRBxBB7M8QnuVbiIcf5-H6OX25nl2nz0-3T3Mpo-Z4bnoM2bzohSmsJxTIixYCXM7YYQbVtlqDkbmUk4mZZ5bDrKUiSkrXQLjmlgKlh2iq01uN8xbsCbNEnSjulC3Onwor2v198fVS7Xw74pPCsJzmQLOvwOCfxsg9qqto4Gm0Q78EBWVpCRCpK0l9OwfuvJDSEv4ooQskpN1IN1QJvgYA1S_zVCi1u7Uxp1K7tTanRKp5nR7it-KH1nsE_clleM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1807851308</pqid></control><display><type>article</type><title>A representation of a compressed de Bruijn graph for pan-genome analysis that enables search</title><source>DOAJ Directory of Open Access Journals</source><source>PubMed Central Open Access</source><source>Springer Nature OA Free Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><source>PubMed Central</source><source>SpringerLink Journals - AutoHoldings</source><creator>Beller, Timo ; Ohlebusch, Enno</creator><creatorcontrib>Beller, Timo ; Ohlebusch, Enno</creatorcontrib><description>Recently, Marcus et al. (Bioinformatics 30:3476-83, 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 [Formula: see text] 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. Baier et al. (Bioinformatics 32:497-504, 2016) improved their result.
In this paper, 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. The ability to search within the pan-genome graph is of utmost importance and is a design goal of pan-genome data structures.</description><identifier>ISSN: 1748-7188</identifier><identifier>EISSN: 1748-7188</identifier><identifier>DOI: 10.1186/s13015-016-0083-7</identifier><identifier>PMID: 27437028</identifier><language>eng</language><publisher>England: BioMed Central</publisher><ispartof>Algorithms for molecular biology, 2016-07, Vol.11 (1), p.20-20, Article 20</ispartof><rights>Copyright BioMed Central 2016</rights><rights>The Author(s) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c427t-3d2567c5d44107ded8ebd9304c3fdfbec828899622d4e86807d6fa6e34a0d1ed3</citedby><cites>FETCH-LOGICAL-c427t-3d2567c5d44107ded8ebd9304c3fdfbec828899622d4e86807d6fa6e34a0d1ed3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC4950428/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC4950428/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,864,885,27924,27925,53791,53793</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/27437028$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></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>Algorithms for molecular biology</title><addtitle>Algorithms Mol Biol</addtitle><description>Recently, Marcus et al. (Bioinformatics 30:3476-83, 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 [Formula: see text] 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. Baier et al. (Bioinformatics 32:497-504, 2016) improved their result.
In this paper, 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. The ability to search within the pan-genome graph is of utmost importance and is a design goal of pan-genome data structures.</description><issn>1748-7188</issn><issn>1748-7188</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><sourceid>GNUQQ</sourceid><recordid>eNpdkU1LAzEQhoMotn78AC8S8OJlNdlkN-lFqMUvELzoTQhpMttu2U3WZFfw35taleopIXnmZWYehE4ouaBUlpeRMkKLjNAyI0SyTOygMRVcZoJKubt1H6GDGFeE8IIRto9GueBMkFyO0esUB-gCRHC97mvvsK-wxsa368cIFlvA12GoVw4vgu6WuPIBd9plC3C-Baydbj5iHXG_1D0Gp-cNRBxBB7M8QnuVbiIcf5-H6OX25nl2nz0-3T3Mpo-Z4bnoM2bzohSmsJxTIixYCXM7YYQbVtlqDkbmUk4mZZ5bDrKUiSkrXQLjmlgKlh2iq01uN8xbsCbNEnSjulC3Onwor2v198fVS7Xw74pPCsJzmQLOvwOCfxsg9qqto4Gm0Q78EBWVpCRCpK0l9OwfuvJDSEv4ooQskpN1IN1QJvgYA1S_zVCi1u7Uxp1K7tTanRKp5nR7it-KH1nsE_clleM</recordid><startdate>20160718</startdate><enddate>20160718</enddate><creator>Beller, Timo</creator><creator>Ohlebusch, Enno</creator><general>BioMed Central</general><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7QO</scope><scope>7QP</scope><scope>7QR</scope><scope>7TK</scope><scope>7X7</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0S</scope><scope>M7P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>7X8</scope><scope>5PM</scope></search><sort><creationdate>20160718</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-LOGICAL-c427t-3d2567c5d44107ded8ebd9304c3fdfbec828899622d4e86807d6fa6e34a0d1ed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Beller, Timo</creatorcontrib><creatorcontrib>Ohlebusch, Enno</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Biotechnology Research Abstracts</collection><collection>Calcium & Calcified Tissue Abstracts</collection><collection>Chemoreception Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Access via ProQuest (Open Access)</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><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><jtitle>Algorithms for molecular biology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beller, Timo</au><au>Ohlebusch, Enno</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A representation of a compressed de Bruijn graph for pan-genome analysis that enables search</atitle><jtitle>Algorithms for molecular biology</jtitle><addtitle>Algorithms Mol Biol</addtitle><date>2016-07-18</date><risdate>2016</risdate><volume>11</volume><issue>1</issue><spage>20</spage><epage>20</epage><pages>20-20</pages><artnum>20</artnum><issn>1748-7188</issn><eissn>1748-7188</eissn><abstract>Recently, Marcus et al. (Bioinformatics 30:3476-83, 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 [Formula: see text] 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. Baier et al. (Bioinformatics 32:497-504, 2016) improved their result.
In this paper, 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. The ability to search within the pan-genome graph is of utmost importance and is a design goal of pan-genome data structures.</abstract><cop>England</cop><pub>BioMed Central</pub><pmid>27437028</pmid><doi>10.1186/s13015-016-0083-7</doi><tpages>1</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1748-7188 |
| ispartof | Algorithms for molecular biology, 2016-07, Vol.11 (1), p.20-20, Article 20 |
| issn | 1748-7188 1748-7188 |
| language | eng |
| recordid | cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_4950428 |
| source | DOAJ Directory of Open Access Journals; PubMed Central Open Access; Springer Nature OA Free Journals; EZB-FREE-00999 freely available EZB journals; PubMed Central; SpringerLink Journals - AutoHoldings |
| 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%3A12%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pubme&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20representation%20of%20a%20compressed%20de%20Bruijn%20graph%20for%20pan-genome%20analysis%20that%20enables%20search&rft.jtitle=Algorithms%20for%20molecular%20biology&rft.au=Beller,%20Timo&rft.date=2016-07-18&rft.volume=11&rft.issue=1&rft.spage=20&rft.epage=20&rft.pages=20-20&rft.artnum=20&rft.issn=1748-7188&rft.eissn=1748-7188&rft_id=info:doi/10.1186/s13015-016-0083-7&rft_dat=%3Cproquest_pubme%3E1806077743%3C/proquest_pubme%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1807851308&rft_id=info:pmid/27437028&rfr_iscdi=true |