title: An efficient algorithm for the contig ordering problem under algebraic rearrangement distance.
abstract: Assembling a genome from short reads currently obtained by next-generation sequencing techniques often results in a collection of contigs, whose relative position and orientation along the genome being sequenced are unknown. Given two sets of contigs, the contig ordering problem is to order and orient the contigs in each set such that the genome rearrangement distance between the resulting sets of ordered and oriented contigs is minimized. In this article, we utilize the permutation groups in algebra to propose a near-linear time algorithm for solving the contig ordering problem under algebraic rearrangement distance, where the algebraic rearrangement distance between two sets of ordered and oriented contigs is the minimum weight of applicable rearrangement operations required to transform one set into the other.
authors.affiliation: Department of Computer Science, National Tsing Hua University , Hsinchu, Taiwan .
authors.forename: Chin Lung
authors.initials: CL
authors.lastname: Lu
mesh_terms: D000465:Algorithms; D020451:Contig Mapping; D059014:High-Throughput Nucleotide Sequencing; D008957:Models, Genetic; D017422:Sequence Analysis, DNA
keywords: algebraic rearrangement distance; contig ordering problem; next generation sequencing; permutation group