As mentioned in my comment, I've only heard of agglomerative hierarchical clustering being applied to microarray data. With that said, here are some useful references.
Using correlation as distance metric (for hierarchical clustering)
where the distance matrix is defined to be $d = \sqrt{2(1 - r)}$
I would review Converting similarity matrix to (euclidean) distance matrix to understand why that definition makes sense.
Here is another resource that discusses the use of correlation as distances for hierarchical clustering purposes.
http://research.stowers-institute.org/efg/R/Visualization/cor-cluster/
Here is a resource that discusses the use of correlation as distances
http://ramet.elte.hu/~podani/3-Distance,%20similarity.pdf
Now, you want to use k-means with a Spearman Rank correlation matrix. I do not know how relevant that methodology is to your field, so I can't really comment much on that. However, I can ask, once you follow through with your methodology and come out with a clustering model, how will you assess how appropriate that model is for your data? And how will you compare it against other (similar k-means) models? These are appropriate questions you should address as you continue your analysis. Will you be able to use a goodness-of-fit statistic to evaluate and compare against other clustering models?
In the context of those questions, an approach I recommend is using a Gaussian mixed model hierarchical clustering model. In R, you can use the hc
function for hierarchical clustering found in themclust
package. The library uses Bayes factors estimated by BIC (they ignore the leading negative sign) to compare the various potential cluster models. This way you'll at minimum be able to say Model 1 is better than Model 2.