Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Optimization Approaches for Solving String Selection Problems

From MaRDI portal
Publication:2851340
Jump to:navigation, search

DOI10.1007/978-1-4614-9053-1zbMath1408.90001OpenAlexW2468278191MaRDI QIDQ2851340

Giovanni Stracquadanio, Elisa Pappalardo, 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


zbMATH Keywords

DNA sequencegenomicsmathematical optimizationprotein sequencestring selection problem


Mathematics Subject Classification ID

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


Related Items (1)

Mathematical programming strategies for solving the minimum common string partition problem







This page was built for publication: Optimization Approaches for Solving String Selection Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2851340&oldid=15786941"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki