Heuristic approaches to the distinguishing substring selection problem

DOI10.1016/J.ENDM.2018.03.020MaRDI QIDQ1791942zbMATH OpenOpenAlexFDO

Authors Jean Torres, Emerson Silva, Edna A. Hoshino

Publication date 11 October 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.03.020

zbMATH Keywords

integer programmingvariable neighborhood searchrounding heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Recommendations

• LP-based heuristics for the distinguishing string and substring selection problems
• Fundamentals of Computation Theory
• Parameterized intractability of distinguishing substring selection
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• scientific article; zbMATH DE number 1998335
• Generalized substring selectivity estimation
• scientific article; zbMATH DE number 1305456
• scientific article; zbMATH DE number 2086667
• An algorithm for distinguishing efficiently bit-strings by their subsequences
• One-dimensional and multi-dimensional substring selectivity estimation

Cites work

• scientific article; zbMATH DE number 1305456 (Why is no real title available?)
• A closer look at the closest string and closest substring problem
• Improved LP-based algorithms for the closest string problem
• Variable neighbourhood search: Methods and applications

Cited in

(5)

• Generalized substring selectivity estimation
• Distinguishing string selection problems.
• scientific article; zbMATH DE number 1305456 (Why is no real title available?)
• LP-based heuristics for the distinguishing string and substring selection problems
• Fundamentals of Computation Theory

Describes a project that uses

Uses Software

• CPLEX
• SCIP

This page was built for publication: Heuristic approaches to the distinguishing substring selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791942)