Skip to main content
  • Conference proceedings
  • © 2005

Comparative Genomics

RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3678)

Part of the book sub series: Lecture Notes in Bioinformatics (LNBI)

Conference series link(s): RCG: RECOMB Workshop on Comparative Genomics

Conference proceedings info: RCG 2005.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (14 papers)

  1. Front Matter

  2. Lower Bounds for Maximum Parsimony with Gene Order Data

    • Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
    Pages 1-10
  3. Genes Order and Phylogenetic Reconstruction: Application to γ-Proteobacteria

    • Guillaume Blin, Cedric Chauve, Guillaume Fertin
    Pages 11-20
  4. Maximizing Synteny Blocks to Identify Ancestral Homologs

    • Guillaume Bourque, Yasmine Yacef, Nadia El-Mabrouk
    Pages 21-34
  5. An Expectation-Maximization Algorithm for Analysis of Evolution of Exon-Intron Structure of Eukaryotic Genes

    • Liran Carmel, Igor B. Rogozin, Yuri I. Wolf, Eugene V. Koonin
    Pages 35-46
  6. Likely Scenarios of Intron Evolution

    • Miklós Csűrös
    Pages 47-60
  7. OMA, A Comprehensive, Automated Project for the Identification of Orthologs from Complete Genome Data: Introduction and First Achievements

    • Christophe Dessimoz, Gina Cannarozzi, Manuel Gil, Daniel Margadant, Alexander Roth, Adrian Schneider et al.
    Pages 61-72
  8. The Incompatible Desiderata of Gene Cluster Properties

    • Rose Hoberman, Dannie Durand
    Pages 73-87
  9. The String Barcoding Problem is NP-Hard

    • Marcello Dalpasso, Giuseppe Lancia, Romeo Rizzi
    Pages 88-96
  10. A Partial Solution to the C-Value Paradox

    • Jeffrey M. Marcus
    Pages 97-105
  11. Individual Gene Cluster Statistics in Noisy Maps

    • Narayanan Raghupathy, Dannie Durand
    Pages 106-120
  12. Power Boosts for Cluster Tests

    • David Sankoff, Lani Haque
    Pages 121-130
  13. Reversals of Fortune

    • David Sankoff, Chungfang Zheng, Aleksander Lenert
    Pages 131-141
  14. Very Low Power to Detect Asymmetric Divergence of Duplicated Genes

    • Cathal Seoighe, Konrad Scheffler
    Pages 142-152
  15. A Framework for Orthology Assignment from Gene Rearrangement Data

    • Krister M. Swenson, Nicholas D. Pattengale, B. M. E. Moret
    Pages 153-166
  16. Back Matter

Other Volumes

  1. Comparative Genomics

Keywords

  • algorithm
  • algorithms
  • calculus
  • comparative genomics
  • complexity
  • computational biology
  • computational genomics
  • genome
  • genome algorithms
  • genome comparison
  • genome structure
  • genomics
  • matching
  • orthology
  • statistics
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • University of Dublin, Smurfit Institute of Genetics, Trinity College, Ireland

    Aoife McLysaght

  • Center for Bioinformatics ZBIT, Tübingen University, Sand 14, Tübingen, Germany

    Daniel H. Huson

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions