Efficient algorithms for multichromosomal genome rearrangements

Author: Tesler G.

Source: Journal of Computer and System Sciences, Volume 65, Number 3, November 2002 , pp. 587-609(23)

Publisher: Academic Press

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

Hannenhalli and Pevzner (36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, IEEE Computer Soc. Press, Los Alamitos, CA, 1995, p. 581) gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichromosomal genome to another when both have the same set of genes without repeats. We fixed some problems with the construction: (1) They claim it can exhibit such a sequence of steps, but there was a gap in the construction. (2) Their construction had an asymmetry in the number of chromosomes in the two genomes, whereby forward scenarios could have fissions but not fusions.

We also improved the speed by combining the algorithm with the algorithm of Bader et al. (J. Comput. Biol. 8 (5) (2001) 483) that computes reversal distances for permutations in linear time.

© 2002 Elsevier Science (USA)

Language: English

Document Type: Research article

DOI: 10.1016/S0022-0000(02)00011-9

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$54.13 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A