Approximating the spanning star forest problem and its applications to genomic sequence alignment

MaRDI QIDQ2934650zbMATH OpenFDO

Authors C. Thach Nguyen, J. Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang

Publication date 18 December 2014

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21)

Recommendations

• Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
• Improved approximation algorithms for the spanning star forest problem
• Improved Approximation Algorithms for the Spanning Star Forest Problem
• Approximating the spanning \(k\)-tree forest problem
• Approximating the Spanning k-Tree Forest Problem

Cited in

(2)

• Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
• On the star forest polytope for trees and cycles

This page was built for publication: Approximating the spanning star forest problem and its applications to genomic sequence alignment

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