Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)-Reference-Cited by-同舟云学术

Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)

Published:1995 Issue: Volume: Page:506-517
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bafna Vineet,Narayanan Babu,Ravi R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60220-8_89.pdf

Reference14 articles.

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In 33rd IEEE Symp. on Foundations of Computer Science, 1992.

2. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Fifth ACM-SIAM Symp on Discrete Algorithms, pages 365–371, 1994.

3. B. Bollobas. Extrernal Graph Theory. Academic Press, 1978.

4. V. Bafna and P. Pevzner. Genome rearrangements and sorting by reversals. In 34th IEEE Symp. on Foundations of Computer Science, pages 148–157, 1993.

5. V. Bafna and P. Pevzner. Sorting permutations by transpositions. In The sixth annual ACM-SIAM symposium on discrete algorithms, pages 614–623, 1995.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs;Algorithm Theory - SWAT 2000;2000

2. An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling;Algorithms - ESA’ 99;1999

3. On Local Search for Weightedk-Set Packing;Mathematics of Operations Research;1998-08

4. Approximations of independent sets in graphs;Approximation Algorithms for Combinatiorial Optimization;1998

5. On local search for weighted κ-set packing;Algorithms — ESA '97;1997