8080 with set of tool necessary for GraphCLust process. <br>
8181 The first step of the process is <b>Preprocessing</b>."
8282 position : " right"
83-
84-
83+
84+
8585 - title : " <b>Pre-processing</b>"
8686 intro : " This tool takes as an input file of sequences in Fasta format
8787 and creates the final input for GraphCLust based on given parameters. Parameters allows us to
@@ -129,8 +129,13 @@ steps:
129129 <br><br>"
130130 position : " left"
131131
132+ - title : " <b>Preprocessing : DONE</b>"
133+ intro : " Once preprocessing of the data is done we can move on to the next step :create a graph from FASTA file.<br>"
134+ position : " right"
135+
132136 - title : " <b>Creating a graph from FASTA</b>"
133- intro : " Next step is to create a graph from FASTA file.<br>"
137+ intro : " To create a graph we need to use a tool called <b>fasta_to_gspan</b> which you
138+ can find in GraphClust section of tool panel.<br>"
134139 position : " right"
135140 postclick :
136141 - " #gspan > div.toolTitle > div > a"
@@ -154,12 +159,19 @@ steps:
154159 intro : " Once tool is executed it will produce <b>gspan.zip file</b>.<br>"
155160 position : " top"
156161
157- - title : " <b>Creating a sparse vector</b>"
158- intro : " Next comes creation of explicit sparse feature encoding usinf <b>NSPDK</b>.<br>"
162+ - title : " <b>Creating a graph from FASTA : DONE</b>"
163+ intro : " Now we have <b>gspan.zip</b> file and can move on the next step.<br>
164+ The next step is to create sparse vector using NSPDK. <br>
165+ From GraphClust tools choose <b>NSPDK_sparseVect</b> to start the process. <br>"
159166 position : " top"
160167 postclick :
161168 - " #nspdk_sparse > div.toolTitle > div > a"
162169
170+ - title : " <b>Creating a sparse vector</b>"
171+ intro : " This tool will create explicit sparse feature encoding using <b>NSPDK</b>.<br>"
172+ position : " top"
173+
174+
163175 - title : " <b>Creating a sparse vector</b>"
164176 intro : " This tools requires 2 input files:
165177 <br>
@@ -185,14 +197,20 @@ steps:
185197 intro : " After tool is exec it will produce <b>data_svector</b> which we will use in the next step."
186198 position : " top"
187199
200+ - title : " <b>Creating a sparse vector: DONE</b>"
201+ intro : " Created <b>data_svector</b> file will be used in the next step for computing
202+ candidate cluster. For that click on <b>NSPDK_candidateClusters</b> tool."
203+ position : " top"
204+ postclick :
205+ - " #NSPDK_candidateClust > div.toolTitle > div > a"
206+
188207
189208 - title : " <b>Computing candidate clusters</b>"
190209 intro : " During this step we will compute global feature index and get top dense sets.
191210 The candidate clusters are chosen as the top ranking neighborhoods provided that the
192211 size of their overlap is below a specified threshold."
193212 position : " top"
194- postclick :
195- - " #NSPDK_candidateClust > div.toolTitle > div > a"
213+
196214
197215
198216 - title : " <b>Computing candidate clusters</b>"
@@ -240,13 +258,18 @@ steps:
240258 of the single iteration it's empty. <br>"
241259 position : " top"
242260
243-
244- - title : " <b>Preprocessing data for computing best subtree</b> "
245- intro : " Next step will do some pre-processing for computing best subtrees .<br>"
261+ - title : " <b>Computing candidate clusters : DONE</b> "
262+ intro : " Once output files are ready we can move to the nexr step by clicking on
263+ <b>premlocarna</b> tool .<br>"
246264 position : " top"
247265 postclick :
248266 - " #preMloc > div.toolTitle > div > a"
249267
268+ - title : " <b>Preprocessing data for computing best subtree</b>"
269+ intro : " This tool will do some pre-processing for computing best subtrees.<br>"
270+ position : " top"
271+
272+
250273 - title : " <b>Preprocessing data for computing best subtree</b>"
251274 intro : " This step needs 4 input files:
252275 <br>
@@ -283,15 +306,20 @@ steps:
283306 <br>"
284307 position : " top"
285308
309+ - title : " <b>Preprocessing data for computing best subtree : DONE</b>"
310+ intro : " Preprocessing for the best tree computation is done, so we can now do the actual computation
311+ of the best subtree. For that we need the tool called <b>locarna_best_subtree</b>.<br>"
312+ position : " top"
313+ postclick :
314+ - " #locarna_best_subtree > div.toolTitle > div > a"
286315
287316 - title : " <b>Computing best subtree using LocaRna</b>"
288317 intro : " This step computes a multiple sequence-structure alignment of RNA sequences using <b>LocaRna</b>.
289318 It uses tree file (from previous step) with guide tree in NEWICK format.
290319 The given tree is used as guide tree for the progressive alignment. It saves the calculation
291320 of pairwise all-vs-all similarities and construction of the guide tree. And at the end return the best subtree<br>"
292321 position : " top"
293- postclick :
294- - " #locarna_best_subtree > div.toolTitle > div > a"
322+
295323
296324 - title : " <b>Computing best subtree using LocaRna</b>"
297325 intro : " This step takes as an input following files:
@@ -317,12 +345,18 @@ steps:
317345 be used in next step to find consensus motives.<br>"
318346 position : " top"
319347
348+ - title : " <b>Computing best subtree using LocaRna : DONE</b>"
349+ intro : " Now we have <b>model.tree.stk</b> so we can find consensus motives using the next tool -
350+ <b>CMFinder_v0</b>.<br>"
351+ position : " top"
352+ postclick :
353+ - " #cmFinder > div.toolTitle > div > a"
354+
320355 - title : " <b>Finding consensus motives</b>"
321356 intro : " During this step conversion from CLUSTAL format files to STOCKHOLM format is done.
322357 Then using CMFinder we determine consensus motives for sequences.<br>"
323358 position : " top"
324- postclick :
325- - " #cmFinder > div.toolTitle > div > a"
359+
326360
327361 - title : " <b>Finding consensus motives</b>"
328362 intro : " This tool takes as an input the following files:
@@ -331,6 +365,7 @@ steps:
331365 <li>model_tree_stk : from previous step</li>
332366 <li>cmfinder_fa : from 'Preprocessing data for computing best subtree' step </li>
333367 <li>tree_matrix</li>
368+ </b>
334369 </dir>
335370 <br>"
336371 position : " top"
@@ -344,13 +379,18 @@ steps:
344379 intro : " Output of the tool is in STOCKHOLM format and contains the consensus structure. <br>"
345380 position : " top"
346381
382+ - title : " <b>Finding consensus motives : DONE</b>"
383+ intro : " Once we have consensus structure we can build covariance model with <b>cmbuild</b> tool.
384+ For that click on the tool named <b>Build covariance models </b><br>"
385+ position : " top"
386+ postclick :
387+ - " #infernal > div:nth-child(3) > div > a "
347388
348389 - title : " <b>Building Covariance Model using cmbuild</b>"
349390 intro : " In this step we cm build a covariance model of an RNA multiple alignment.
350391 <b>cmbuild</b> uses the consensus structure to determine the architecture of the covariance model. <br>"
351392 position : " top"
352- postclick :
353- - " #infernal > div:nth-child(3) > div > a "
393+
354394
355395 - title : " <b>Building Covariance Model using cmbuild</b>"
356396 intro : " As an input for this tool we give 'model_cmfinder_stk' file containing consensus
@@ -363,8 +403,9 @@ steps:
363403 intro : " Run the tool by pressing <b>'Execute' </b> button.<br>"
364404 position : " top"
365405
366- - title : " <b>Searching homologous sequences using cmsearch</b>"
367- intro : " After covariance model is built we can move on to <cmsearch>. <br>"
406+ - title : " <b>Building Covariance Model using cmbuild : DONE</b>"
407+ intro : " After covariance model is built we can move on to <cmsearch>.
408+ Simply click on <b>Search covariance model(s)</b>.<br>"
368409 position : " top"
369410 postclick :
370411 - " #infernal > div:nth-child(4) > div > a"
@@ -386,12 +427,18 @@ steps:
386427 intro : " Run the tool by pressing <b>'Execute' </b> button.<br>"
387428 position : " top"
388429
430+ - title : " <b>Searching homologous sequences using cmsearch : DONE</b>"
431+ intro : " Finally we reached the last step of our workflow!
432+ Click on <b>Report_Results</b> to do the final step. <br>"
433+ position : " top"
434+ postclick :
435+ - " #glob_report > div.toolTitle > div > a"
436+
389437 - title : " <b>Post-processing</b>"
390438 intro : " Final step of our workflow is <b>Post-processing</b>.<br>
391439 In this step we will report clusters and merge them if needed."
392440 position : " top"
393- postclick :
394- - " #glob_report > div.toolTitle > div > a"
441+
395442
396443 - title : " <b>Post-processing</b>"
397444 intro : " This tool takes as an input the following files:
@@ -401,6 +448,7 @@ steps:
401448 <li>cmsearch_results : from previous step </li>
402449 and
403450 <li>model_tree_files : from <b>'Preprocessing data for computing best subtree'</b> step</li>
451+ </b>
404452 </dir>
405453 <br>"
406454 position : " top"
0 commit comments