Hypergraph Covering Problems Motivated by Genome Assembly Questions

DOI10.1007/978-3-642-45278-9_37zbMath1408.05094arXiv1306.4353OpenAlexW1680010361MaRDI QIDQ2870051

Cedric Chauve, Ashok Rajaraman, Murray Patterson

Publication date: 17 January 2014

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

Full work available at URL: https://arxiv.org/abs/1306.4353

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Genetics and epigenetics (92D10)

Related Items (1)

A complexity and approximation framework for the maximization scaffolding problem

This page was built for publication: Hypergraph Covering Problems Motivated by Genome Assembly Questions