search for: subtrees

...ppy to get suggestions for improvements (including any examples that it breaks down on). Regards, Matthew Wiener Applied Computer Science and Mathematics Department Merck Research Labs Rahway, NJ 07065-0900 732-594-5303 ----------------------------------------- First the two functions: f.get.subtrees is really just a shell to loop through f.make.subtree. (After the functions there's a .Rd file.) "f.get.subtrees" <- function(tree, k = NULL, h = NULL, add.element = NULL){ ## tree is a tree, k and h are as in cutree. ## additional elements is the name of any...

Dear R community, I would like to plot a partial hclust output, so I?am looking for a subtree function that would return an tree structure I can plot. I ran the test code of subtree following the instruction on?http://finzi.psych.upenn.edu/library/extracat/html/subtree.html However, an error message popped up: ====> library(extracat) Attaching package: ?extracat? The following object is masked

Hi, all. Last week I posted some code for extracting subtrees of trees in hclust format. Petra Steiner quickly found an example for which the code breaks, and sent it to me. The problem seems to be that I had not considered the possibility of trees with unlabeled nodes. In the new version of f.make.subtree (below), I steal some code from plot.hclust to ass...

...sections of my big dendrogram to show group 1, group 2 and so on. I don't think R has anything like subtree in Splus, unfortunately. I think what has been recommended in the past is to create a very large format plot (using a large paper size in pdf(), for example) and then zoom in to look at subtrees. -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-help-request at sta...

I'd like to be able to cut dendrograms at a height I specify and then plot the resulting subtrees. I wanted to use the dendrogram object for this purpose because there doesn't seem to be a canned way to cut a hclust object and get a list of hclust objects, but there is a function (cut) that does that for dendrograms. The problem I'm having is that when I plot a dendrogram, I can't...

Hi, I know certain subtrees I want to backup are written once and never deleted. So to reduce the time it takes rsync to run, I was thinking of putting the following .rsync-filter in each of these subtrees: P /** I can see this stops the files on the receiver side from being deleted. Does this filter also improve perform...

Hello people! I'm new to the list and to dovecot too. In advance I'd like to thank everybody who could help me, and I'll be very glad if a could help somebody here. I'm working in a project to integrate dovecot and active directory authentication for 2 weeks without total success. I've tried so many waysto solve my problem, but no one gave me the right answer. I'll

> On Mon, Dec 15, 2014 at 2:26 PM, Chad Rosier <mcrosier at codeaurora.org> > wrote: >> >> > On Mon, Dec 15, 2014 at 9:57 AM, Chad Rosier <mcrosier at codeaurora.org> >> > wrote: >> >> All, >> >> About two months ago I posted a patch that hoisted the hottest case >> >> statement from a switch statement during

FYI, I'll plan on removing this subtree on Monday of next week if no one else chimes in requesting a reprieve... On Wed, Oct 28, 2009 at 5:59 PM, PyLLVM <pyllvm at gmail.com> wrote: > No objection. > I'm studying LLVM on Win32 using visual studio. > CMake works well for it. > > > On Oct 26, 7:44 am, Chandler Carruth <chandl... at google.com> wrote: >>

Hello guys, I made the "subtree" all-in-one LLVM, clang, dragonegg &c repository. https://github.com/chapuni/llvm-project * How to play 1) git clone git://github.com/chapuni/llvm-project.git 2) (Optional) Add the line in [remote "origin"], .git/config [remote "origin"] fetch = +refs/notes/commits:refs/notes/commits And "git fetch

...access to the root of the subtree containing > the consecutive cases (and if we keep the tree balanced, O(log n) time to > extract the consecutive cases and update all data we are propagating up the > tree). This would allow a really clean lowering algorithm like: > > while (we have subtrees with property X) > extract and handle subtree in a particular way > while (we have subtrees with property Y) > extract and handle subtree in a different way > etc. > > A prototype of this can be done really easily with a non-balanced binary > tree. In order to make it relia...

Core developers, I couldn't find any simple way to send a vector of colors to apply to each terminal in plot.dendrogram() or plot.hclust()---I asked R-help about it a few weeks ago and didn't get any response---so I hacked that functionality into the plot.dendrgram code (see below for hacked function plus examples).... Is there any chance this functionality could be added to the

Chandler Carruth <chandlerc at google.com> writes: > FYI, I'll plan on removing this subtree on Monday of next week if no > one else chimes in requesting a reprieve... The Visual C++ project files are still there. Anyone objected by private e-mail? Can we know the reasons just in case we can enhance the cmake build on accordance? In the past, the only reason for not removing

> On Jul 22, 2016, at 1:16 AM, Simon Taylor via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Hi all, > > Ill start by saying Ive skimmed this thread and am not actually a user of LLVM at all, but had some git thoughts that might be worth contributing. > >> On 22 Jul 2016, at 01:16, Sanjoy Das via llvm-dev <llvm-dev at lists.llvm.org> wrote: >>

I'd like to change the way plot.hclust displays an hclust object. Here's a description of how it's done now, from the R documentation of hclust: In hierarchical cluster displays, a decision is needed at each merge to specify which subtree should go on the left and which on the right. Since, for n observations there are n-1 merges, there are 2^{(n-1)} possible

On Nov 6, 2009, at 9:10 AM, Óscar Fuentes wrote: > Chandler Carruth <chandlerc at google.com> writes: > >> FYI, I'll plan on removing this subtree on Monday of next week if no >> one else chimes in requesting a reprieve... > > The Visual C++ project files are still there. > > Anyone objected by private e-mail? Can we know the reasons just in > case

...branches can be mannually reorder ed so that most of the reds are to one side and most of the reds. This gets a bit more complicated when rows are also to be ordered. I don't time to manually reorder every dataset and want to automate the process. 3. How do we create a criterion to arrange the subtrees in such a way to show most visual distinction. Sorry if this is a bit vague. Thank you very much. Regards, Adai. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: ecluster.example.txt Url: https://stat.ethz.ch/pipermail/r-help/attachments/2003...

Hi, It seems that dsync 2.1.10 does not correctly handle renames of mailbox subtrees. The scenario is as follows. There are two servers, A and B, both running dovecot 2.1.10 and configured to use mdbox. Automatic replication between them is disabled, ie. replication plugin is not active and replicator service has process_min_avail = 0. I perform the following actions: 1. On A: do...

Hi, (bcc: mlir at tensorflow.org FYI) I am following-up on the integration of MLIR in LLVM as a subproject (Re: http://lists.llvm.org/pipermail/llvm-dev/2019-October/135687.html ). We're aiming to integrate into the monorepo next month. Right now our intent is for MLIR to live in a top-level directory in parallel to clang, lldb, lld, etc. Our top option for the integration is to perform a

On Wed, Jul 20, 2011 at 9:32 PM, Chris Lattner <clattner at apple.com> wrote: > On Jul 20, 2011, at 11:47 AM, Jakob Stoklund Olesen wrote: > > >>> If you can work with Jeffrey to come up with better instructions, that > would be great. > >>> > >>> Just make sure they are newbie-proof. > >> > >> Wouldn't it be easier at some