Fixed-parameter algorithms for graph-modeled data clustering

Clustering Challenges in Biological Networks

Volumn , Issue , 2009, Pages 3-28

  Hüffner, Falk ^a   Niedermeier, Rolf ^a   Wernicke, Sebastian ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967355737     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789812771667_0001     Document Type: Chapter

References (74)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. Kernelization algorithms for the Vertex Cover problem: theory and experiments. In Proc. 6th ALENEX, pages 62-69. SIAM, 2004.
2. F. N. Abu-Khzam, M. A. Langston, and W. H. Suters. Fast, effective vertex cover kernelization: A tale of two algorithms. In Proc. 3rd AICCSA. ACS/IEEE, 2005. 16 pages.
3. F. N. Abu-Khzam, M. A. Langston, P. Shanbhag, and C. T. Symons. Scalable parallel algorithms for FPT problems. Algorithmica, 45(3):269-284, 2006.
4. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proc. 37th STOC, pages 684-693. ACM, 2005.
5. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999.
6. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56(1):89-113, 2004.
7. M. Behrisch and A. Taraz. Efficiently covering complex networks with cliques of similar vertices. Theoretical Computer Science, 355(1):37-47, 2006.
8. A. Ben-Dor, R. Shamir, and Z. Yakhini. Clustering gene expression patterns. Journal of Computational Biology, 6(3-4):281-297, 1999.
9. M. Benson, M. A. Langston, M. Adner, B. Andersson, A°. Torinsson Naluai, and L. O. Cardell. A network-based analysis of the late-phase reaction of the skin. The Journal of Allergy and Clinical Immunology, 118(1):220-225, 2006.
10. S. Butenko and W. E. Wilhelm. Clique-detection models in computational biochemistry and genomics. European Journal of Operational Research, 173(1):1-17, 2006.
11. L. Cai, J. Chen, R. Downey, and M. R. Fellows. Advice classes of parameterized tractability. Annals of Pure and Applied Logic, 84:119-138, 1997.
12. L. Sunil Chandran and Fabrizio Grandoni. Refined memorisation for Vertex Cover. Information Processing Letters, 93(3):125-131, 2005.
13. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. Journal of Computer and System Sciences, 71(3):360-383, 2005.
14. J. Cheetham, F. K. H. A. Dehne, A. Rau-Chaplin, U. Stege, and P. J. Taillon. Solving large FPT problems on coarse-grained parallel machines. Journal of Computer and System Sciences, 67(4):691-706, 2003.
15. J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for Vertex Cover. In Proc. 31st MFCS, volume 4162 of LNCS, pages 238-249. Springer, 2006.
16. E. J. Chesler, L. Lu, S. Shou, Y. Qu, J. Gu, J. Wang, H. C. Hsu, J. D. Mountz, N. E. Baldwin, M. A. Langston, D. W. Threadgill, K. F. Manly, and R. W. Williams. Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nature Genetics, 37:233-242, 2005.
17. M. Chlebík and J. Chlebíková. Improvement of Nemhauser-Trotter theorem and its applications in parameterized complexity. In Proc. 9th SWAT, volume 3111 of LNCS, pages 174-186. Springer, 2004.
18. B. Chor, M. R. Fellows, and D. W. Juedes. Linear kernels in linear time, or how to save k colors in O(n2) steps. In Proc. 30th WG, volume 3353 of LNCS, pages 257-269. Springer, 2004.
19. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
20. P. Damaschke. On the fixed-parameter enumerability of Cluster Editing. In Proc. 31st WG, volume 3787 of LNCS, pages 283-294. Springer, 2005.
21. P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science, 351(3):337-350, 2006.
22. M. Davis, G. Logemann, and D. W. Loveland. A machine program for theoremproving. Communications of the ACM, 5(7):394-397, 1962.
23. F. K. H. A. Dehne, M. A. Langston, X. Luo, S. Pitre, P. Shaw, and Y. Zhang. The Cluster Editing problem: Implementations and experiments. In Proc. 2nd IWPEC, volume 4169 of LNCS, pages 13-24. Springer, 2006.
24. R. Diestel. Graph Theory. Springer, 3rd edition, 2005.
25. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
26. L. Drori and D. Peleg. Faster exact solutions for some NP-hard problems. Theoretical Computer Science, 287(2):473-499, 2002.
27. D. Eppstein. Quasiconvex analysis of backtracking algorithms. In Proc. 15th SODA, pages 788-797. ACM/SIAM, 2004.
28. M. R. Fellows, M. A. Langston, F. Rosamond, and P. Shaw. Polynomial-time linear kernelization for Cluster Editing. Manuscript, 2006.
29. A. Felner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. Journal of Artificial Intelligence Research, 21:1-39, 2004.
30. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
31. F. V. Fomin, F. Grandoni, and D. Kratsch. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS, 87:47-77, 2005.
32. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
33. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39(4):321-347, 2004.
34. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Graph-modeled data clustering:Exact algorithms for clique generation. Theory of Computing Systems, 38(4):373-392, 2005.
35. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Data reduction, exact, and heuristic algorithms for clique cover. In Proc. 8th ALENEX, pages 86-94. SIAM, 2006. Long version to appear under the title "Data reduction and exact algorithms for clique cover" in ACM Journal of Experimental Algorithmics.
36. J. Gramm, J. Guo, F. Hüffner, R. Niedermeier, H.-P. Piepho, and R. Schmid. Algorithms for compact letter displays: Comparison and evaluation. Computational Statistics & Data Analysis, 2006. To appear.
37. J.-L. Guillaume andM. Latapy. Bipartite structure of all complex networks. Information Processing Letters, 90(5):215-221, 2004.
38. J. Guo. A more effective linear kernelization for cluster editing. In Proc. ESCAPE, LNCS. Springer, 2007. To appear.
39. J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. ACM SIGACT News, 38(1):31-45, 2007.
40. J. Guo, R. Niedermeier, and S. Wernicke. Parameterized complexity of generalized Vertex Cover problems. In Proc. 9th WADS, volume 3608 of LNCS, pages 36-48. Springer, 2005. Long version to appear under the title "Parameterized complexity of Vertex Cover variants" in Theory of Computing Systems.
41. A. Gyárfás. A simple lower bound on edge coverings by cliques. Discrete Mathematics, 85(1):103-104, 1990.
42. 1-ε{lunate}. Acta Mathematica, 182(1):105-142, 1999.
43. K. Holzapfel, S. Kosub, M. G. Maaß, and H. Täubig. The complexity of detecting fixed-density clusters. Discrete Applied Mathematics, 154(11):1547-1562, 2006.
44. H. Ito, K. Iwama, and T. Osumi. Linear-time enumeration of isolated cliques. In Proc. 13th ESA, volume 3669 of LNCS, pages 119-130. Springer, 2005.
45. H. Kawaji, Y. Takenaka, and H. Matsuda. Graph-based clustering for finding distant relationships in a large set of protein sequences. Bioinformatics, 20(2):243-252, 2004.
46. H. Kawaji, Y. Yamaguchi, H. Matsuda, and A. Hashimoto. A graph-based clustering method for a large set of sequences using a graph partitioning algorithm. Genome Informatics, 12:93-102, 2001.
47. E. Kellerman. Determination of keyword conflict. IBMTechnical Disclosure Bulletin, 16(2):544-546, 1973.
48. J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2005.
49. C. Komusiewicz. Various isolation concepts for the enumeration of dense subgraphs. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2007.
50. C. Komusiewicz, F. Hüffner, H. Moser, and R. Niedermeier. Isolation concepts for enumerating dense subgraphs. In Proc. 13th COCOON, volume 4598 of LNCS, pages 140-150. Springer, 2007.
51. R. E. Korf, M. Reid, and S. Edelkamp. Time complexity of iterative-deepening-A*. Artificial Intelligence, 129:199-218, 2001.
52. L. T. Kou, L. J. Stockmeyer, and C.-K. Wong. Covering edges by cliques with regard to keyword conflicts and intersection graphs. Communications of the ACM, 21(2):135-139, 1978.
53. M. Křivánek and J. Morávek. NP-hard problems in hierarchical-tree clustering. Acta Informatica, 23(3):311-323, 1986.
54. M. A. Langston, A. D. Perkins, D. J. Beare, R. W. Gauldie, P. J. Kershaw, J. B. Reid, K.Winpenny, and A. J. Kenny. Combinatorial algorithms and high performance implementations for elucidating complex ecosystem relationships from North Sea historical data. In Proc. International Council for the Exploration of the Sea Annual Science Conference, 2006.
55. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41:960-981, 1994.
56. S. Mecke and D.Wagner. Solving geometric covering problems by data reduction. In Proc. 12th ESA, volume 3221 of LNCS, pages 760-771. Springer, 2004.
57. K. Mehlhorn. Data Structures and Algorithms, Volume 2: NP-Completeness and Graph Algorithms. EATCS Monographs on Theoretical Computer Science. Springer, 1984.
58. Z. Michalewicz and B. F. Fogel. How to Solve it: Modern Heuristics. Springer, 2nd edition, 2004.
59. R. Niedermeier and P. Rossmanith. A general method to speed up fixed-parametertractable algorithms. Information Processing Letters, 73:125-129, 2000.
60. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
61. J. B. Orlin. Contentment in graph theory: Covering graphs with cliques. Indagationes Mathematicae (Proceedings), 80(5):406-424, 1977.
62. H.-P. Piepho. An algorithm for a letter-based representation of all-pairwise comparisons. Journal of Computational and Graphical Statistics, 13(2):456-466, 2004.
63. F. Protti, M. D. da Silva, and J. L. Szwarcfiter. Applying modular decomposition to parameterized Bicluster Editing. In Proc. 2nd IWPEC, volume 4169 of LNCS, pages 1-12. Springer, 2006.
64. S. Rajagopalan, M. Vachharajani, and S. Malik. Handling irregular ILP within conventional VLIW schedulers using artificial resource constraints. In Proc. CASES, pages 157-164. ACM, 2000.
65. S. Seno, R. Teramoto, Y. Takenaka, and H.Matsuda. A method for clustering expression data based on graph structure. Genome Informatics, 15(2):151-160, 2004.
66. R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. Discrete Applied Mathematics, 144(1-2):173-182, 2004.
67. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
68. B. H. Voy, J. A. Scharff, A. D. Perkins, A. M. Saxton, B. Borate, E. J. Chesler, L. K. Branstetter, and M. A. Langston. Extracting gene networks for low-dose radiation using graph theoretical algorithms. PLoS Computational Biology, 2(7):e89, 2006.
69. L. Wang, Y. Lin, and X. Liu. Approximation algorithms for bi-clustering problems. In Proc. 6th WABI, volume 4175 of LNBI, pages 310-320. Springer, 2006.
70. K. Weihe. Covering trains by stations or the power of data reduction. In Proc. 1st ALEX, pages 1-8, 1998.
71. D. B. West. Introduction to Graph Theory. Prentice Hall, 2nd edition, 2001.
72. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Proc. 5th IWCO, volume 2570 of LNCS, pages 185-208. Springer, 2003.
73. H. Yu, A. Paccanaro, V. Trifonov, and M. Gerstein. Predicting interactions in protein networks by completing defective cliques. Bioinformatics, 22(7):823-829, 2006.
74. Y. Zhang, F. N. Abu-Khzam, N. E. Baldwin, E. J. Chesler, Michael A. Langston, and Nagiza F. Samatova. Genome-scale computational approaches to memory-intensive applications in systems biology. In Proc. 18th SC, page e12. IEEE Computer Society, 2005.