|
Main.AboutBNA History
Hide minor edits - Show changes to markup
January 06, 2009, at 01:55 PM
by 75.143.68.139 -
Changed lines 12-13 from:
All programs have been tested in LINUX and cygwin(simulated Linux in Windows) environments.
to:
All programs have been tested in LINUX and cygwin(emulated Linux in Windows) environments.
October 08, 2008, at 04:43 PM
by 75.143.68.139 -
Added lines 23-25:
There are {$TotalCount} visits since Oct 6, 2008.
September 09, 2008, at 08:06 PM
by 75.143.68.139 -
Changed lines 16-18 from:
PNAS, 2003, 100(22):12820-4
PDF
to:
PNAS, 2003, 100(22):12820-4 PDF
September 09, 2008, at 08:06 PM
by 75.143.68.139 -
Changed lines 17-18 from:
http://www.pnas.org/cgi/content/full/100/22/12820
to:
Changed lines 22-23 from:
3)Qin H, Yang Li, Detection of Changes in Transitive Associations by Shortest-path Analysis of Protein Interaction Networks Integrated with Gene Expression Profiles. BMEI (1) 2008, 418-423. pdf
to:
3)Qin H, Yang Li, Detection of Changes in Transitive Associations by Shortest-path Analysis of Protein Interaction Networks Integrated with Gene Expression Profiles. BMEI (1) 2008, 418-423. PDF
September 09, 2008, at 08:05 PM
by 75.143.68.139 -
Added lines 21-23:
3)Qin H, Yang Li, Detection of Changes in Transitive Associations by Shortest-path Analysis of Protein Interaction Networks Integrated with Gene Expression Profiles. BMEI (1) 2008, 418-423. pdf
March 24, 2006, at 10:48 PM
by 128.151.242.80 -
Changed lines 10-11 from:
This program generate a MS02 network null model.
to:
This program generate a MS02 network null model in pair-wise format.
March 23, 2006, at 02:42 PM
by 128.151.242.80 -
Added lines 1-20:
This software package contains some C++ and PERL programs that are useful for studying biological networks, especially protein interaction networks and gene coexpression networks.
Program 'dk': This program calculate the shortest-path for all pairwise combinations within a input list of proteins. The network is input in pairwise format. This network is unweighted and undirected. The outputs are the shortest-path distance matrix, the number of shortes-path in a distance matrix, and a detail file that contains all the shortest-path for all the combinations.
Program 'wdk': This program calculate the shortest-path distance for a weighted, undirected network. It outputs a distance matrix and the shortest-paths.
Program 'ms02': This program generate a MS02 network null model.
All programs have been tested in LINUX and cygwin(simulated Linux in Windows) environments.
Reference: 1)Qin H, Lu HH, Wu WB, Li WH. Evolution of the yeast protein interaction network.
PNAS, 2003, 100(22):12820-4
http://www.pnas.org/cgi/content/full/100/22/12820
2)Maslov S, Sneppen K. Specificity and stability in topology of protein networks.
Science. 2002, 296(5569):910-3.
|
|