(Q33920638)

30 July 2017

title

A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly (English)

1 reference

30 July 2017

1 reference

Hieu Dinh

1

1 reference

30 July 2017

Sanguthevar Rajasekaran

series ordinal

2

1 reference

30 July 2017

language of work or name

English

0 references

publication date

2 June 2011

1 reference

30 July 2017

1 reference

30 July 2017

volume

27

1 reference

30 July 2017

issue

14

1 reference

30 July 2017

page(s)

1901-1907

1 reference

Efficient construction of an assembly string graph using the FM-index

30 July 2017

cites work

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=3129531

PubMed Central

reference URL

Genome assembly reborn: recent computational challenges

5 July 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=3129531

PubMed Central

reference URL

The fragment assembly string graph

5 July 2018

1 reference

https://eutils.ncbi.nlm.nih.gov/entrez/eutils/elink.fcgi?dbfrom=pmc&linkname=pmc_refs_pubmed&retmode=json&id=3129531

PubMed Central

reference URL

10.1093/BIOINFORMATICS/BTR321

5 July 2018

Identifiers

DOI

1 reference

journals/bioinformatics/DinhR11

30 July 2017

1 reference

1 reference

DBLP Dataset 2021-01-02

28 January 2021

1 reference

30 July 2017

1 reference