Biology Reference
In-Depth Information
Diplomarbeit, Institut fur Informatik, Friedrich-Schiller-Universitat Jena, 2007.
[50]
C. Komusiewicz, F. H uffner, 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 re-
gard to keyword conflicts and intersection graphs.
Communications of the ACM
,
21(2):135-139, 1978.
[53]
M. Krivanek and J. Moravek. 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 prob-
lems.
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-parameter-
tractable 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 compar-
isons.
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 con-
ventional 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 expres-
sion 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
Search WWH ::
Custom Search