Avoiding forbidden submatrices by row deletions

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

Volumn 2932, Issue , 2003, Pages 349-360

  Wernicke, Sebastian ^a   Alber, Jochen ^a   Gramm, Jens ^a   Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COLUMN PERMUTATIONS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; FIXED-PARAMETER TRACTABILITY; HITTING SET PROBLEMS; INPUT MATRICES; PERFECT PHYLOGENY; POSITIVE SIDES; SYSTEMATIC STUDY;

APPROXIMATION ALGORITHMS;

EID: 35048890157     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (11)

1. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)
3. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. In: Proc. of 5th CIAC. LNCS Vol. 2653. Springer (2003) 108-119
4. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Automated Generation of Search Tree Algorithms for Graph Modification Problems. In: Proc. of 11th ESA. LNCS Vol. 2832. Springer (2003) 642-653
5. Klinz, B., Rudolf, R., Woeginger, G.J.: Permuting Matrices to Avoid Forbidden Submatrices. Discrete Applied Mathematics 60 (1995) 223-248
6. Natanzon, A., Shamir, R., Sharan, R.: Complexity Classification of Some Edge Modification Problems. Discrete Applied Mathematics 113 (2001) 109-128
7. Niedermeier, R., Rossmanith, P.: An Efficient Fixed-Parameter Algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1 (2003) 89-102
8. Pe'er, I., Shamir, R., Sharan, R.: On the Generality of Phylogenies from Incomplete Directed Characters. In: Proc. of 8th SWAT. LNCS Vol. 2368. Springer (2002) 358-367
9. Shamir, R., Sharan, R., Tsur, D.: Cluster Graph Modification Problems. In: Proc. of 28th WG. LNCS Vol. 2573. Springer (2002) 379-390
10. Sharan, R.: Graph Modification Problems and Their Applications to Genomic Research. Ph.D. Thesis, School of Computer Science, Tel-Aviv University (2002)
11. Wernicke, S.: On the Algorithmic Tractability of Single Nucleotide Polymorphism (SNP) Analysis and Related Problems. Diploma Thesis, WSI für Informatik, Universität Tübingen, September 2003