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, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 24 September 2021

Distances between Balanced Strings

Distances between Balanced Strings

Chapter:
(p.133) 9 Distances between Balanced Strings
Source:
Combinatorics of Genome Rearrangements
Author(s):

Guillaume Fertin

Anthony Labarre

Irena Rusu

Eric Tannier

Steéphane Vialette

Publisher:
The MIT Press
DOI:10.7551/mitpress/9780262062824.003.0009

Deletions, insertions, duplications, and replacement events are necessary to compare arbitrary strings, because the gene content of the strings is different. This chapter considers the case of balanced strings, where the equal gene content allows us to deal with duplicated genes without having to account for these edit operations. The discussions cover minimum common string partition problems; reversal distance; unsigned transpositions; unsigned block interchanges; and relations between distances.

Keywords:   duplicated genes, gene content, string partition problems, reversal distance, unsigned transpositions, block interchanges

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.