Average-Case Analysis of Perfect Sorting by Reversals

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02441-2_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Sorting Permutations by Reversals Through Branch-And-Price

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2001English

The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems

2011English

Exploring the Solution Space of Sorting by Reversals, With Experiments and an Application to Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2008English

An Algorithm to Enumerate Sorting Reversals for Signed Permutations

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2003English

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2002English

Average Case Analysis of Dynamic Geometric Optimization

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
1996English

Average-Case Analysis of Dynamic Graph Algorithms

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Abstract Interpretation for Worst and Average Case Analysis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Bin Packing With Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

SIAM Journal on Discrete Mathematics
Mathematics
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy