Improved algorithms for bicluster editing

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

Volumn 4978 LNCS, Issue , 2008, Pages 445-456

  Guo, Jiong ^a   Hüffner, Falk ^a   Komusiewicz, Christian ^a   Zhang, Yong ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b EASTERN MENNONITE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENE EXPRESSION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

BIPARTITE GRAPHS; BIPARTITE SUBGRAPHS; GENE EXPRESSION DATA; POLYNOMIAL-TIME PREPROCESSINGS; PROBLEM INSTANCES; QUADRATIC KERNELS; SEARCH TREE ALGORITHMS; VERTEX DISJOINT;

COMPUTATION THEORY;

EID: 70349339310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_39     Document Type: Conference Paper

References (21)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proc. 37th STOC, pp. 684-693. ACM Press, New York (2005)
2. Ailon, N., Charikar, M., Newman, A.: Proofs of conjectures in Aggregating inconsistent information: Ranking and clustering. Technical Report TR-719-05, Department of Computer Science, Princeton University (2005)
3. Amit, N.: The bicluster graph editing problem. Master's thesis, Tel Aviv University, School of Mathematical Sciences (2004)
4. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89-113 (2004)
5. Böcker, S., Briesemeister, S., Bui, Q.B.A., Truß, A.: PEACE: Parameterized and exact algorithms for cluster editing. Manuscript, Lehrstuhl für Bioinformatik, Friedrich-Schiller-Universität Jena (September 2007)[6] Dehne, F.K.H.A., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, Springer, Heidelberg (2006)
6. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
7. Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for cluster editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312-321. Springer, Heidelberg (2007)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
9. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems 38(4), 373-392 (2005)
10. Guo, J.: A more effective linear kernelization for Cluster Editing. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, Springer, Heidelberg (2007)
11. Hsu, W., Ma, T.: Substitution decomposition on chordal graphs and applications. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 52-60. Springer, Heidelberg (1991)
12. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: Lin, G. (ed.) COCOON. LNCS, vol. 4598, pp. 711-722. Springer, Heidelberg (2007)
13. Hüffner, F., Niedermeier, R., Wernicke, S.: Fixed-parameter algorithms for graphmodeled data clustering. In: Clustering Challenges in Biological Networks, World Scientific, Singapore (to appear, 2008)
14. Křivánek, M., Morávek, J.: NP-hard problems in hierarchical-tree clustering. Acta Informatica 23(3), 311-323 (1986)
15. Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(1), 24-45 (2004)
16. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)
17. Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized bicluster editing. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 1-12. Springer, Heidelberg (2006); To appear under the title "Applying modular decomposition to parameterized cluster editing problems" in Theory of Computing Systems.
18. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2), 173-182 (2004)
19. Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: A survey. In: Aluru, S. (ed.) Handbook of Computational Molecular Biology, pp. 26-1 - 26-17. Chapman Hall/CRC Press (2006)
20. van Zuylen, A.Z.,Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260-273. Springer, Heidelberg (2007)
21. van Zuylen, A.Z., Hegde, R., Jain, K., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: Proc. 18th SODA, pp. 405-414. SIAM, Philadelphia (2007)