Amazon cover image
Image from Amazon.com

Combinatorics of genome rearrangements / Guillaume Fertin [and others].

Contributor(s): Material type: TextTextSeries: Computational molecular biologyPublication details: Cambridge, Mass. : MIT Press, ©2009.Description: 1 online resource (xi, 288 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780262258753
  • 0262258757
  • 0262258188
  • 9780262258180
Subject(s): Genre/Form: Additional physical formats: Print version:: Combinatorics of genome rearrangements.DDC classification:
  • 572.8/77 22
LOC classification:
  • QH462.T7 C66 2009eb
NLM classification:
  • 2009 H-177
  • QU 450
Other classification:
  • ST 690
  • BIO 180f
  • BIO 110f
Online resources:
Contents:
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.
Summary: A comprehensive survey of a rapidly expanding field of combinatorial optimization, mathematically orientated but offering biological explanations when required, this volume offers the first comprehensive survey of a rapidly expanding application of combinatorial optimization.
Item type:
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Collection Call number Materials specified Status Date due Barcode
Electronic-Books Electronic-Books OPJGU Sonepat- Campus E-Books EBSCO Available

Includes bibliographical references (pages 263-282) and index.

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.

Print version record.

A comprehensive survey of a rapidly expanding field of combinatorial optimization, mathematically orientated but offering biological explanations when required, this volume offers the first comprehensive survey of a rapidly expanding application of combinatorial optimization.

English.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.

O.P. Jindal Global University, Sonepat-Narela Road, Sonepat, Haryana (India) - 131001

Send your feedback to glus@jgu.edu.in

Hosted, Implemented & Customized by: BestBookBuddies   |   Maintained by: Global Library