专题: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.
最新文献
String Consensus Problems with Swaps and Substitutions

book-chapter Full Text OpenAlex

Novel Sweeping Methods for Robotic Rearrangement of Object Piles

article Full Text OpenAlex

Spanning cactus and spanning cactus extension of outerplanar graphs

article Full Text OpenAlex

Pattern avoidance in non-crossing and non-nesting permutations

article Full Text OpenAlex

Planning for Tabletop Object Rearrangement

article Full Text OpenAlex

ORLA*: Mobile Manipulator-Based Object Rearrangement with Lazy A*

article Full Text OpenAlex

Nearest-Neighbourless Asymptotically Optimal Motion Planning with Fully Connected Informed Trees (FCIT*)

article Full Text OpenAlex

An Algorithm for Computation of P-Value of Patterns Occurrences in a Random Sequence. Overlap Graph Minimization

article Full Text OpenAlex

Ancestral Pangenomes and Their Phylogenetic Reconstruction

book-chapter Full Text OpenAlex

Note on pancake sorting

article Full Text OpenAlex

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

article Full Text OpenAlex 156 FWCI22.688

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

article Full Text OpenAlex 66 FWCI4.514

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 43 FWCI12.001

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

article Full Text OpenAlex 40 FWCI10.165

Computing the Rearrangement Distance of Natural Genomes

article Full Text OpenAlex 33 FWCI4.055

A general and efficient representation of ancestral recombination graphs

article Full Text OpenAlex 28 FWCI14.113

Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem

article Full Text OpenAlex 28 FWCI1.332

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

article Full Text OpenAlex 24 FWCI1.998

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

article Full Text OpenAlex 21 FWCI1.167