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

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 946-962

  Thach, Nguyen C ^a   Shen, Jian ^b   Hou, Minmei ^c   Sheng, Li ^d   Miller, Webb ^e   Zhang, Louxin ^f  

^a University of Washington   (United States)

^b TEXAS STATE UNIVERSITY   (United States)

^c NORTHERN ILLINOIS UNIVERSITY   (United States)

^d DREXEL UNIVERSITY   (United States)

^e PENNSYLVANIA STATE UNIVERSITY   (United States)

^f NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Approximation algorithm; Dominating set; Genomic sequence alignment; Spanning star forest

Indexed keywords

ALGORITHMIC ISSUES; APPROXIMATION SCHEMES; DOMINATING SET; FOREST MODELS; GENOMIC SEQUENCE ALIGNMENT; GENOMIC SEQUENCES; NP-HARD; PLANAR GRAPHS; SPANNING STAR FOREST; TIME ALGORITHMS; WEIGHTED GRAPHS; WEIGHTED TREES;

ALIGNMENT; APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; GRAPH THEORY; NUCLEAR PROPULSION; TREES (MATHEMATICS);

POLYNOMIAL APPROXIMATION;

EID: 55249086760     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070682150     Document Type: Article

References (19)

1. A. AGRA, D. CARDOSO, O. CERDEIRA, AND E. ROCHA, A Spanning Star Forest Model for the Diversity Problem in Automobile Industry, manuscript, 2005.
2. J. AKIYAMA AND M. KANO, Path factors of a graph, in Graph Theory and Its Applications, F. Haray and J. Maybee, eds., Wiley, New York, 1984, pp. 1-21.
3. Y. AOKI, The star-arboricity of the complete regular multipartite graphs, Discrete Math., 81 (1990), pp. 115-122.
4. I. ALGOR AND N. ALON, The star arboricity of graphs, Discrete Math., 75 (1989), pp. 11-22.
5. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-180.
6. V. BERRY, S. GUILLEMOT, F. NICOLAS, AND C. PAUL, On the approximation of computing evolutionary trees, in Proceedings of the 11th Annual International Computing and Combinatorics Conference, Lecture Notes in Comput. Sci. 3595, Springer-Verlag, New York, 2005, pp. 115-125.
7. W. J. KENT, C. RIEMER, L. ELNITSKI, A. F. SMIT, K. M. ROSKIN, R. BAERTSCH, K. ROSENBLOOM, H. CLAWSON, E. D. GREEN, D. HAUSSLER, AND W. MILLER, Aligning multiple genomic sequences with the threaded blockset aligner, Genome Res., 14 (2004), pp. 708-715.
8. N. CHEN, R. ENGELBERG, C. T. NGUYEN, P. RAGHAVENDRA, A. RUDRA AND G. SINGH, Improved approximation algorithms for the spanning star forest problem, in Proceedings of APPROX 2007, Lecture Notes in Comput. Sci. 4627, Springer-Verlag, New York, pp. 44-58.
9. M. CHLEBÍK AND J. CHLEBÍKOVÁ , Inapproximability results for bounded variants of optimization problems, Theoret. Comput. Sci., 354 (2006), pp. 320-338.
10. E. J. COCKAYNE, S. E. GOODMAN, AND S. T. HEDETNIEMI, A linear algorithm for the domination number of a tree, Inform. Process. Lett., 4 (1975), pp. 41-44.
11. Y. EGAWA, T. FUKADA, S. NAGOYA, AND M. URABE, A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components. Discrete Math., 58 (1986), pp. 93-95.
12. U. FEIGE, A threshold of ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
13. S. FERNEYHOUGH, R. HAAS, D. HANNSON, AND G. MACGILLIVRAY, Star forests, dominating sets and Ramsey-type problems, Discrete Math., 245 (2002), pp. 255-262.
14. S. I. HAKIMI, J. MITCHEM, AND E. SCHMEICHEL, Star arboricity of graphs, Discrete Math., 149 (1996), pp. 93-98.
15. T. HAYNES, S. T. HEDETNIEMI, AND P. J. SLATER, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
16. M. M. HOU, P. BERMAN, L. X. ZHANG, AND W. MILLER, Controlling size when aligning multiple genomic sequences with duplications, in Proceedings of WABI (Zurich, 2006), Springer-Verlag, Berlin, 2006, pp. 138-149.
17. C. LUND AND M. YANNAKAKIS, On the hardness of approximation minimization problems, J. ACM, 41 (1994), pp. 961-981.
18. W. McCUAIG AND B. SHEPHERD, Domination in graphs with minimum degree two, J. Graph Theory, 13 (1989), pp. 749-762.
19. B. REED, Paths, stars and the number three, Combin. Probab. Comput., 5 (1996), pp. 277-295.