Algorithmic and complexity issues of three clustering methods in microarray data analysis
10.1007/s00453-007-0040-4
Saved in:
Main Authors: | Tan, J., Chua, K.S., Zhang, L., Zhu, S. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/104490 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The consecutive ones submatrix problem for sparse matrices
by: Tan, J., et al.
Published: (2014) -
Subtree transfer distance for degree-D phylogenies
by: Hon, W.-K., et al.
Published: (2014) -
From gene trees to species trees
by: Ma, B., et al.
Published: (2014) -
Reconstructing recombination network from sequence data: The small parsimony problem
by: Nguyen, C.T., et al.
Published: (2013) -
A PTAS for the k-consensus structures problem under squared Euclidean distance
by: Li, S.C., et al.
Published: (2014)