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

Distances between Arbitrary Strings

Distances between Arbitrary Strings

(p.97) 8 Distances between Arbitrary Strings
Combinatorics of Genome Rearrangements

Guillaume Fertin

Anthony Labarre

Irena Rusu

Eric Tannier

Steéphane Vialette

The MIT Press

This chapter presents two main ideas to deal with arbitrary (that is, not necessarily balanced) strings. The first idea aims to transform strings into permutations, using the match-and-prune model in order to minimize the distance or maximize the similarity between the resulting permutations. Section 8.1 presents this model. The second idea is based on counting the number of operations needed to transform one string into another. Inserting, duplicating, replacing, or deleting a character or, more generally, a substring are operations that allow us to change the content of a string as needed. This is subsequently called the block edit model, which is surveyed in Section 8.2.

Keywords:   match-and-prune model, permutations, block edit model, arbitrary strings

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.