The complexity of the gapped consecutive-ones property problem for matrices of bounded maximum degree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6398 LNBI, Issue , 2010, Pages 278-289

  Maňuch, Ján ^a,b   Patterson, Murray ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY MATRIX; COMPARATIVE GENOMICS; MAXIMUM DEGREE; NP COMPLETE; POLYNOMIAL-TIME; THREE PARAMETERS; CONSECUTIVE ONES PROPERTY;

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

EID: 78649962543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16181-0_23     Document Type: Conference Paper

References (14)

1. Alizadeh, F., Karp, R., Weisser, D., Zweig, G.: Physical mapping of chromosomes using unique probes. J. Comput. Biol. 2(2), 159-184 (1995)
2. Chauve, C., Haus, U.W., Stephen, T., You, V.P.: Minimal conflicting sets for the consecutive-ones property in ancestral genome reconstruction. In: Ciccarelli, F.D., Miklós, I. (eds.) RECOMB-CG 2009. LNCS (LNBI), vol. 5817, pp. 48-58. Springer, Heidelberg (2009)
3. Chauve, C.: Maňuch, J., Patterson, M.: On the gapped consecutive-ones property. In: Proc. of European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB). ENDM, vol. 34, pp. 121-125 (2009)
4. Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genomes. PLoS Comput. Biol. 4, e1000234 (2008)
5. Dom, M.: Recognition, generation, and application of binary matrices with the consecutive-ones property. Ph.D. thesis, Institut für Informatik, Friedrich-Schiller-Universität, Jena (2008)
6. Goldberg, P., Golumbic, M., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2(1), 139-152 (1995)
7. Gupta, A., Maňuch, J., Stacho, L., Zhao, X.: Algorithm for haplotype inferring via galled-tree networks with simple galls. In: Mǎndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol. 4463, pp. 121-132. Springer, Heidelberg (2007) (Pubitemid 47165054)
8. Gupta, A., Maňuch, J., Stacho, L., Zhao, X.: Haplotype inferring via galled-tree networks is NP-complete. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 287-298. Springer, Heidelberg (2008)
9. Gupta, A., Maňuch, J., Stacho, L., Zhao, X.: Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discr. Appl. Math. 157(10), 2310-2324 (2009)
10. Maňuch, J., Patterson, M., Chauve, C.: Hardness results for the gapped C1P problem (unpublished manuscript)
11. McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: Proc. of Symposium on Discrete Algorithms (SODA), pp. 761-770. SIAM, Philadelphia (2004)
12. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
13. Saxe, J.B.: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. on Alg. and Discr. Meth. 1(4), 363-369 (1980)
14. Tucker, A.C.: A structure theorem for the consecutive 1's property. J. of Comb. Theory, Series B 12, 153-162 (1972)