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

Minimum Interval Cover and Its Application to Genome Sequencing

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

DOI10.1007/978-3-642-22616-8_23zbMath1342.68145OpenAlexW6172527MaRDI QIDQ5199157

Liang Ding, Binhai Zhu, Bin Fu

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_23



Mathematics Subject Classification ID

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


Related Items (2)

Assistance and interdiction problems on interval graphs ⋮ Approximability and parameterized complexity of multicover by \(c\)-intervals






This page was built for publication: Minimum Interval Cover and Its Application to Genome Sequencing

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