Jump to ContentJump to Main Navigation
Combinatorics of Genome Rearrangements$
Users without a subscription are not able to see the full content.

Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, and Stéphane Vialette

Print publication date: 2009

Print ISBN-13: 9780262062824

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262062824.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2022. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 02 July 2022

Rearrangements of Partial Orders

Rearrangements of Partial Orders

(p.75) 5 Rearrangements of Partial Orders
Combinatorics of Genome Rearrangements

Guillaume Fertin

Anthony Labarre

Irena Rusu

Eric Tannier

Steéphane Vialette

The MIT Press

Zheng et al. introduced a new representation of a genome in terms of a partially ordered set (often abbreviated as “poset”). In this model, any linear extension of a poset represents a possible total order of the genome. In the context of posets, a genome rearrangement problem is to find a linear extension in each poset such that a criterion (number of reversals, number of breakpoints, etc.) is optimized. This chapter focuses on handling rearrangements of gene partial orders.

Keywords:   genome rearrangement, partially ordered sets, posets, linear extension

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.