专题：Genome Rearrangement Algorithms

This cluster of papers focuses on the study of genomic rearrangements, evolutionary genomics, and ancestral genome reconstruction. It explores topics such as comparative genomics, chromosome evolution, phylogenetic analysis based on gene order, genome distance estimation, breakpoint reuse in evolution, and the role of duplications and inversions in shaping genomes.
最新文献
Decoding Tree Genomes: From Genome Structure to Functional Gene Evolution and Application

article Full Text OpenAlex

Asymptotic Enumeration of Normal and Hybridization Networks via Tree Decoration

article Full Text OpenAlex

The Reliability and Fault Tolerance of Conditional Recursive Networks

article Full Text OpenAlex

An effective approach to enumerate universal cycles for k-permutations

article Full Text OpenAlex

The Merged Longest Common Increasing Subsequence Problem

article Full Text OpenAlex

ODD: Omni Differential Drive for Simultaneous Reconfiguration and Omnidirectional Mobility of Wheeled Robots

article Full Text OpenAlex

The Tree Labeling Polytope: A Unified Approach to Ancestral Reconstruction Problems

book-chapter Full Text OpenAlex

DETERMINATION OF THE UDDER NIPPLES’ POSITION AT MILKING ROBOTIZATION

article Full Text OpenAlex

Tsbrowse: an interactive browser for Ancestral Recombination Graphs

preprint Full Text OpenAlex

An Exact and Fast SAT Formulation for the DCJ Distance

book-chapter Full Text OpenAlex

近5年高被引文献
A high-quality bonobo genome refines the analysis of hominid evolution

article Full Text OpenAlex 64 FWCI4.512

Configuration Checking with Aspiration in Local Search for SAT

article Full Text OpenAlex 62 FWCI0.949

From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds

article Full Text OpenAlex 38 FWCI11.558

Reconstruction of hundreds of reference ancestral genomes across the eukaryotic kingdom

article Full Text OpenAlex 38 FWCI13.122

Computing the Rearrangement Distance of Natural Genomes

article Full Text OpenAlex 31 FWCI4.048

Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem

article Full Text OpenAlex 28 FWCI1.33

A general and efficient representation of ancestral recombination graphs

article Full Text OpenAlex 21 FWCI17.87

Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem

article Full Text OpenAlex 20 FWCI1.995

An improved memetic algebraic differential evolution for solving the multidimensional two-way number partitioning problem

article Full Text OpenAlex 20 FWCI2.106

Plant Mitochondria are a Riddle Wrapped in a Mystery Inside an Enigma

article Full Text OpenAlex 18 FWCI1.167