Querying large read collections in main memory: a versatile data structure.
Identifieur interne : 001E67 ( PubMed/Curation ); précédent : 001E66; suivant : 001E68Querying large read collections in main memory: a versatile data structure.
Auteurs : Nicolas Philippe [France] ; Mikaël Salson ; Thierry Lecroq ; Martine Léonard ; Thérèse Commes ; Eric RivalsSource :
- BMC bioinformatics [ 1471-2105 ] ; 2011.
Descripteurs français
- KwdFr :
- MESH :
English descriptors
- KwdEn :
- MESH :
Abstract
High Throughput Sequencing (HTS) is now heavily exploited for genome (re-) sequencing, metagenomics, epigenomics, and transcriptomics and requires different, but computer intensive bioinformatic analyses. When a reference genome is available, mapping reads on it is the first step of this analysis. Read mapping programs owe their efficiency to the use of involved genome indexing data structures, like the Burrows-Wheeler transform. Recent solutions index both the genome, and the k-mers of the reads using hash-tables to further increase efficiency and accuracy. In various contexts (e.g. assembly or transcriptome analysis), read processing requires to determine the sub-collection of reads that are related to a given sequence, which is done by searching for some k-mers in the reads. Currently, many developments have focused on genome indexing structures for read mapping, but the question of read indexing remains broadly unexplored. However, the increase in sequence throughput urges for new algorithmic solutions to query large read collections efficiently.
DOI: 10.1186/1471-2105-12-242
PubMed: 21682852
Links toward previous steps (curation, corpus...)
- to stream PubMed, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001E67
Links to Exploration step
pubmed:21682852Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Querying large read collections in main memory: a versatile data structure.</title>
<author><name sortKey="Philippe, Nicolas" sort="Philippe, Nicolas" uniqKey="Philippe N" first="Nicolas" last="Philippe">Nicolas Philippe</name>
<affiliation wicri:level="1"><nlm:affiliation>LIRMM, UMR 5506, CNRS and Université de Montpellier 2, CC 477, 161 rue Ada, 34095 Montpellier, France.</nlm:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>LIRMM, UMR 5506, CNRS and Université de Montpellier 2, CC 477, 161 rue Ada, 34095 Montpellier</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Salson, Mikael" sort="Salson, Mikael" uniqKey="Salson M" first="Mikaël" last="Salson">Mikaël Salson</name>
</author>
<author><name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
</author>
<author><name sortKey="Leonard, Martine" sort="Leonard, Martine" uniqKey="Leonard M" first="Martine" last="Léonard">Martine Léonard</name>
</author>
<author><name sortKey="Commes, Therese" sort="Commes, Therese" uniqKey="Commes T" first="Thérèse" last="Commes">Thérèse Commes</name>
</author>
<author><name sortKey="Rivals, Eric" sort="Rivals, Eric" uniqKey="Rivals E" first="Eric" last="Rivals">Eric Rivals</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PubMed</idno>
<date when="2011">2011</date>
<idno type="RBID">pubmed:21682852</idno>
<idno type="pmid">21682852</idno>
<idno type="doi">10.1186/1471-2105-12-242</idno>
<idno type="wicri:Area/PubMed/Corpus">001E67</idno>
<idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Corpus" wicri:corpus="PubMed">001E67</idno>
<idno type="wicri:Area/PubMed/Curation">001E67</idno>
<idno type="wicri:explorRef" wicri:stream="PubMed" wicri:step="Curation">001E67</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Querying large read collections in main memory: a versatile data structure.</title>
<author><name sortKey="Philippe, Nicolas" sort="Philippe, Nicolas" uniqKey="Philippe N" first="Nicolas" last="Philippe">Nicolas Philippe</name>
<affiliation wicri:level="1"><nlm:affiliation>LIRMM, UMR 5506, CNRS and Université de Montpellier 2, CC 477, 161 rue Ada, 34095 Montpellier, France.</nlm:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>LIRMM, UMR 5506, CNRS and Université de Montpellier 2, CC 477, 161 rue Ada, 34095 Montpellier</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Salson, Mikael" sort="Salson, Mikael" uniqKey="Salson M" first="Mikaël" last="Salson">Mikaël Salson</name>
</author>
<author><name sortKey="Lecroq, Thierry" sort="Lecroq, Thierry" uniqKey="Lecroq T" first="Thierry" last="Lecroq">Thierry Lecroq</name>
</author>
<author><name sortKey="Leonard, Martine" sort="Leonard, Martine" uniqKey="Leonard M" first="Martine" last="Léonard">Martine Léonard</name>
</author>
<author><name sortKey="Commes, Therese" sort="Commes, Therese" uniqKey="Commes T" first="Thérèse" last="Commes">Thérèse Commes</name>
</author>
<author><name sortKey="Rivals, Eric" sort="Rivals, Eric" uniqKey="Rivals E" first="Eric" last="Rivals">Eric Rivals</name>
</author>
</analytic>
<series><title level="j">BMC bioinformatics</title>
<idno type="eISSN">1471-2105</idno>
<imprint><date when="2011" type="published">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term>
<term>Computational Biology (methods)</term>
<term>Computers</term>
<term>High-Throughput Nucleotide Sequencing</term>
<term>Humans</term>
<term>Software</term>
</keywords>
<keywords scheme="KwdFr" xml:lang="fr"><term>Algorithmes</term>
<term>Biologie informatique ()</term>
<term>Humains</term>
<term>Logiciel</term>
<term>Ordinateurs</term>
<term>Séquençage nucléotidique à haut débit</term>
</keywords>
<keywords scheme="MESH" qualifier="methods" xml:lang="en"><term>Computational Biology</term>
</keywords>
<keywords scheme="MESH" xml:lang="en"><term>Algorithms</term>
<term>Computers</term>
<term>High-Throughput Nucleotide Sequencing</term>
<term>Humans</term>
<term>Software</term>
</keywords>
<keywords scheme="MESH" xml:lang="fr"><term>Algorithmes</term>
<term>Biologie informatique</term>
<term>Humains</term>
<term>Logiciel</term>
<term>Ordinateurs</term>
<term>Séquençage nucléotidique à haut débit</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">High Throughput Sequencing (HTS) is now heavily exploited for genome (re-) sequencing, metagenomics, epigenomics, and transcriptomics and requires different, but computer intensive bioinformatic analyses. When a reference genome is available, mapping reads on it is the first step of this analysis. Read mapping programs owe their efficiency to the use of involved genome indexing data structures, like the Burrows-Wheeler transform. Recent solutions index both the genome, and the k-mers of the reads using hash-tables to further increase efficiency and accuracy. In various contexts (e.g. assembly or transcriptome analysis), read processing requires to determine the sub-collection of reads that are related to a given sequence, which is done by searching for some k-mers in the reads. Currently, many developments have focused on genome indexing structures for read mapping, but the question of read indexing remains broadly unexplored. However, the increase in sequence throughput urges for new algorithmic solutions to query large read collections efficiently.</div>
</front>
</TEI>
<pubmed><MedlineCitation Status="MEDLINE" IndexingMethod="Curated" Owner="NLM"><PMID Version="1">21682852</PMID>
<DateCompleted><Year>2011</Year>
<Month>11</Month>
<Day>01</Day>
</DateCompleted>
<DateRevised><Year>2018</Year>
<Month>12</Month>
<Day>01</Day>
</DateRevised>
<Article PubModel="Electronic"><Journal><ISSN IssnType="Electronic">1471-2105</ISSN>
<JournalIssue CitedMedium="Internet"><Volume>12</Volume>
<PubDate><Year>2011</Year>
<Month>Jun</Month>
<Day>17</Day>
</PubDate>
</JournalIssue>
<Title>BMC bioinformatics</Title>
<ISOAbbreviation>BMC Bioinformatics</ISOAbbreviation>
</Journal>
<ArticleTitle>Querying large read collections in main memory: a versatile data structure.</ArticleTitle>
<Pagination><MedlinePgn>242</MedlinePgn>
</Pagination>
<ELocationID EIdType="doi" ValidYN="Y">10.1186/1471-2105-12-242</ELocationID>
<Abstract><AbstractText Label="BACKGROUND" NlmCategory="BACKGROUND">High Throughput Sequencing (HTS) is now heavily exploited for genome (re-) sequencing, metagenomics, epigenomics, and transcriptomics and requires different, but computer intensive bioinformatic analyses. When a reference genome is available, mapping reads on it is the first step of this analysis. Read mapping programs owe their efficiency to the use of involved genome indexing data structures, like the Burrows-Wheeler transform. Recent solutions index both the genome, and the k-mers of the reads using hash-tables to further increase efficiency and accuracy. In various contexts (e.g. assembly or transcriptome analysis), read processing requires to determine the sub-collection of reads that are related to a given sequence, which is done by searching for some k-mers in the reads. Currently, many developments have focused on genome indexing structures for read mapping, but the question of read indexing remains broadly unexplored. However, the increase in sequence throughput urges for new algorithmic solutions to query large read collections efficiently.</AbstractText>
<AbstractText Label="RESULTS" NlmCategory="RESULTS">Here, we present a solution, named Gk arrays, to index large collections of reads, an algorithm to build the structure, and procedures to query it. Once constructed, the index structure is kept in main memory and is repeatedly accessed to answer queries like "given a k-mer, get the reads containing this k-mer (once/at least once)". We compared our structure to other solutions that adapt uncompressed indexing structures designed for long texts and show that it processes queries fast, while requiring much less memory. Our structure can thus handle larger read collections. We provide examples where such queries are adapted to different types of read analysis (SNP detection, assembly, RNA-Seq).</AbstractText>
<AbstractText Label="CONCLUSIONS" NlmCategory="CONCLUSIONS">Gk arrays constitute a versatile data structure that enables fast and more accurate read analysis in various contexts. The Gk arrays provide a flexible brick to design innovative programs that mine efficiently genomics, epigenomics, metagenomics, or transcriptomics reads. The Gk arrays library is available under Cecill (GPL compliant) license from http://www.atgc-montpellier.fr/ngs/.</AbstractText>
</Abstract>
<AuthorList CompleteYN="Y"><Author ValidYN="Y"><LastName>Philippe</LastName>
<ForeName>Nicolas</ForeName>
<Initials>N</Initials>
<AffiliationInfo><Affiliation>LIRMM, UMR 5506, CNRS and Université de Montpellier 2, CC 477, 161 rue Ada, 34095 Montpellier, France.</Affiliation>
</AffiliationInfo>
</Author>
<Author ValidYN="Y"><LastName>Salson</LastName>
<ForeName>Mikaël</ForeName>
<Initials>M</Initials>
</Author>
<Author ValidYN="Y"><LastName>Lecroq</LastName>
<ForeName>Thierry</ForeName>
<Initials>T</Initials>
</Author>
<Author ValidYN="Y"><LastName>Léonard</LastName>
<ForeName>Martine</ForeName>
<Initials>M</Initials>
</Author>
<Author ValidYN="Y"><LastName>Commes</LastName>
<ForeName>Thérèse</ForeName>
<Initials>T</Initials>
</Author>
<Author ValidYN="Y"><LastName>Rivals</LastName>
<ForeName>Eric</ForeName>
<Initials>E</Initials>
</Author>
</AuthorList>
<Language>eng</Language>
<PublicationTypeList><PublicationType UI="D016428">Journal Article</PublicationType>
<PublicationType UI="D013485">Research Support, Non-U.S. Gov't</PublicationType>
</PublicationTypeList>
<ArticleDate DateType="Electronic"><Year>2011</Year>
<Month>06</Month>
<Day>17</Day>
</ArticleDate>
</Article>
<MedlineJournalInfo><Country>England</Country>
<MedlineTA>BMC Bioinformatics</MedlineTA>
<NlmUniqueID>100965194</NlmUniqueID>
<ISSNLinking>1471-2105</ISSNLinking>
</MedlineJournalInfo>
<CitationSubset>IM</CitationSubset>
<MeshHeadingList><MeshHeading><DescriptorName UI="D000465" MajorTopicYN="Y">Algorithms</DescriptorName>
</MeshHeading>
<MeshHeading><DescriptorName UI="D019295" MajorTopicYN="N">Computational Biology</DescriptorName>
<QualifierName UI="Q000379" MajorTopicYN="Y">methods</QualifierName>
</MeshHeading>
<MeshHeading><DescriptorName UI="D003201" MajorTopicYN="Y">Computers</DescriptorName>
</MeshHeading>
<MeshHeading><DescriptorName UI="D059014" MajorTopicYN="Y">High-Throughput Nucleotide Sequencing</DescriptorName>
</MeshHeading>
<MeshHeading><DescriptorName UI="D006801" MajorTopicYN="N">Humans</DescriptorName>
</MeshHeading>
<MeshHeading><DescriptorName UI="D012984" MajorTopicYN="N">Software</DescriptorName>
</MeshHeading>
</MeshHeadingList>
</MedlineCitation>
<PubmedData><History><PubMedPubDate PubStatus="received"><Year>2010</Year>
<Month>11</Month>
<Day>26</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="accepted"><Year>2011</Year>
<Month>06</Month>
<Day>17</Day>
</PubMedPubDate>
<PubMedPubDate PubStatus="entrez"><Year>2011</Year>
<Month>6</Month>
<Day>21</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
<PubMedPubDate PubStatus="pubmed"><Year>2011</Year>
<Month>6</Month>
<Day>21</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
<PubMedPubDate PubStatus="medline"><Year>2011</Year>
<Month>11</Month>
<Day>2</Day>
<Hour>6</Hour>
<Minute>0</Minute>
</PubMedPubDate>
</History>
<PublicationStatus>epublish</PublicationStatus>
<ArticleIdList><ArticleId IdType="pubmed">21682852</ArticleId>
<ArticleId IdType="pii">1471-2105-12-242</ArticleId>
<ArticleId IdType="doi">10.1186/1471-2105-12-242</ArticleId>
<ArticleId IdType="pmc">PMC3163563</ArticleId>
</ArticleIdList>
<ReferenceList><Reference><Citation>Genome Biol. 2004;5(2):R12</Citation>
<ArticleIdList><ArticleId IdType="pubmed">14759262</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2011 Jun 1;27(11):1455-61</Citation>
<ArticleIdList><ArticleId IdType="pubmed">21471014</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Genome Biol. 2008;9(12):R175</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19087247</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Nature. 2009 Mar 5;458(7234):97-101</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19136943</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Nature. 2009 Mar 12;458(7235):239-42</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19279641</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2009 Apr 15;25(8):1084-5</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19246510</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2009 Jul 15;25(14):1754-60</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19451168</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2009 Sep 1;25(17):2157-63</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19542152</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Nucleic Acids Res. 2009 Aug;37(15):e104</Citation>
<ArticleIdList><ArticleId IdType="pubmed">19531739</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Nature. 2010 Feb 18;463(7283):943-7</Citation>
<ArticleIdList><ArticleId IdType="pubmed">20164927</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2010 May 15;26(10):1284-90</Citation>
<ArticleIdList><ArticleId IdType="pubmed">20378555</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Nat Biotechnol. 2010 May;28(5):511-5</Citation>
<ArticleIdList><ArticleId IdType="pubmed">20436464</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Genomics. 2010 Jun;95(6):315-27</Citation>
<ArticleIdList><ArticleId IdType="pubmed">20211242</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Nat Methods. 2010 Aug;7(8):576-7</Citation>
<ArticleIdList><ArticleId IdType="pubmed">20676076</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Brief Bioinform. 2010 Sep;11(5):473-83</Citation>
<ArticleIdList><ArticleId IdType="pubmed">20460430</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2011 Feb 1;27(3):295-302</Citation>
<ArticleIdList><ArticleId IdType="pubmed">21115437</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2011 Feb 15;27(4):479-86</Citation>
<ArticleIdList><ArticleId IdType="pubmed">21245053</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>Bioinformatics. 2011 Mar 15;27(6):764-70</Citation>
<ArticleIdList><ArticleId IdType="pubmed">21217122</ArticleId>
</ArticleIdList>
</Reference>
<Reference><Citation>J Mol Biol. 1990 Oct 5;215(3):403-10</Citation>
<ArticleIdList><ArticleId IdType="pubmed">2231712</ArticleId>
</ArticleIdList>
</Reference>
</ReferenceList>
</PubmedData>
</pubmed>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Sante/explor/MersV1/Data/PubMed/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001E67 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PubMed/Curation/biblio.hfd -nk 001E67 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Sante |area= MersV1 |flux= PubMed |étape= Curation |type= RBID |clé= pubmed:21682852 |texte= Querying large read collections in main memory: a versatile data structure. }}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/PubMed/Curation/RBID.i -Sk "pubmed:21682852" \ | HfdSelect -Kh $EXPLOR_AREA/Data/PubMed/Curation/biblio.hfd \ | NlmPubMed2Wicri -a MersV1
![]() | This area was generated with Dilib version V0.6.33. | ![]() |