Computer Science – Data Structures and Algorithms
Scientific paper
2011-07-06
Computer Science
Data Structures and Algorithms
Scientific paper
We address the problem of finding the minimal number of block interchanges
(exchange of two intervals) required to transform a duplicated linear genome
into a tandem duplicated linear genome. We provide a formula for the distance
as well as a polynomial time algorithm for the sorting problem.
Ouangraoua Aida
Thomas Antoine
Varré Jean-Stéphane
No associations
LandOfFree
Genome Halving by Block Interchange does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Genome Halving by Block Interchange, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Genome Halving by Block Interchange will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-677884