The greedy path-merging algorithm for sequence assembly
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Bioinformatics—an introduction for computer scientists
ACM Computing Surveys (CSUR)
Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Localized genome assembly from reads to scaffolds: practical traversal of the paired string graph
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Using inversion signatures to generate draft genome sequence scaffolds
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Scalable genome scaffolding using integer linear programming
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
| Hi-index | 0.00 |
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as possible. This paper describes an efficient heuristic called the greedy-path merging algorithm for solving this problem. The method was originally developed as a key component of the compartmentalized assembly strategy developed at Celera Genomics. This interim approach was used at an early stage of the sequencing of the human genome to produce a preliminary assembly based on preliminary whole genome shotgun data produced at Celera and preliminary human contigs produced by the Human Genome Project.