Optimization approaches for solving string selection problems

DOI10.1007/978-1-4614-9053-1zbMATH Open1408.90001OpenAlexW2468278191MaRDI QIDQ2851340FDOQ2851340

Authors: Elisa Pappalardo, Giovanni Stracquadanio, Panos M. Pardalos 

Publication date: 10 October 2013

Published in: SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-9053-1

Recommendations

• On the far from most string problem, one of the hardest string selection problems
• An optimization modelling for string selection in molecular biology using Pareto optimality
• On some optimization problems in molecular biology
• scientific article; zbMATH DE number 1754502
• Algorithmic aspects of bioinformatics. Translated from the German original

zbMATH Keywords

DNA sequencegenomicsmathematical optimizationprotein sequencestring selection problem

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Protein sequences, DNA sequences (92D20) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Algorithms on strings (68W32)

Cited In (4)

• Mathematical programming strategies for solving the minimum common string partition problem
• Distinguishing string selection problems.
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Optimization approaches for solving string selection problems

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