Simple approximation algorithm for nonoverlapping local alignments

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 677-678

  Berman, Piotr ^a   DasGupta, Bhaskar ^b   Muthukrishnan, S ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b 1120 Science and Engineering Offices   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968813904     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. V. Bafha, B. Narayanan and R. Ravi. Nonoverlapping local alignments (Weighted independent sets of axis-parallel rectangles, Discrete Applied Mathematics, 71, pp. 41-53, 1996.
2. P. Berman. A d/2 approximation for maximum weight independent set in d-claw free graphs, Proc. of the 7th Scandinavian Workshop on Algorithmic Theory, LNCS 1851, July 2000, pp. 214-219.
3. P. Berman and B. DasGupta. Improvements in Throughput Maximization for Real-Time Scheduling, proceedings of the 32nd Annual ACM Symposium on Theory of Computing, May 2000, pp. 680-687.
4. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge Univ Press, 1997.
5. M. M. Halldorsson. Approximating discrete collections via local improvements, proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, January 1995, pp. 160-169.
6. M. S. Waterman and M. Eggert, A new algorithm for best subsequence alignments with application to trna-rrna comparisons, J. Mol. Biol. 197, 1987, pp. 723-728.