- 자료제공 :
- 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.