Combinatorics of genome rearrangements / Guillaume Fertin ... [et al.] [E-Book]
Saved in:
Full text |
|
Personal Name(s): | Fertin, Guillaume |
Imprint: |
Cambridge, Mass. :
MIT Press,
c2009
|
Physical Description: |
xi, 288 pages : illustrations |
Note: |
englisch |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Computational molecular biology
|
Subject (LOC): |
- Genomes as permutations
- Distances between unsigned permutations
- Distances between signed permutations
- Rearrangements of partial orders
- Graph-theoretic and linear algebra formulations
- Generalities
- Distances between arbitrary strings
- Distances between balanced strings
- Paths and cycles
- Cycles of a permutation
- Set systems and the syntenic distance
- Median and halving problems
- Rearrangement phylogenies
- Software
- Open problems.