On the Gapped Consecutive-Ones Property

Electronic Notes in Discrete Mathematics

Volumn 34, Issue , 2009, Pages 121-125

  Chauve, Cedric ^a   Maňuch, Ján ^a   Patterson, Murray ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

algorithm; computational complexity; consecutive ones property

Indexed keywords

EID: 67651166775     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2009.07.020     Document Type: Article

References (7)

1. Chauve C., and Tannier E. A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol. 4 (2008) paper e1000234
2. Goldberg P., Golumbic M., Kaplan H., and Shamir R. Four strikes againts physical mapping of DNA. J. Comput. Biol. 2 (1995) 139-152
3. Haddadi S. A note on the NP-hardness of the consecutive block minimization problem. Int. Trans. Oper. Res. 9 (2002) 775-777
4. Hajiaghayi M.T., and Ganjali Y. A note on the consecutive ones submatrix problem. Inf. Process. Lett. 83 (2002) 163-166
5. Dom M., Guo J., and Niedermeier R. Approximability and parameterized complexity of the consecutive ones submatix problem. TAMC 2007. Springer LNCS 4484 (2007) 680-691
6. McConnell, R., A certifying algorithm for the consecutive-ones property, in: SODA (2004), pp. 761-770
7. Saxe J. Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discrete Methods 1 (1980) 363-369