Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Approximating the Spanning Star Forest Problem and Its Applications to Genomic Sequence Alignment
 

Summary: Approximating the Spanning Star Forest Problem and Its Applications to
Genomic Sequence Alignment
C. Thach Nguyen
Jian Shen
Minmei Hou
Li Sheng§
Webb Miller¶
Louxin Zhang
Abstract
This paper studies the algorithmic issues of the span-
ning star forest problem. We prove the following re-
sults: (1) there is a polynomial-time approximation
scheme for planar unweighted graphs; (2) there is a
polynomial-time algorithm with approximation ratio 3
5
for unweighted graphs; (3) it is NP-hard to approxi-
mate the problem within ratio 545
546 + for unweighted
graphs; (4) there is a linear-time algorithm to compute
the maximum star forest of a weighted tree; (5) there is

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

 

Collections: Computer Technologies and Information Sciences