- 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
Paths and Cycles
Paths and Cycles
- Chapter:
- (p.161) 10 Paths and Cycles
- Source:
- Combinatorics of Genome Rearrangements
- Author(s):
Guillaume Fertin
Anthony Labarre
Irena Rusu
Eric Tannier
Steéphane Vialette
- Publisher:
- The MIT Press
This chapter discusses the modeling of a genome with several chromosomes by a set of paths and cycles. The model captures all the information about the order of the genes and their partition into chromosomes. The discussion covers genomes; breakpoints; intervals; translocation distance; double cut-and-joins (2-break rearrangement); k-break rearrangement; fusions, fissions, translocations, and reversals; and rearrangements with partially ordered chromosomes.
Keywords: genomes, chromosomes, breakpoints, intervals, translocation distance, double cut-and-joins, reversals
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
