You can subscribe to this list here.
2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}
(13) 
_{Nov}
(22) 
_{Dec}
(35) 

2002 
_{Jan}
(33) 
_{Feb}
(46) 
_{Mar}
(56) 
_{Apr}
(29) 
_{May}
(56) 
_{Jun}
(30) 
_{Jul}
(64) 
_{Aug}
(54) 
_{Sep}
(86) 
_{Oct}
(106) 
_{Nov}
(50) 
_{Dec}
(67) 
2003 
_{Jan}
(78) 
_{Feb}
(98) 
_{Mar}
(51) 
_{Apr}
(95) 
_{May}
(53) 
_{Jun}
(103) 
_{Jul}
(93) 
_{Aug}
(64) 
_{Sep}
(87) 
_{Oct}
(93) 
_{Nov}
(78) 
_{Dec}
(86) 
2004 
_{Jan}
(83) 
_{Feb}
(90) 
_{Mar}
(64) 
_{Apr}
(112) 
_{May}
(103) 
_{Jun}
(57) 
_{Jul}
(101) 
_{Aug}
(84) 
_{Sep}
(92) 
_{Oct}
(96) 
_{Nov}
(86) 
_{Dec}
(32) 
2005 
_{Jan}
(88) 
_{Feb}
(108) 
_{Mar}
(111) 
_{Apr}
(107) 
_{May}
(120) 
_{Jun}
(134) 
_{Jul}
(143) 
_{Aug}
(129) 
_{Sep}
(75) 
_{Oct}
(171) 
_{Nov}
(125) 
_{Dec}
(65) 
2006 
_{Jan}
(95) 
_{Feb}
(105) 
_{Mar}
(114) 
_{Apr}
(124) 
_{May}
(87) 
_{Jun}
(66) 
_{Jul}
(88) 
_{Aug}
(65) 
_{Sep}
(71) 
_{Oct}
(92) 
_{Nov}
(94) 
_{Dec}
(60) 
2007 
_{Jan}
(81) 
_{Feb}
(84) 
_{Mar}
(82) 
_{Apr}
(68) 
_{May}
(58) 
_{Jun}
(80) 
_{Jul}
(30) 
_{Aug}
(47) 
_{Sep}
(68) 
_{Oct}
(92) 
_{Nov}
(59) 
_{Dec}
(17) 
2008 
_{Jan}
(69) 
_{Feb}
(81) 
_{Mar}
(60) 
_{Apr}
(34) 
_{May}
(47) 
_{Jun}
(65) 
_{Jul}
(46) 
_{Aug}
(49) 
_{Sep}
(84) 
_{Oct}
(43) 
_{Nov}
(33) 
_{Dec}
(30) 
2009 
_{Jan}
(62) 
_{Feb}
(48) 
_{Mar}
(123) 
_{Apr}
(73) 
_{May}
(72) 
_{Jun}
(69) 
_{Jul}
(78) 
_{Aug}
(72) 
_{Sep}
(99) 
_{Oct}
(82) 
_{Nov}
(70) 
_{Dec}
(53) 
2010 
_{Jan}
(112) 
_{Feb}
(95) 
_{Mar}
(127) 
_{Apr}
(110) 
_{May}
(135) 
_{Jun}
(91) 
_{Jul}
(91) 
_{Aug}
(79) 
_{Sep}
(136) 
_{Oct}
(63) 
_{Nov}
(38) 
_{Dec}
(64) 
2011 
_{Jan}
(59) 
_{Feb}
(109) 
_{Mar}
(191) 
_{Apr}
(130) 
_{May}
(94) 
_{Jun}
(90) 
_{Jul}
(89) 
_{Aug}
(127) 
_{Sep}
(135) 
_{Oct}
(113) 
_{Nov}
(136) 
_{Dec}
(140) 
2012 
_{Jan}
(158) 
_{Feb}
(131) 
_{Mar}
(151) 
_{Apr}
(88) 
_{May}
(121) 
_{Jun}
(85) 
_{Jul}
(82) 
_{Aug}
(56) 
_{Sep}
(55) 
_{Oct}
(125) 
_{Nov}
(87) 
_{Dec}
(65) 
2013 
_{Jan}
(81) 
_{Feb}
(64) 
_{Mar}
(90) 
_{Apr}
(77) 
_{May}
(80) 
_{Jun}
(92) 
_{Jul}
(92) 
_{Aug}
(70) 
_{Sep}
(69) 
_{Oct}
(60) 
_{Nov}
(99) 
_{Dec}
(50) 
2014 
_{Jan}
(89) 
_{Feb}
(66) 
_{Mar}
(52) 
_{Apr}
(70) 
_{May}
(68) 
_{Jun}
(44) 
_{Jul}
(68) 
_{Aug}
(81) 
_{Sep}
(152) 
_{Oct}
(106) 
_{Nov}
(74) 
_{Dec}
(57) 
2015 
_{Jan}
(93) 
_{Feb}
(48) 
_{Mar}
(60) 
_{Apr}
(107) 
_{May}
(82) 
_{Jun}
(64) 
_{Jul}
(10) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 



