Algorithms and Computation

DOI10.1007/b104582zbMath1116.68472OpenAlexW2491382297MaRDI QIDQ5712138

Petr Kolman, Jie Zheng, Avraham Goldstein

Publication date: 22 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104582

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (21)

Sorting by multi-cut rearrangements ⋮ Mathematical programming strategies for solving the minimum common string partition problem ⋮ Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization ⋮ Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem ⋮ Approximating reversal distance for strings with bounded number of duplicates ⋮ Signed rearrangement distances considering repeated genes, intergenic regions, and indels ⋮ On the role of metaheuristic optimization in bioinformatics ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ An approximation algorithm for genome sorting by reversals to recover all adjacencies ⋮ Minimum common string partition revisited ⋮ Solving the maximum duo-preservation string mapping problem with linear programming ⋮ Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling ⋮ Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies ⋮ A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ ILP-based reduced variable neighborhood search for large-scale minimum common string partition ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem ⋮ Unnamed Item ⋮ The greedy algorithm for edit distance with moves ⋮ A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem ⋮ A 1.5-approximation algorithm for two-sided scaffold filling

This page was built for publication: Algorithms and Computation