Comparative Genomics: RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the RECOMB 2005 Satellite Workshop, the 3rd RECOMB Comparative Genomics meeting RCG 2005, held in Dublin, Ireland in September 2005.

The 14 revised full papers presented were carefully reviewed and selected from 21 initial submissions. The papers address a broad variety of aspects and components of the field of comparative genomics, ranging from new quantitative discoveries about genome structure and process to theorems on the complexity of computational problems inspired by genome comparison.

Author(s): Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu (auth.), Aoife McLysaght, Daniel H. Huson (eds.)
Series: Lecture Notes in Computer Science 3678 : Lecture Notes in Bioinformatics
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 168
Tags: Algorithm Analysis and Problem Complexity; Data Structures; Discrete Mathematics in Computer Science; Database Management; Bioinformatics; Computer Appl. in Life Sciences

Front Matter....Pages -
Lower Bounds for Maximum Parsimony with Gene Order Data....Pages 1-10
Genes Order and Phylogenetic Reconstruction: Application to γ -Proteobacteria....Pages 11-20
Maximizing Synteny Blocks to Identify Ancestral Homologs....Pages 21-34
An Expectation-Maximization Algorithm for Analysis of Evolution of Exon-Intron Structure of Eukaryotic Genes....Pages 35-46
Likely Scenarios of Intron Evolution....Pages 47-60
OMA, A Comprehensive, Automated Project for the Identification of Orthologs from Complete Genome Data: Introduction and First Achievements....Pages 61-72
The Incompatible Desiderata of Gene Cluster Properties....Pages 73-87
The String Barcoding Problem is NP-Hard....Pages 88-96
A Partial Solution to the C-Value Paradox....Pages 97-105
Individual Gene Cluster Statistics in Noisy Maps....Pages 106-120
Power Boosts for Cluster Tests....Pages 121-130
Reversals of Fortune....Pages 131-141
Very Low Power to Detect Asymmetric Divergence of Duplicated Genes....Pages 142-152
A Framework for Orthology Assignment from Gene Rearrangement Data....Pages 153-166
Back Matter....Pages -