Biology Reference
In-Depth Information
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.
Search WWH ::
Custom Search