1

2

3

4
(1) 
5

6

7
(1) 
8
(1) 
9
(1) 
10
(2) 
11

12
(6) 
13
(3) 
14
(4) 
15
(6) 
16
(4) 
17
(1) 
18
(3) 
19

20

21
(2) 
22
(5) 
23
(4) 
24
(3) 
25
(3) 
26
(7) 
27
(1) 
28
(1) 
29
(3) 
30
(2) 
31
(5) 


From: Buz Barstow <buzb@ma...>  20080129 14:56:39

Hi Jason, Thanks a lot for this! I was able to code up a very simple solution to my problem using Tsjerk's suggestion. In my problem I have a series of very similar structures, and I wanted to calculate the principal axes of a section of these structures and then align the principal axes of another section of the structure with those principal axes: while i < len(eigVectors0001_1): # the m matrix is a matrix of the principal axes of segment 1 of structure 1 m = array([eigVectors0001_1[1], eigVectors0001_2[1], eigVectors0001_3[1]]) m = transpose(m) # The n matrix is a matrix of the principal axes of segment of structure i n = array([eigVectors0001_1[i], eigVectors0001_2[i], eigVectors0001_3[i]]) n = transpose(n) # r is the rotation matrix to rotate the n axes onto the m axes r = dot(m,inverse(n)) # p is a matrix of the principal axes of segment 2 in structure i p = array([eigVectors0002_1[i], eigVectors0002_2[i], eigVectors0002_3[i]]) p = transpose(p) # q are the rotated principal axes of segment 2 in structure i q = dot(r,p) i+=1 Thanks again! and all the best, Buz On Jan 29, 2008, at 8:31 AM, Jason Vertrees wrote: > Buz, > > Tsjerk's answer is right on. This has already been implemented for > PyMOL as a > plugin. See Kabsch/optAlign from "cealign," here: > http://www.pymolwiki.org/index.php/Kabsch > The code is opensource and so can be applied elsewhere. > > Another simple method is to simply calculate the SVD of the > correlation > matrix. Then multiply the right and left singular vectors by each > other  > that will yield the DxD rotation matrix (where D is the dimension of > your > vector sets). (This is how Kabsch/optAlign works.) > >  Jason > > On Monday 28 January 2008 10:48:29 pm > pymolusersrequest@... wrote: >>  >> >> Message: 3 >> Date: Sat, 26 Jan 2008 10:04:06 +0100 >> From: "Tsjerk Wassenaar" <tsjerkw@...> >> Subject: Re: [PyMOL] Algorithm to Rotate One Set of Vectors onto >> Another >> To: "Buz Barstow" <buzb@...> >> Cc: pymolusers@... >> MessageID: >> <8ff898150801260104k4902e5f0tcb94e8ebbbf1e027@...> >> ContentType: text/plain; charset=ISO88591 >> >> Hi Buz, >> >> To my opinion, this is not the best place for your question. Pymol is >> a molecular viewer... >> But the question itself is basically trivial from the linear algebra >> point of view. >> >> If X is your source set of orthogonal vectors and Y is the target, >> then you should have some sort of matrix R to satisfy >> >> Y = RX >> >> But, since it should only be a rotation, you'll first have to >> transform X and Y to their orthonormal counterparts N and M: >> >> M = RN >> >> Then >> >> MN^1=RNN^1 >> >> such that >> >> R = MN^1 >> >> If both sets are of equal dimensions (and full rank), there's an >> exact >> solution. Otherwise, there's a bit more trouble... >> >> So, taking your favourite language with the proper linear algebra >> package, it comes down to: >> >> normalize X > N >> normalize Y > M >> invert N >> multiply M with the inverse of N >> >> By the way, you're probably dealing with 3x3 matrices here (molecules >> in cartesian space), in which case the routines are simple enough to >> write down yourself (I believe these were even in the array.py I >> posted like two days ago). >> >> Hope it helps, >> >> Tsjerk >> >> On Jan 25, 2008 10:55 PM, Buz Barstow <buzb@...> wrote: >>> Dear All, >>> >>> I'm looking for an algorithm that will allow me to derive a >>> transformation matrix that superimposes one set of orthogonal >>> vectors >>> onto another set of orthogonal vectors, that I can then use to >>> transform another set of orthogonal vectors. >>> >>> Thanks! and all the best, >>> >>> Buz > > > >  > > Jason Vertrees (javertre@...) > Doctoral Candidate > Biophysical, Structural & Computational Biology Program > University of Texas Medical Branch > Galveston, Texas > > http://www.best.utmb.edu/ > http://www.pymolwiki.org/ > >  > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2008. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ > _______________________________________________ > PyMOLusers mailing list > PyMOLusers@... > https://lists.sourceforge.net/lists/listinfo/pymolusers 
From: Jason Vertrees <javertre@ut...>  20080129 13:30:49

