Serveur d'exploration MERS

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Readjoiner: a fast and memory efficient string graph-based sequence assembler

Identifieur interne : 000956 ( Ncbi/Checkpoint ); précédent : 000955; suivant : 000957

Readjoiner: a fast and memory efficient string graph-based sequence assembler

Auteurs : Giorgio Gonnella [Allemagne] ; Stefan Kurtz [Allemagne]

Source :

RBID : PMC:3507659

Descripteurs français

English descriptors

Abstract

Background

Ongoing improvements in throughput of the next-generation sequencing technologies challenge the current generation of de novo sequence assemblers. Most recent sequence assemblers are based on the construction of a de Bruijn graph. An alternative framework of growing interest is the assembly string graph, not necessitating a division of the reads into k-mers, but requiring fast algorithms for the computation of suffix-prefix matches among all pairs of reads.

Results

Here we present efficient methods for the construction of a string graph from a set of sequencing reads. Our approach employs suffix sorting and scanning methods to compute suffix-prefix matches. Transitive edges are recognized and eliminated early in the process and the graph is efficiently constructed including irreducible edges only.

Conclusions

Our suffix-prefix match determination and string graph construction algorithms have been implemented in the software package Readjoiner. Comparison with existing string graph-based assemblers shows that Readjoiner is faster and more space efficient. Readjoiner is available at http://www.zbh.uni-hamburg.de/readjoiner.


Url:
DOI: 10.1186/1471-2105-13-82
PubMed: 22559072
PubMed Central: 3507659


Affiliations:


Links toward previous steps (curation, corpus...)


Links to Exploration step

