Comparative Genomics RECOMB 2007 International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007. Proceedings / [electronic resource] :
edited by Glenn Tesler, Dannie Durand.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
- XII, 193 p. online resource.
- Lecture Notes in Computer Science, 4751 0302-9743 ; .
- Lecture Notes in Computer Science, 4751 .
Multi-break Rearrangements: From Circular to Linear Genomes -- A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes -- Improving Inversion Median Computation Using Commuting Reversals and Cycle Information -- Inferring a Duplication, Speciation and Loss History from a Gene Tree (Extended Abstract) -- How to Achieve an Equivalent Simple Permutation in Linear Time -- Baculovirus Phylogeny Based on Genome Rearrangements -- Learning Gene Regulatory Networks via Globally Regularized Risk Minimization -- Evolution of Tandemly Arrayed Genes in Multiple Species -- Selecting Genomes for Reconstruction of Ancestral Genomes -- A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications -- Reconstructing an Inversion History in the Anopheles Gambiae Complex -- Recovering True Rearrangement Events on Phylogenetic Trees -- Parts of the Problem of Polyploids in Rearrangement Phylogeny -- A Rigorous Analysis of the Pattern of Intron Conservation Supports the Coelomata Clade of Animals.
9783540749608
10.1007/978-3-540-74960-8 doi
Computer science.
Data structures (Computer science).
Computer software.
Computational complexity.
Database management.
Bioinformatics.
Biology--Data processing.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Data Structures.
Database Management.
Computational Biology/Bioinformatics.
Computer Appl. in Life Sciences.
QA76.9.A43
005.1
Multi-break Rearrangements: From Circular to Linear Genomes -- A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes -- Improving Inversion Median Computation Using Commuting Reversals and Cycle Information -- Inferring a Duplication, Speciation and Loss History from a Gene Tree (Extended Abstract) -- How to Achieve an Equivalent Simple Permutation in Linear Time -- Baculovirus Phylogeny Based on Genome Rearrangements -- Learning Gene Regulatory Networks via Globally Regularized Risk Minimization -- Evolution of Tandemly Arrayed Genes in Multiple Species -- Selecting Genomes for Reconstruction of Ancestral Genomes -- A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications -- Reconstructing an Inversion History in the Anopheles Gambiae Complex -- Recovering True Rearrangement Events on Phylogenetic Trees -- Parts of the Problem of Polyploids in Rearrangement Phylogeny -- A Rigorous Analysis of the Pattern of Intron Conservation Supports the Coelomata Clade of Animals.
9783540749608
10.1007/978-3-540-74960-8 doi
Computer science.
Data structures (Computer science).
Computer software.
Computational complexity.
Database management.
Bioinformatics.
Biology--Data processing.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Data Structures.
Database Management.
Computational Biology/Bioinformatics.
Computer Appl. in Life Sciences.
QA76.9.A43
005.1