Buz, Tsjerk's answer is right on. This has already been implemented for PyMOL a= s a=20 plugin. See Kabsch/optAlign from "cealign," here: =20 http://www.pymolwiki.org/index.php/Kabsch The code is opensource and so can be applied elsewhere. Another simple method is to simply calculate the SVD of the correlation=20 matrix. Then multiply the right and left singular vectors by each other = =20 that will yield the DxD rotation matrix (where D is the dimension of your=20 vector sets). (This is how Kabsch/optAlign works.) =2D Jason On Monday 28 January 2008 10:48:29 pm=20 pymolusersrequest@... wrote: >  > > Message: 3 > Date: Sat, 26 Jan 2008 10:04:06 +0100 > From: "Tsjerk Wassenaar" <tsjerkw@...> > Subject: Re: [PyMOL] Algorithm to Rotate One Set of Vectors onto > =A0=A0=A0=A0=A0=A0=A0=A0Another > To: "Buz Barstow" <buzb@...> > Cc: pymolusers@... > MessageID: > =A0=A0=A0=A0=A0=A0=A0=A0<8ff898150801260104k4902e5f0tcb94e8ebbbf1e027@...= l.gmail.com> > ContentType: text/plain; charset=3DISO88591 > > Hi Buz, > > To my opinion, this is not the best place for your question. Pymol is > a molecular viewer... > But the question itself is basically trivial from the linear algebra > point of view. > > If X is your source set of orthogonal vectors and Y is the target, > then you should have some sort of matrix R to satisfy > > Y =3D RX > > But, since it should only be a rotation, you'll first have to > transform X and Y to their orthonormal counterparts N and M: > > M =3D RN > > Then > > MN^1=3DRNN^1 > > such that > > R =3D MN^1 > > If both sets are of equal dimensions (and full rank), there's an exact > solution. Otherwise, there's a bit more trouble... > > So, taking your favourite language with the proper linear algebra > package, it comes down to: > > normalize X > N > normalize Y > M > invert N > multiply M with the inverse of N > > By the way, you're probably dealing with 3x3 matrices here (molecules > in cartesian space), in which case the routines are simple enough to > write down yourself (I believe these were even in the array.py I > posted like two days ago). > > Hope it helps, > > Tsjerk > > On Jan 25, 2008 10:55 PM, Buz Barstow <buzb@...> wrote: > > Dear All, > > > > I'm looking for an algorithm that will allow me to derive a > > transformation matrix that superimposes one set of orthogonal vectors > > onto another set of orthogonal vectors, that I can then use to > > transform another set of orthogonal vectors. > > > > Thanks! and all the best, > > > > Buz =2D=20 Jason Vertrees (javertre@...) Doctoral Candidate Biophysical, Structural & Computational Biology Program University of Texas Medical Branch=20 Galveston, Texas http://www.best.utmb.edu/ http://www.pymolwiki.org/ 
From: DeLano Scientific <delsci@de...>  20080129 03:48:27

Chris, Thanks  fixed. Cheers, Warren > Original Message > From: pymolusersbounces@... > [mailto:pymolusersbounces@...] On Behalf > Of Chris Want > Sent: Monday, January 28, 2008 9:04 AM > To: pymolusers@... > Subject: [PyMOL] Small VRML export bug > > > Hi Warren, > > In the current SVN sources, line 1214 of layer1/Ray.c sets > "shininess" equal to 8 for exported VRML files. The VRML97 > specification, however, wants shininess to be between 0.0 and 1.0. > So, I would recommend changing the shininess to 0.8. > > Cheers, > Chris > >  > ____________________________________________________________________ > ( Chris Want ) > ( Research Computing Support ) > ( Academic Information and Communication Technologies (AICT) ) > ( University of Alberta ) > ( Tel: 17804929418 ) >  > > >  >  > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2008. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ > _______________________________________________ > PyMOLusers mailing list > PyMOLusers@... > https://lists.sourceforge.net/lists/listinfo/pymolusers 