Last active
August 29, 2015 13:56
-
-
Save cfriedline/9104739 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
rTraitDisc2 <- | |
function(phy, model = "ER", k = if (is.matrix(model)) ncol(model) else 2, | |
rate = 0.1, states = LETTERS[1:k], freq = rep(1/k, k), | |
ancestor = FALSE, root.value = 1, ...) | |
{ | |
if (is.null(phy$edge.length)) | |
stop("tree has no branch length") | |
if (any(phy$edge.length < 0)) | |
stop("at least one branch length negative") | |
if (is.character(model)) { | |
switch(toupper(model), "ER" = { | |
if (length(rate) != 1) | |
stop("`rate' must have one element") | |
Q <- matrix(rate, k, k) | |
}, "ARD" = { | |
if (length(rate) != k*(k - 1)) | |
stop("`rate' must have k(k - 1) elements") | |
Q <- matrix(0, k, k) | |
Q[col(Q) != row(Q)] <- rate | |
}, "SYM" = { | |
if (length(rate) != k*(k - 1)/2) | |
stop("`rate' must have k(k - 1)/2 elements") | |
Q <- matrix(0, k, k) | |
sel <- col(Q) < row(Q) | |
Q[sel] <- rate | |
Q <- t(Q) | |
Q[sel] <- rate | |
}) | |
} | |
if (is.matrix(model)) { | |
Q <- model | |
if (ncol(Q) != nrow(Q)) | |
stop("the matrix given as `model' must be square") | |
} | |
phy <- reorder(phy, "pruningwise") | |
n <- length(phy$tip.label) | |
N <- dim(phy$edge)[1] | |
ROOT <- n + 1L | |
x <- integer(n + phy$Nnode) | |
x[ROOT] <- as.integer(root.value) | |
anc <- phy$edge[, 1] | |
des <- phy$edge[, 2] | |
el <- phy$edge.length | |
if (is.function(model)) { | |
environment(model) <- environment() # to find 'k' | |
for (i in N:1) { | |
x[des[i]] <- model(x[anc[i]], el[i], ...) | |
} | |
} else { | |
#print(freq) | |
freq <- rep(freq, each = k) | |
#print(freq) | |
Q <- Q * freq | |
diag(Q) <- 0 | |
diag(Q) <- -rowSums(Q) | |
for (i in N:1) { | |
p <- matexpo(Q * el[i])[x[anc[i]], ] | |
x[des[i]] <- sample.int(k, size = 1, FALSE, prob = p) | |
} | |
} | |
if (ancestor) { | |
if (is.null(phy$node.label)) phy <- makeNodeLabel(phy) | |
names(x) <- c(phy$tip.label, phy$node.label) | |
} else { | |
x <- x[1:n] | |
names(x) <- phy$tip.label | |
} | |
class(x) <- "factor" | |
levels(x) <- states | |
x | |
} | |
get_matrix = function(cols, numstates, rate, model) { | |
found = 0 | |
while (found < cols) { | |
root = sample(numstates, size=1) | |
temp = rTraitDisc2(tree, model=model, | |
k=numstates, states=1:numstates, | |
rate=rate, root.value=root, | |
ancestor=T) | |
temp = as.matrix(temp) | |
if (min(temp) < max(temp)) { | |
if (found == 0) { | |
m = temp | |
roots = c(root) | |
} else { | |
m = cbind(m, temp) | |
roots = c(roots, root) | |
} | |
found = found + 1 | |
} | |
} | |
return(list(m, roots)) | |
} | |
get_state_model = function(num_states) { | |
mat=matrix(seq(1:num_states**2),num_states) | |
for (i in 1:num_states) { | |
for (j in 1:num_states) { | |
mat[i,j] = abs(i-j) | |
} | |
} | |
#print(mat) | |
return(mat) | |
} | |
step_func = function(x, l) { | |
m = matrix(1:num_states,1) | |
for (i in 1:ncol(m)) { | |
diff=abs(x-i) | |
if (diff==0) { | |
m[1,i] = 0 | |
} else { | |
m[1,i] = (1/num_states)/diff | |
} | |
} | |
m[1,x] = 1-sum(m) | |
return(sample(num_states, size=1, prob=m*l)) | |
} | |
get_continuous_matrix = function(cols) { | |
r = round(rgamma(1, shape=1000, rate=1)) | |
r = sample(100, size=1) | |
m = replicate(cols, rTraitCont(tree, ancestor=T, sigma=r*100, root.value=r)) | |
m = round(as.matrix(m)) | |
return(list(m, r)) | |
} | |
num_states = 8 | |
cols = 1 | |
rate = 1 | |
tree = rtree(num_states) | |
# tree$edge.length = tree$edge.length*10 | |
tree$edge.length = rep(0.5, length(tree$edge.length)) | |
data_er = get_matrix(cols, num_states, rate, "ER") | |
data_cont = get_continuous_matrix(cols) | |
data_state = get_matrix(cols, num_states, rate, get_state_model(num_states)) | |
data_step = get_matrix(cols, num_states, rate, step_func) | |
x_er = data_er[[1]] | |
x_cont = data_cont[[1]] | |
x_cont = ifelse(x_cont<0, 0, x_cont) | |
x_state = data_state[[1]] | |
x_step = data_step[[1]] | |
#pdf("./tree_demo.pdf", height=8.5, width=20) | |
par(mfrow=c(2,2)) | |
data = list(x_er, x_cont, x_state, x_step) | |
titles = c('ER', "Continuous", "State", "Step") | |
for (i in 1:length(data)) { | |
plot(tree, show.tip.label=F) | |
labels = data[i][[1]] | |
title(titles[i]) | |
add.scale.bar() | |
Y <- labels[1:num_states] | |
A <- labels[-(1:num_states)] | |
nodelabels(A) | |
tiplabels(Y) | |
} | |
#dev.off() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment