Bounded degree interval sandwich problems

Algorithmica (New York)

Volumn 24, Issue 2, 1999, Pages 96-104

  Kaplan, H ^a   Shamir, R ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Computational biology; Design and analysis of algorithms; Interval graphs; Parametrized complexity

Indexed keywords

EID: 0345222627     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009277     Document Type: Article

References (19)

1. F. Alizadeh, R. M. Karp, L. W. Newberg, and D. K. Weisser. Physical mapping of chromosomes: a combinatorial problem in molecular biology. In Proc. Fourth Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 93), pages 371-381. ACM Press, New York, 1993.
2. H. L. Bodlaender and B. L. E. de Fluiter. Intervalizing k-colored graphs. In Proc. ICALP 95, pages 87-98. LNCS, 944. Springer-Verlag, Berlin, 1995.
3. H. L. Bodlaender, M. R. Fellows, and M. T. Hallet. Beyond NP-completeness for problems of bounded width: hardness tor the W hierarchy (extended abstract). In Proc. 26th Annual ACM Symp. on the Theory of Computing, pages 449-458. ACM Press, New York, 1994.
4. A. V. Carrano. Establishing the order of human chromosome-specific DNA fragments. In A. D. Woodhead and B. J. Barnhart, editors, Biotechnology and the Human Genome, pages 37-50. Plenum Press, New York, 1988.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1997.
6. M. R. Fellows, M. T. Hallet, and H. T. Wareham. DNA physical mapping: three ways difficult. In Proc. First European Symp. on Algorithms (ESA '93), pages 157-168. LNCS 726. Springer-Verlag, Berlin, 1993.
7. P. W. Goldberg, M. C. Golumbic, H. Kaplan, and R. Shamir. Four strikes against physical mapping of DNA. J. Comput. Biol., 2(1):139-152, 1995.
8. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
9. M. C. Golumbic, H. Kaplan, and R. Shamir. On the complexity of DNA physical mapping. Adv. in Appl. Math., 15:251-261, 1994.
10. M. C. Golumbic and R. Shamir. Complexity and algorithms for reasoning about time: A graph-theoretic approach. J. Assoc. Comput. Mach., 40:1108-1133, 1993.
11. D. Greenberg and S. Istrail. The chimeric mapping problem: algorithmic strategies and performance evaluation on synthetic genomic data. Comput. Chem., 18(3):207-220, 1994.
12. E. Gurari and I. H. Sudborough. Improved dynamic programming algorithms for the bandwidth minimization and the mincut linear arrangement problem. J. Algorithms, 5:531-546, 1984.
13. H. Kaplan and R. Shamir. Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques. SIAM J. Comput., 25(3):540-561, 1996.
14. H. Kaplan and R. Shamir. Physical maps and interval sandwich problems: bounded degrees help. In Proc. ISTCS, pages 195-201, 1996.
15. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping. In Proc. 35th Symp. on Foundations of Computer Science, pages 780-791. IEEE Computer Science Press, Los Alamitos, California, 1994.
16. Y. Kohara, K. Akiyama, and K. Isono. The physical map of the whole E. coli chromosome: application of a new strategy for rapid analysis and sorting of large genomic libraries. Cell, 50:495-508, 1987.
17. M. V. Olson, J. E. Dutchik, M. Y. Graham, G. M. Brodeur, C. Helms, M. Frank, M. MacCollin, R. Scheinman, and T. Frank. Random-clone strategy for genomic restriction mapping in yeast. Proc: Nat. Acad. Sci. USA. 83:7826-7830, 1986.
18. J. B. Saxe. Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discrete Methods, 1:363-369, 1980.
19. J. D. Watson, M. Gilman, J. Witkowski, and M. Zoller. Recombinant DNA, 2nd edition. Freeman, New York, 1992.