专题: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.
最新文献
Combinatorics of \(m = 1\) grasstopes

article Full Text OpenAlex

Partial permutations comparison, maintenance and applications

article Full Text OpenAlex

Research progress on dynamic assembly and regulation of centromere

article Full Text OpenAlex

Rehabilitating the benefits of gene tree correction in the presence of incomplete lineage sorting

preprint Full Text OpenAlex

New Heuristics for Phylogeny Estimation under the Balanced Minimum Evolution Criterion

article Full Text OpenAlex

Upper Bounds for (Italian) Roman Domination of Graphs with More Legions

preprint Full Text OpenAlex

A Moss Growth Optimization Approach to Robot Path Planning

article Full Text OpenAlex

Extra deletion in retrospect and prospect

article Full Text OpenAlex

Extensive horizontal transfer of transposable elements shape fungal mobilomes

preprint Full Text OpenAlex

Deciding the Feasibility and Minimizing the Height of Tangles

article Full Text OpenAlex

近5年高被引文献
Pangenome graph construction from genome alignments with Minigraph-Cactus

article Full Text OpenAlex 140 FWCI23.754

A high-quality bonobo genome refines the analysis of hominid evolution

article Full Text OpenAlex 66 FWCI4.512

Configuration Checking with Aspiration in Local Search for SAT

article Full Text OpenAlex 62 FWCI0.949

Reconstruction of hundreds of reference ancestral genomes across the eukaryotic kingdom

article Full Text OpenAlex 41 FWCI12.679

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

article Full Text OpenAlex 38 FWCI11.148

Computing the Rearrangement Distance of Natural Genomes

article Full Text OpenAlex 32 FWCI4.057

Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem

article Full Text OpenAlex 28 FWCI1.332

A general and efficient representation of ancestral recombination graphs

article Full Text OpenAlex 22 FWCI15.962

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

article Full Text OpenAlex 21 FWCI2.109

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

article Full Text OpenAlex 20 FWCI1.995