z-logo
open-access-imgOpen Access
EPGA2: memory-efficient de novo assembler
Author(s) -
Junwei Luo,
Jianxin Wang,
Weilong Li,
Zhen Zhang,
FangXiang Wu,
Min Li,
Yi Pan
Publication year - 2015
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btv487
Subject(s) - computer science , sequence assembly , pipeline (software) , contig , de bruijn sequence , de bruijn graph , construct (python library) , parallels , genome , reference genome , graph , theoretical computer science , parallel computing , programming language , biology , genetics , gene , mechanical engineering , gene expression , mathematics , transcriptome , discrete mathematics , engineering
In genome assembly, as coverage of sequencing and genome size growing, most current softwares require a large memory for handling a great deal of sequence data. However, most researchers usually cannot meet the requirements of computing resources which prevent most current softwares from practical applications.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom