𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions

✍ Scribed by Martin Bader; Mohamed I Abouelhoda; Enno Ohlebusch

Book ID
115001518
Publisher
BioMed Central
Year
2008
Tongue
English
Weight
353 KB
Volume
9
Category
Article
ISSN
1471-2105

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for the picku
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
✍ Jean-FranΓ§ois CΓ΄tΓ©; Claudia Archetti; Maria Grazia Speranza; Michel Gendreau; Je πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 208 KB πŸ‘ 1 views

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item

A multiple time step algorithm compatibl
A multiple time step algorithm compatible with a large number of distance classes and an arbitrary distance dependence of the time step size for the fast evaluation of nonbonded interactions in molecular simulations
✍ Vincent KrΓ€utler; Philippe H. HΓΌnenberger πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update