PMC:3507659

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Readjoiner: a fast and memory efficient string graph-based sequence assembler</title>
<author>
<name sortKey="Gonnella, Giorgio" sort="Gonnella, Giorgio" uniqKey="Gonnella G" first="Giorgio" last="Gonnella">Giorgio Gonnella</name>
<affiliation wicri:level="3">
<nlm:aff id="I1">Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg, Germany</nlm:aff>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg</wicri:regionArea>
<placeName>
<settlement type="city">Hambourg</settlement>
<region type="land" nuts="2">Hambourg</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Kurtz, Stefan" sort="Kurtz, Stefan" uniqKey="Kurtz S" first="Stefan" last="Kurtz">Stefan Kurtz</name>
<affiliation wicri:level="3">
<nlm:aff id="I1">Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg, Germany</nlm:aff>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg</wicri:regionArea>
<placeName>
<settlement type="city">Hambourg</settlement>
<region type="land" nuts="2">Hambourg</region>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">PMC</idno>
<idno type="pmid">22559072</idno>
<idno type="pmc">3507659</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3507659</idno>
<idno type="RBID">PMC:3507659</idno>
<idno type="doi">10.1186/1471-2105-13-82</idno>
<date when="2012">2012</date>
<idno type="wicri:Area/Pmc/Corpus">000943</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Corpus" wicri:corpus="PMC">000943</idno>
<idno type="wicri:Area/Pmc/Curation">000943</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Curation">000943</idno>
<idno type="wicri:Area/Pmc/Checkpoint">001285</idno>
<idno type="wicri:explorRef" wicri:stream="Pmc" wicri:step="Checkpoint">001285</idno>
<idno type="wicri:source">PubMed</idno>
<idno type="RBID">pubmed:22559072</idno>
<idno type="wicri:Area/PubMed/Corpus">001D83</idno>
<idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Corpus" wicri:corpus="PubMed">001D83</idno>
<idno type="wicri:Area/PubMed/Curation">001D83</idno>
<idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Curation">001D83</idno>
<idno type="wicri:Area/PubMed/Checkpoint">001C42</idno>
<idno type="wicri:explorRef" wicri:stream="Checkpoint" wicri:step="PubMed">001C42</idno>
<idno type="wicri:Area/Ncbi/Merge">000956</idno>
<idno type="wicri:Area/Ncbi/Curation">000956</idno>
<idno type="wicri:Area/Ncbi/Checkpoint">000956</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a" type="main">Readjoiner: a fast and memory efficient string graph-based sequence assembler</title>
<author>
<name sortKey="Gonnella, Giorgio" sort="Gonnella, Giorgio" uniqKey="Gonnella G" first="Giorgio" last="Gonnella">Giorgio Gonnella</name>
<affiliation wicri:level="3">
<nlm:aff id="I1">Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg, Germany</nlm:aff>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg</wicri:regionArea>
<placeName>
<settlement type="city">Hambourg</settlement>
<region type="land" nuts="2">Hambourg</region>
</placeName>
</affiliation>
</author>
<author>
<name sortKey="Kurtz, Stefan" sort="Kurtz, Stefan" uniqKey="Kurtz S" first="Stefan" last="Kurtz">Stefan Kurtz</name>
<affiliation wicri:level="3">
<nlm:aff id="I1">Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg, Germany</nlm:aff>
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, 20146, Hamburg</wicri:regionArea>
<placeName>
<settlement type="city">Hambourg</settlement>
<region type="land" nuts="2">Hambourg</region>
</placeName>
</affiliation>
</author>
</analytic>
<series>
<title level="j">BMC Bioinformatics</title>
<idno type="eISSN">1471-2105</idno>
<imprint>
<date when="2012">2012</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Algorithms</term>
<term>Computer Simulation</term>
<term>Genome, Human (genetics)</term>
<term>Humans</term>
<term>Models, Genetic</term>
<term>Sequence Analysis, DNA (methods)</term>
<term>Software</term>
</keywords>
<keywords scheme="KwdFr" xml:lang="fr">
<term>Algorithmes</term>
<term>Analyse de séquence d'ADN ()</term>
<term>Génome humain (génétique)</term>
<term>Humains</term>
<term>Logiciel</term>
<term>Modèles génétiques</term>
<term>Simulation numérique</term>
</keywords>
<keywords scheme="MESH" qualifier="genetics" xml:lang="en">
<term>Genome, Human</term>
</keywords>
<keywords scheme="MESH" qualifier="génétique" xml:lang="fr">
<term>Génome humain</term>
</keywords>
<keywords scheme="MESH" qualifier="methods" xml:lang="en">
<term>Sequence Analysis, DNA</term>
</keywords>
<keywords scheme="MESH" xml:lang="en">
<term>Algorithms</term>
<term>Computer Simulation</term>
<term>Humans</term>
<term>Models, Genetic</term>
<term>Software</term>
</keywords>
<keywords scheme="MESH" xml:lang="fr">
<term>Algorithmes</term>
<term>Analyse de séquence d'ADN</term>
<term>Humains</term>
<term>Logiciel</term>
<term>Modèles génétiques</term>
<term>Simulation numérique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">
<sec>
<title>Background</title>
<p>Ongoing improvements in throughput of the next-generation sequencing technologies challenge the current generation of de novo sequence assemblers. Most recent sequence assemblers are based on the construction of a de Bruijn graph. An alternative framework of growing interest is the assembly string graph, not necessitating a division of the reads into
<italic>k</italic>
-mers, but requiring fast algorithms for the computation of suffix-prefix matches among all pairs of reads.</p>
</sec>
<sec>
<title>Results</title>
<p>Here we present efficient methods for the construction of a string graph from a set of sequencing reads. Our approach employs suffix sorting and scanning methods to compute suffix-prefix matches. Transitive edges are recognized and eliminated early in the process and the graph is efficiently constructed including irreducible edges only.</p>
</sec>
<sec>
<title>Conclusions</title>
<p>Our suffix-prefix match determination and string graph construction algorithms have been implemented in the software package Readjoiner. Comparison with existing string graph-based assemblers shows that Readjoiner is faster and more space efficient. Readjoiner is available at
<ext-link ext-link-type="uri" xlink:href="http://www.zbh.uni-hamburg.de/readjoiner">http://www.zbh.uni-hamburg.de/readjoiner</ext-link>
.</p>
</sec>
</div>
</front>
<back>
<div1 type="bibliography">
<listBibl>
<biblStruct>
<analytic>
<author>
<name sortKey="Myers, Ew" uniqKey="Myers E">EW Myers</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Mcpherson, Jd" uniqKey="Mcpherson J">JD McPherson</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Pevzner, Pa" uniqKey="Pevzner P">PA Pevzner</name>
</author>
<author>
<name sortKey="Tang, H" uniqKey="Tang H">H Tang</name>
</author>
<author>
<name sortKey="Waterman, Ms" uniqKey="Waterman M">MS Waterman</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Zerbino, Dr" uniqKey="Zerbino D">DR Zerbino</name>
</author>
<author>
<name sortKey="Birney, E" uniqKey="Birney E">E Birney</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Chaisson, Mj" uniqKey="Chaisson M">MJ Chaisson</name>
</author>
<author>
<name sortKey="Pevzner, Pa" uniqKey="Pevzner P">PA Pevzner</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Simpson, Jt" uniqKey="Simpson J">JT Simpson</name>
</author>
<author>
<name sortKey="Wong, K" uniqKey="Wong K">K Wong</name>
</author>
<author>
<name sortKey="Jackman, Sd" uniqKey="Jackman S">SD Jackman</name>
</author>
<author>
<name sortKey="Schein, Je" uniqKey="Schein J">JE Schein</name>
</author>
<author>
<name sortKey="Jones, Sj" uniqKey="Jones S">SJ Jones</name>
</author>
<author>
<name sortKey="Birol, I" uniqKey="Birol I">I Birol</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Myers, Ew" uniqKey="Myers E">EW Myers</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Hernandez, D" uniqKey="Hernandez D">D Hernandez</name>
</author>
<author>
<name sortKey="Francois, P" uniqKey="Francois P">P FranÇois</name>
</author>
<author>
<name sortKey="Farinelli, L" uniqKey="Farinelli L">L Farinelli</name>
</author>
<author>
<name sortKey="Oster S, M" uniqKey="Oster S M">M Osterås</name>
</author>
<author>
<name sortKey="Schrenzel, J" uniqKey="Schrenzel J">J Schrenzel</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Manber, U" uniqKey="Manber U">U Manber</name>
</author>
<author>
<name sortKey="Myers, G" uniqKey="Myers G">G Myers</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Simpson, Jt" uniqKey="Simpson J">JT Simpson</name>
</author>
<author>
<name sortKey="Durbin, R" uniqKey="Durbin R">R Durbin</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Simpson, Jt" uniqKey="Simpson J">JT Simpson</name>
</author>
<author>
<name sortKey="Durbin, R" uniqKey="Durbin R">R Durbin</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Dinh, H" uniqKey="Dinh H">H Dinh</name>
</author>
<author>
<name sortKey="Rajasekaran, S" uniqKey="Rajasekaran S">S Rajasekaran</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="K Rkk Inen, J" uniqKey="K Rkk Inen J">J Kärkkäinen</name>
</author>
<author>
<name sortKey="Rantala, T" uniqKey="Rantala T">T Rantala</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Cormen, T" uniqKey="Cormen T">T Cormen</name>
</author>
<author>
<name sortKey="Leiserson, C" uniqKey="Leiserson C">C Leiserson</name>
</author>
<author>
<name sortKey="Rivest, R" uniqKey="Rivest R">R Rivest</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Steinbiss, S" uniqKey="Steinbiss S">S Steinbiss</name>
</author>
<author>
<name sortKey="Kurtz, S" uniqKey="Kurtz S">S Kurtz</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Bentley, J" uniqKey="Bentley J">J Bentley</name>
</author>
<author>
<name sortKey="Mcillroy, M" uniqKey="Mcillroy M">M McIllroy</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Abouelhoda, M" uniqKey="Abouelhoda M">M Abouelhoda</name>
</author>
<author>
<name sortKey="Kurtz, S" uniqKey="Kurtz S">S Kurtz</name>
</author>
<author>
<name sortKey="Ohlebusch, E" uniqKey="Ohlebusch E">E Ohlebusch</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Fredkin, E" uniqKey="Fredkin E">E Fredkin</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Ferragina, P" uniqKey="Ferragina P">P Ferragina</name>
</author>
<author>
<name sortKey="Grossi, R" uniqKey="Grossi R">R Grossi</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Bowden, T" uniqKey="Bowden T">T Bowden</name>
</author>
<author>
<name sortKey="Bauer, B" uniqKey="Bauer B">B Bauer</name>
</author>
<author>
<name sortKey="Nerin, J" uniqKey="Nerin J">J Nerin</name>
</author>
<author>
<name sortKey="Feng, S" uniqKey="Feng S">S Feng</name>
</author>
<author>
<name sortKey="Seibold, S" uniqKey="Seibold S">S Seibold</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Barthelson, R" uniqKey="Barthelson R">R Barthelson</name>
</author>
<author>
<name sortKey="Mcfarlin, Aj" uniqKey="Mcfarlin A">AJ McFarlin</name>
</author>
<author>
<name sortKey="Rounsley, Sd" uniqKey="Rounsley S">SD Rounsley</name>
</author>
<author>
<name sortKey="Young, S" uniqKey="Young S">S Young</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Kurtz, S" uniqKey="Kurtz S">S Kurtz</name>
</author>
<author>
<name sortKey="Phillippy, A" uniqKey="Phillippy A">A Phillippy</name>
</author>
<author>
<name sortKey="Delcher, A" uniqKey="Delcher A">A Delcher</name>
</author>
<author>
<name sortKey="Smoot, M" uniqKey="Smoot M">M Smoot</name>
</author>
<author>
<name sortKey="Shumway, M" uniqKey="Shumway M">M Shumway</name>
</author>
<author>
<name sortKey="Antonescu, C" uniqKey="Antonescu C">C Antonescu</name>
</author>
<author>
<name sortKey="Salzberg, S" uniqKey="Salzberg S">S Salzberg</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Earl, Da" uniqKey="Earl D">DA Earl</name>
</author>
<author>
<name sortKey="Bradnam, K" uniqKey="Bradnam K">K Bradnam</name>
</author>
<author>
<name sortKey="St John, J" uniqKey="St John J">J St John</name>
</author>
<author>
<name sortKey="Darling, A" uniqKey="Darling A">A Darling</name>
</author>
<author>
<name sortKey="Lin, D" uniqKey="Lin D">D Lin</name>
</author>
<author>
<name sortKey="Faas, J" uniqKey="Faas J">J Faas</name>
</author>
<author>
<name sortKey="Yu, Hok" uniqKey="Yu H">HOK Yu</name>
</author>
<author>
<name sortKey="Vince, B" uniqKey="Vince B">B Vince</name>
</author>
<author>
<name sortKey="Zerbino, Dr" uniqKey="Zerbino D">DR Zerbino</name>
</author>
<author>
<name sortKey="Diekhans, M" uniqKey="Diekhans M">M Diekhans</name>
</author>
<author>
<name sortKey="Nguyen, N" uniqKey="Nguyen N">N Nguyen</name>
</author>
<author>
<name sortKey="Nuwantha, P" uniqKey="Nuwantha P">P Nuwantha</name>
</author>
<author>
<name sortKey="Sung, Awk" uniqKey="Sung A">AWK Sung</name>
</author>
<author>
<name sortKey="Ning, Z" uniqKey="Ning Z">Z Ning</name>
</author>
<author>
<name sortKey="Haimel, M" uniqKey="Haimel M">M Haimel</name>
</author>
<author>
<name sortKey="Simpson, Jt" uniqKey="Simpson J">JT Simpson</name>
</author>
<author>
<name sortKey="Fronseca, Na" uniqKey="Fronseca N">NA Fronseca</name>
</author>
<author>
<name sortKey="Birol, I" uniqKey="Birol I">I Birol</name>
</author>
<author>
<name sortKey="Docking, Tr" uniqKey="Docking T">TR Docking</name>
</author>
<author>
<name sortKey="Ho, Iy" uniqKey="Ho I">IY Ho</name>
</author>
<author>
<name sortKey="Rokhsar, Ds" uniqKey="Rokhsar D">DS Rokhsar</name>
</author>
<author>
<name sortKey="Chikhi, R" uniqKey="Chikhi R">R Chikhi</name>
</author>
<author>
<name sortKey="Lavenier, D" uniqKey="Lavenier D">D Lavenier</name>
</author>
<author>
<name sortKey="Chapuis, G" uniqKey="Chapuis G">G Chapuis</name>
</author>
<author>
<name sortKey="Naquin, D" uniqKey="Naquin D">D Naquin</name>
</author>
<author>
<name sortKey="Maillet, N" uniqKey="Maillet N">N Maillet</name>
</author>
<author>
<name sortKey="Schatz, Mc" uniqKey="Schatz M">MC Schatz</name>
</author>
<author>
<name sortKey="Kelly, Dr" uniqKey="Kelly D">DR Kelly</name>
</author>
<author>
<name sortKey="Phillippy, Am" uniqKey="Phillippy A">AM Phillippy</name>
</author>
<author>
<name sortKey="Koren, S" uniqKey="Koren S">S Koren</name>
</author>
<author>
<name sortKey="Yang, Sp" uniqKey="Yang S">SP Yang</name>
</author>
<author>
<name sortKey="Wu, W" uniqKey="Wu W">W Wu</name>
</author>
<author>
<name sortKey="Chou, Wc" uniqKey="Chou W">WC Chou</name>
</author>
<author>
<name sortKey="Srivastava, A" uniqKey="Srivastava A">A Srivastava</name>
</author>
<author>
<name sortKey="Shaw, Ti" uniqKey="Shaw T">TI Shaw</name>
</author>
<author>
<name sortKey="Ruby, Jg" uniqKey="Ruby J">JG Ruby</name>
</author>
<author>
<name sortKey="Skewes Cox, P" uniqKey="Skewes Cox P">P Skewes-Cox</name>
</author>
<author>
<name sortKey="Betegon, M" uniqKey="Betegon M">M Betegon</name>
</author>
<author>
<name sortKey="Dimon, Mt" uniqKey="Dimon M">MT Dimon</name>
</author>
<author>
<name sortKey="Solovyev, V" uniqKey="Solovyev V">V Solovyev</name>
</author>
<author>
<name sortKey="Kosarev, P" uniqKey="Kosarev P">P Kosarev</name>
</author>
<author>
<name sortKey="Vorobyev, D" uniqKey="Vorobyev D">D Vorobyev</name>
</author>
<author>
<name sortKey="Ramirez Gonzalez, R" uniqKey="Ramirez Gonzalez R">R Ramirez-Gonzalez</name>
</author>
<author>
<name sortKey="Leggett, R" uniqKey="Leggett R">R Leggett</name>
</author>
<author>
<name sortKey="Maclean, D" uniqKey="Maclean D">D MacLean</name>
</author>
<author>
<name sortKey="Xia, F" uniqKey="Xia F">F Xia</name>
</author>
<author>
<name sortKey="Luo, R" uniqKey="Luo R">R Luo</name>
</author>
<author>
<name sortKey="L, Z" uniqKey="L Z">Z L</name>
</author>
<author>
<name sortKey="Xie, Y" uniqKey="Xie Y">Y Xie</name>
</author>
<author>
<name sortKey="Liu, B" uniqKey="Liu B">B Liu</name>
</author>
<author>
<name sortKey="Gnerre, S" uniqKey="Gnerre S">S Gnerre</name>
</author>
<author>
<name sortKey="Maccallum, I" uniqKey="Maccallum I">I MacCallum</name>
</author>
<author>
<name sortKey="Przybylski, D" uniqKey="Przybylski D">D Przybylski</name>
</author>
<author>
<name sortKey="Ribeiro, Fj" uniqKey="Ribeiro F">FJ Ribeiro</name>
</author>
<author>
<name sortKey="Yin, S" uniqKey="Yin S">S Yin</name>
</author>
<author>
<name sortKey="Sharpe, T" uniqKey="Sharpe T">T Sharpe</name>
</author>
<author>
<name sortKey="Hall, G" uniqKey="Hall G">G Hall</name>
</author>
<author>
<name sortKey="Kersey, Pj" uniqKey="Kersey P">PJ Kersey</name>
</author>
<author>
<name sortKey="Durbin, R" uniqKey="Durbin R">R Durbin</name>
</author>
<author>
<name sortKey="Jackman, Sd" uniqKey="Jackman S">SD Jackman</name>
</author>
<author>
<name sortKey="Chapman, Ja" uniqKey="Chapman J">JA Chapman</name>
</author>
<author>
<name sortKey="Huang, X" uniqKey="Huang X">X Huang</name>
</author>
<author>
<name sortKey="Derisi, Jl" uniqKey="Derisi J">JL DeRisi</name>
</author>
<author>
<name sortKey="Caccamo, M" uniqKey="Caccamo M">M Caccamo</name>
</author>
<author>
<name sortKey="Li, Y" uniqKey="Li Y">Y Li</name>
</author>
<author>
<name sortKey="Jaffe, Db" uniqKey="Jaffe D">DB Jaffe</name>
</author>
<author>
<name sortKey="Green, R" uniqKey="Green R">R Green</name>
</author>
<author>
<name sortKey="Haussler, D" uniqKey="Haussler D">D Haussler</name>
</author>
<author>
<name sortKey="Korf, I" uniqKey="Korf I">I Korf</name>
</author>
<author>
<name sortKey="Paten, B" uniqKey="Paten B">B Paten</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Gusfield, D" uniqKey="Gusfield D">D Gusfield</name>
</author>
<author>
<name sortKey="Landau, Gm" uniqKey="Landau G">GM Landau</name>
</author>
<author>
<name sortKey="Schieber, B" uniqKey="Schieber B">B Schieber</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Ohlebusch, E" uniqKey="Ohlebusch E">E Ohlebusch</name>
</author>
<author>
<name sortKey="Gog, S" uniqKey="Gog S">S Gog</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Kelley, D" uniqKey="Kelley D">D Kelley</name>
</author>
<author>
<name sortKey="Schatz, M" uniqKey="Schatz M">M Schatz</name>
</author>
<author>
<name sortKey="Salzberg, S" uniqKey="Salzberg S">S Salzberg</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Pop, M" uniqKey="Pop M">M Pop</name>
</author>
<author>
<name sortKey="Kosack, Ds" uniqKey="Kosack D">DS Kosack</name>
</author>
<author>
<name sortKey="Salzberg, Sl" uniqKey="Salzberg S">SL Salzberg</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Boetzer, M" uniqKey="Boetzer M">M Boetzer</name>
</author>
<author>
<name sortKey="Henkel, Cv" uniqKey="Henkel C">CV Henkel</name>
</author>
<author>
<name sortKey="Jansen, Hj" uniqKey="Jansen H">HJ Jansen</name>
</author>
<author>
<name sortKey="Butler, D" uniqKey="Butler D">D Butler</name>
</author>
<author>
<name sortKey="Pirovano, W" uniqKey="Pirovano W">W Pirovano</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Donmez, N" uniqKey="Donmez N">N Donmez</name>
</author>
<author>
<name sortKey="Brudno, M" uniqKey="Brudno M">M Brudno</name>
</author>
</analytic>
</biblStruct>
<biblStruct>
<analytic>
<author>
<name sortKey="Chikhi, R" uniqKey="Chikhi R">R Chikhi</name>
</author>
<author>
<name sortKey="Lavenier, D" uniqKey="Lavenier D">D Lavenier</name>
</author>
</analytic>
</biblStruct>
</listBibl>
</div1>
</back>
</TEI>
<affiliations>
<list>
<country>
<li>Allemagne</li>
</country>
<region>
<li>Hambourg</li>
</region>
<settlement>
<li>Hambourg</li>
</settlement>
</list>
<tree>
<country name="Allemagne">
<region name="Hambourg">
<name sortKey="Gonnella, Giorgio" sort="Gonnella, Giorgio" uniqKey="Gonnella G" first="Giorgio" last="Gonnella">Giorgio Gonnella</name>
</region>
<name sortKey="Kurtz, Stefan" sort="Kurtz, Stefan" uniqKey="Kurtz S" first="Stefan" last="Kurtz">Stefan Kurtz</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Sante/explor/MersV1/Data/Ncbi/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000956 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Ncbi/Checkpoint/biblio.hfd -nk 000956 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Sante
   |area=    MersV1
   |flux=    Ncbi
   |étape=   Checkpoint
   |type=    RBID
   |clé=     PMC:3507659
   |texte=   Readjoiner: a fast and memory efficient string graph-based sequence assembler
}}

Pour générer des pages wiki

HfdIndexSelect -h $EXPLOR_AREA/Data/Ncbi/Checkpoint/RBID.i   -Sk "pubmed:22559072" \
       | HfdSelect -Kh $EXPLOR_AREA/Data/Ncbi/Checkpoint/biblio.hfd   \
       | NlmPubMed2Wicri -a MersV1 

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Apr 20 23:26:43 2020. Site generation: Sat Mar 27 09:06:09 2021