An efficient algorithm for the contig ordering problem under algebraic rearrangement distance

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 orie...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computational biology 2015-11, Vol.22 (11), p.975-987
1. Verfasser:	Lu, Chin Lung
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithms Assembling Biology Collection Contig Mapping Genomes High-Throughput Nucleotide Sequencing Models, Genetic Order disorder Permutations Sequence Analysis, DNA
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!