The Shortest Path link shows the corresponding String Graph and the "best" path connecting the kinase and the substrate.
The time to display the Shortest Path is very long if the String Score has a value lower than 0.9 .  
  String Score is the probability of the "best" association path between the kinase and the substrate in the "String" graph.  
  NetworKIN (or Ranking) Score shows how much is the String Score amplified by the net gain between the NetPhorest posterior probabilty to the NetPhorest prior probability: [String Score]*[NetPhorest posterior]/[NetPhorest prior].  
  NetPhorest Posterior Probability is described in Miller et al. 2008.  
  String Score < 0.9 - display of Shortest Path will take too long.  
  Move the mouse over some of the table headers or table values (like "Shortest Path" or "String Score" header ) to get additional explanations.  
topleftcorner logo
Home dash Download dash Help dash Contact
toprightcorner
 

This advanced search allows you to filter your results based on your own set criteria.

An example of a search for BCLAF1 is shown below.


For each column that you want to filter, type in your request.

Empty filters are ignored. If more than one filter is selected, the results are considered together ("AND" statement).

For "OR" statements, please download the results as a text spreadsheet and merge. Use % for wild card.

For numerical values (position and scores), operator signs must be used (=,<,>,<=,>=)


            or try Basic Search add as a Google Gadget
Please agree first to the non-commercial or commercial License!
Institutes behind NetworKIN Institutes behind NetworKIN
(C) 2005-2010 Rune Linding and Lars Juhl Jensen
Web-development: Adrian Pasculescu and Marina Olhovsky

get Firefox browser Valid CSS! Valid XHTML 1.0 PostgreSQL Apache
Python.org
 
Click to open STRING for selected entries!