A 1.375-Approximation Algorithm for Sorting by Transpositions

Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a 10-year-old open p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on computational biology and bioinformatics 2006-10, Vol.3 (4), p.369-379
Hauptverfasser:	Elias, I., Hartman, T.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation algorithms Bioinformatics Chromosome Mapping - methods Computational biology Computer science Datavetenskap DNA Mutational Analysis - methods DNA Transposable Elements - genetics Evolution (biology) Evolution, Molecular Genetic mutations genome rearrangements Genomics Information technology Informationsteknik Linkage Disequilibrium - genetics Organisms Robustness Sequence Analysis, DNA - methods Sequences Sorting sorting permutations by transpositions TECHNOLOGY TEKNIKVETENSKAP Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!