- Title Pages
- Preface
- Acknowledgments
-
1 Introduction -
2 Genomes as Permutations -
3 Distances between Unsigned Permutations -
4 Distances between Signed Permutations -
5 Rearrangements of Partial Orders -
6 Graph-Theoretic and Linear Algebra Formulations -
7 Generalities -
8 Distances between Arbitrary Strings -
9 Distances between Balanced Strings -
III Multichromosomal Models -
10 Paths and Cycles -
11 Cycles of a Permutation -
12 Set Systems and the Syntenic Distance -
IV Multigenomic Models -
13 Median and Halving Problems -
14 Rearrangement Phylogenies -
15 Software -
16 Open Problems -
A Graph Theory -
B Complexity Theory - [UNTITLED]
- Glossary
- Bibliography
- Index
Distances between Signed Permutations
Distances between Signed Permutations
- Chapter:
- (p.63) 4 Distances between Signed Permutations
- Source:
- Combinatorics of Genome Rearrangements
- Author(s):
Guillaume Fertin
Anthony Labarre
Irena Rusu
Eric Tannier
Steéphane Vialette
- Publisher:
- The MIT Press
Signed permutations allow the relative orientation of homologous markers to be taken into account and constitute a more biologically relevant model for genomes. Reversals, for instance, always change the strand of the reversed segment, so that the orientation of a gene inside the segment is also changed. Thus, whenever the orientation of genes is known and mutations that affect orientations are considered, it is better to use signed permutations as a model. This chapter discusses conserved interval distance; signed reversal distance; variants of sorting by reversals; combined operations; and double cut-and-joins.
Keywords: homologous markers, genomes, signed permutations, interval distance, reversal distance, double cut-and-joins
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.
- Title Pages
- Preface
- Acknowledgments
-
1 Introduction -
2 Genomes as Permutations -
3 Distances between Unsigned Permutations -
4 Distances between Signed Permutations -
5 Rearrangements of Partial Orders -
6 Graph-Theoretic and Linear Algebra Formulations -
7 Generalities -
8 Distances between Arbitrary Strings -
9 Distances between Balanced Strings -
III Multichromosomal Models -
10 Paths and Cycles -
11 Cycles of a Permutation -
12 Set Systems and the Syntenic Distance -
IV Multigenomic Models -
13 Median and Halving Problems -
14 Rearrangement Phylogenies -
15 Software -
16 Open Problems -
A Graph Theory -
B Complexity Theory - [UNTITLED]
- Glossary
- Bibliography
- Index
