Name
Abstract | ||
|---|---|---|
A high quality assembly of reads, which are short fragments generated from shotgun sequencing, is a substantial part of the metagenome projects. Although traditional assemblers have been employed in initial analysis of the metagenomes, they cannot surmount the challenges created by the features of metagenomic data. We present a de novo assembly algorithm for metagenomes with mate pairs. Our method uses mate pair information to guide contig construction. More specifically, we developed an efficient algorithm to find the best mate pair threading paths from the overlap graph to construct contigs. Tests on simulated metagenome data show that our method produced more accurate assembly than Celera Assembler and Phrap when assembling contigs at a same level. © 2011 IEEE. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/BMEI.2011.6098547 | BMEI |
Keywords | Field | DocType |
de novo algorithm,mate pairs,metagenome,overlap graph,sequence assembly,genomics,molecular biophysics,dna,bioinformatics | Phrap,Computer science,Genomics,Contig,Artificial intelligence,Computational biology,Sequence assembly,Shotgun sequencing,Graph,Pattern recognition,Threading (manufacturing),Metagenomics,Genetics | Conference |
Volume | Issue | Citations |
3 | null | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Binbin Lai | 1 | 9 | 1.25 |
| Ruogu Ding | 2 | 142 | 4.14 |
| Huaiqiu Zhu | 3 | 162 | 15.27 |