Comparative Genomics: International Workshop, RECOMB-CG 2009, Budapest, Hungary, September 27-29, 2009, Proceedings

by Francesca D. Ciccarelli (Editor), István Miklós (Editor)

Overview

As genome-sequencing costs continue their downward spiral, sequencing of closely related organisms has become increasingly affordable. The growing amount of genomic data available demands for the constant development of computational tools to be applied in comparative genomics. The RECOMB Workshop on C- parative Genomics (RECOMB-CG) is devoted to bringing together scientists working on all aspects of comparative genomics, from computer scientists, ma- ematicians and statisticians working on novel computational approaches for genome analysis and comparison, to biologists applying these computational tools to study the structure and the evolution of prokaryotic and eukaryotic genomes. This volume contains the 19 papers presented at the 7th Annual RECOMB-CG workshop held during September 27–29, 2009 at the Renyi Institute, in Budapest, Hungary. The papers published in these proceedings were selected for oral p- sentation from 31 submissions from scientists around the world. Each paper was reviewed by at least three members of the Program Committee in a stringent and thoughtful peer-review process.

Product Details

ISBN-13:	9783642047435
Publisher:	Springer Berlin Heidelberg
Publication date:	11/13/2009
Series:	Lecture Notes in Computer Science , #5817
Edition description:	2009
Pages:	241
Product dimensions:	6.00(w) x 9.30(h) x 0.60(d)

Table of Contents

Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods.- Natural Parameter Values for Generalized Gene Adjacency.- Parking Functions, Labeled Trees and DCJ Sorting Scenarios.- Counting All DCJ Sorting Scenarios.- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction.- Finding Nested Common Intervals Efficiently.- DCJ Median Problems on Linear Multichromosomal Genomes: Graph Representation and Fast Exact Solutions.- Rearrangement Models and Single-Cut Operations.- Aligning Two Genomic Sequences That Contain Duplications.- Inferring the Recent Duplication History of a Gene Cluster.- Pseudo Boolean Programming for Partially Ordered Genomes.- Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization.- Reconstructing Histories of Complex Gene Clusters on a Phylogeny.- Co-evolutionary Models for Reconstructing Ancestral Genomic Sequences: Computational Issues and Biological Examples.- Whole-Genome Analysis of Gene Conversion Events.- A Statistically Fair Comparison of Ancestral Genome Reconstructions, Based on Breakpoint and Rearrangement Distances.- Comparative Genomics and Extensive Recombinations in Phage Communities.- Properties of Sequence Conservation in Upstream Regulatory and Protein Coding Sequences among Paralogs in Arabidopsis thaliana.- Transcription Factor Binding Probabilities in Orthologous Promoters: An Alignment-Free Approach to the Inference of Functional Regulatory Targets.