Efficient construction of an assembly string graph using the FM-index.
about
Trait variation in yeast is defined by population historyAn integrated map of genetic variation from 1,092 human genomesEfficient de novo assembly of large genomes using compressed data structuresProspects and limitations of full-text index structures in genome analysisDetection of Genomic Structural Variants from Next-Generation Sequencing DataSwabs to genomes: a comprehensive workflowIdentification of new genomospecies in the Mycobacterium terrae complexDe novo characterization of the gene-rich transcriptomes of two color-polymorphic spiders, Theridion grallator and T. californicum (Araneae: Theridiidae), with special reference to pigment genesThe Growing Importance of CNVs: New Insights for Detection and Clinical InterpretationsPARTA: a parallelized pipeline for integrated analysis of plant miRNA and cleaved mRNA data sets, including new miRNA target-identification softwarePopulation genomic datasets describing the post-vaccine evolutionary epidemiology of Streptococcus pneumoniaeNext-generation sequence assembly: four stages of data processing and computational challengesA scalable and accurate targeted gene assembly tool (SAT-Assembler) for next-generation sequencing data.Improved variant discovery through local re-alignment of short-read next-generation sequencing data using SRMA.A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.Assemblathon 1: a competitive assessment of de novo short read assembly methods.Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform.Readjoiner: a fast and memory efficient string graph-based sequence assembler.De novo assembly of highly diverse viral populations.An integrated pipeline for de novo assembly of microbial genomesWhat is the difference between the breakpoint graph and the de Bruijn graph?The transcript catalogue of the short-lived fish Nothobranchius furzeri provides insights into age-dependent changes of mRNA levels.metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequencesComparing memory-efficient genome assemblers on stand-alone and cloud infrastructuresMerging of multi-string BWTs with applicationsHorizontal DNA Transfer Mechanisms of Bacteria as Weapons of Intragenomic Conflict.Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.An improved genome assembly uncovers prolific tandem repeats in Atlantic codA comprehensive assessment of somatic mutation detection in cancer using whole-genome sequencing.Integrating mapping-, assembly- and haplotype-based approaches for calling variants in clinical sequencing applicationsPopulation genomics of post-vaccine changes in pneumococcal epidemiology.TIGRA: a targeted iterative graph routing assembler for breakpoint assembly.Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph.Next-generation sequencing and large genome assembliesRecent advances in sequence assembly: principles and applications.Forest harvesting reduces the soil metagenomic potential for biomass decompositionTwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes.Information-optimal genome assembly via sparse read-overlap graphs.LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.Integration of string and de Bruijn graphs for genome assembly.
P2860
Q21144951-BEA959F1-0CC4-4351-BCC2-E0C750B5ABF0Q22122153-9E8A6A24-0AAE-456F-9244-6835B1E67542Q24629007-CB418DB8-8FD0-43F3-A847-8AB0EDCCA2D3Q27026942-98928866-AFFD-4C45-B445-E118C2E35294Q28082859-9E16E8B0-0D00-4AA9-88D1-04AD09058213Q28647332-6EEBDF41-4C09-4134-AC9F-DE7BBBCB4C17Q28650544-5C153398-B6CD-44BB-9370-13F53F93C743Q28660890-76FB0D2A-3EA7-4839-9151-5B11B9B393A9Q28685216-67F8BE7F-C803-4209-BCD9-5ED611985E97Q30000664-2B097FA6-1C35-4B10-ABC0-FE4C694D6902Q30399651-91A76CF5-B651-4EEF-9D71-48318B93D8E8Q30717601-FF77A265-5A60-4C3D-A06B-E247683C7202Q30842667-04BCE181-7EC0-49E3-B052-6766100FF9ECQ33713232-BC80DF79-8102-4792-AE44-32A939901DC7Q33920638-B9AA3DC8-4EE8-460E-B640-181DDB3CFF16Q34217144-44AC0B8A-0815-435A-B6DB-96F9D5D9C85CQ34255822-CF6AF7AC-3C66-4DBF-A51D-0E50F6DCAE83Q34257755-D45EE50A-BD02-48BE-B73F-E53D7AA846F8Q34413887-8503D85F-C54C-4DE2-907C-61DFB8FE57D5Q34426729-27043ED3-889A-4FB4-89DA-DC475E825A06Q34557638-22B6CA8C-8F62-41CD-9E81-2E83B9A7A6D4Q34622011-681B280B-4A8B-4DB1-ABD8-F03F2FD1BBA6Q34756283-EFB4D6C5-BD18-4179-A1E2-78B7EFD4F282Q35005678-2BFBB28F-1D28-4349-B49C-51A598493C62Q35055235-3D94CE04-417F-4A09-969B-E3A0A25A5E77Q35943086-2C2EDED5-DCCF-4FD4-BD37-BBE51D9C39A1Q36011256-C0B0DF2E-C923-4443-920A-C2CB39EFFA3AQ36253056-8971E31F-765B-403E-9237-1EDB7FE26BEDQ36379244-8A26D52B-0521-4150-98D3-78D215354F1EQ36580250-4CFF7C38-7CD2-4BC6-A290-31E5E8B781A9Q37051002-991E75DD-627A-4636-99AB-3C3C541957ACQ37550246-698111F9-71EC-4057-B145-200A9FAA30A3Q37970068-8A79B42E-6989-4449-ADF7-F9779FFEB042Q38016945-0174155B-2808-4970-A7F9-FF2C549C2D90Q38814575-55BF5153-BE2B-46B1-8338-998A84AEF954Q39276543-521B2E0C-4072-43F2-9933-5B4EB3734AA8Q39360537-5BB7E90E-AC15-4039-87CB-1C5FFF7DE0C4Q39429428-B6609ADE-9ABD-4D2F-98AF-8D5B8B444C1BQ39605041-FEB85407-AF84-4FB6-B8E4-E97228C9A715Q40119280-1FF8B2AC-27A5-415B-ADC8-BED0F52A64F7
P2860
Efficient construction of an assembly string graph using the FM-index.
description
2010 nî lūn-bûn
@nan
2010 թուականի Յունիսին հրատարակուած գիտական յօդուած
@hyw
2010 թվականի հունիսին հրատարակված գիտական հոդված
@hy
2010年の論文
@ja
2010年論文
@yue
2010年論文
@zh-hant
2010年論文
@zh-hk
2010年論文
@zh-mo
2010年論文
@zh-tw
2010年论文
@wuu
name
Efficient construction of an assembly string graph using the FM-index.
@ast
Efficient construction of an assembly string graph using the FM-index.
@en
Efficient construction of an assembly string graph using the FM-index.
@nl
type
label
Efficient construction of an assembly string graph using the FM-index.
@ast
Efficient construction of an assembly string graph using the FM-index.
@en
Efficient construction of an assembly string graph using the FM-index.
@nl
prefLabel
Efficient construction of an assembly string graph using the FM-index.
@ast
Efficient construction of an assembly string graph using the FM-index.
@en
Efficient construction of an assembly string graph using the FM-index.
@nl
P2860
P356
P1433
P1476
Efficient construction of an assembly string graph using the FM-index.
@en
P2093
Jared T Simpson
P2860
P304
P356
10.1093/BIOINFORMATICS/BTQ217
P407
P577
2010-06-01T00:00:00Z