On intervalizing k-colored graphs for DNA physical mapping

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 55-77

  Bodlaender, Hans L ^a   De Fluiter, Babette ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042542464     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00057-1     Document Type: Article

References (18)

1. H.L. Bodlaender and B. de Fluiter, Intervalizing k-colored graphs, Technical Report UU-CS-1995-15, Department of Computer Science, Utrecht University, Utrecht (1995); extended abstract in : Procedings ICALP'95.
2. H.L. Bodlaender, R.G. Downey, M.R. Fellows, M.T. Hallett and H.T. Wareham, Parameterized complexity analysis in computational biology, Comput. Appl. Biosci. 11 (1995) 49-57.
3. H.L. Bodlaender, M.R. Fellows and M. Hallett, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, in: Proceedings of the 26th Annual Symposium on Theory of Computing (ACM Press, New York, 1994) 449-458.
4. H.L. Bodlaender, M.R. Fellows and T.J. Warnow, Two strikes against perfect phylogeny, in: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin, 1992) 273-283.
5. H.L. Bodlaender and T. Kloks, A simple linear time algorithm for triangulating three-colored graphs, J. Algorithms 15 (1993) 160-172.
6. H.L. Bodlaender and R.H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math. 6 (1993) 181-188.
7. M.R. Fellows, M.T. Hallett and H.T. Wareham, DNA physical mapping: three ways difficult (extended abstract), in: T. Lengauer, Ed., Proceedings of the 1st Annual European Symposium on Algorithms ESA'93, Lecture Notes in Computer Science, Vol. 726 (Springer, Berlin, 1993) 157-168.
8. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
9. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
10. M.C. Golumbic, H. Kaplan and R. Shamir, On the complexity of DNA physical mapping. Adv. Appl. Math. 15 (1994) 251-261.
11. R. Idury and A. Schaffer, Triangulating three-colored graphs in linear time and linear space, SIAM J. Discrete Math. 2 (1993) 289-293.
12. J.R. Jungek, G. Dick and A.G. Dick, Computer-assisted sequencing, interval graphs, and molecular evolution, BioSystems 15 (1982) 259-273.
13. S. Kannan and T. Warnow, Triangulating 3-colored graphs, SIAM J. Discrete Math. 5 (1992) 249-258.
14. H. Kaplan and R. Shamir, Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques, Technical Report 285/93, Institute for Computer Science, Tel Aviv University, Tel Aviv, Israel, 1993; SIAM J. Comput., to appear.
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: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Soc. Press, Silver Spring, MD, 1994) 780-791.
16. R.M. Karp, Mapping the genome: some combinatorial problems arising in molecular biology, in: Proceedings of the 25th Annual Symposium on Theory of Computing (ACM Press, New York, 1993) 278-285.
17. F.R. McMorris, T. Warnow and T. Wimer, Triangulating vertex-colored graphs, SIAM J. Discrete Math. 7 (1994) 296-306.
18. S.-I. Nakano, T. Oguma and T. Nishizeki, A linear time algorithm for c-triangulating three-colored graphs, Trans. Ins. Electron. Inform. Commun. Eng. A. 377-A (1994) 543-546 (in Japanese).