On physical mapping and the consecutive ones property for sparse matrices

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 23-40

  Atkins, Jonathan E ^a   Middendorf, Martin ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042542466     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00055-8     Document Type: Article

References (16)

1. F. Alizadeh, R.M. Karp, L.A. Newberg and D.K. Weisser, Physical mapping of chromosomes: a combinatorial problem in molecular biology, Algorithmica 13 (1995) 52-76.
2. J.E. Atkins, E.G. Boman and B. Hendrickson, A spectral algorithm for seriation and linear ordering problems, submitted for publication.
3. H.L. Bodlaender, M.R. Fellows and M.T. Hallet, The parameterized complexity of DNA mapping, perfect phylogeny and other problems of "bounded width", manuscript.
4. K.S. Booth and G.S. Lueker, Testing for the consecutive ones property interval graphs, and graph planarity using PQ-tree algorithms, JCSS 13 (1976) 335-379.
5. S. Even, Graph Algorithms (Computer Science Press, Rockville, MD, 1979).
6. M.R. Fellows, M.T. Hallet and H.T. Wareham, DNA physical mapping: three ways difficult, in: Proceedings of the 1st European Symp. on Algorithms (ESA '93), Lecture Notes in Computer Science, Vol. 726 (Springer, Berlin, 1993) 157-168.
7. M. Flammini, G. Gambosi and S. Salomone, Interval routing schemes, in: Proceedings of the 12th Symp. on Theoret. Aspects of Comput. Sci. (STAGS '95), Lecture Notes in Computer Science, Vol. 900 (Springer, Berlin, 1995) 279-290.
8. D.R. Fulkerson and O.A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965) 835-855.
9. P.W. Goldberg, M.C. Golumbic, H. Kaplan and R. Shamir, Four strikes against physical mapping of DNA, J. Comput. Biol., to appear.
10. D.S. Greenberg and S. Istrail, Physical mapping by STS hybridization: algorithmic strategies and the challenge of software evaluation, J. Comput. Biol., to appear.
11. M.C. Golumbic, H. Kaplan and R. Shamir, On the complexity of DNA physical mapping, Adv. Appl. Math. 15 (1994) 251-261.
12. M.R. Garey and D.S. Johnson, Computers and Intractability (W.H. Freeman, San Francisco, 1979).
13. S. Istrail, personal communication (1994).
14. H. Kaplan and R. Shamir, Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques, Technical Report, CS Department, Tel Aviv University (1993).
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 FOCS '94 (1994) 780-791.
16. L.T. Kou, Polynomial complete consecutive information retrieval problems, SIAM J. Comput. 6 (1977) 67-75.